./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 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--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-?-3598765 [2022-07-21 15:42:22,154 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 15:42:22,157 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 15:42:22,200 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 15:42:22,200 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 15:42:22,202 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 15:42:22,206 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 15:42:22,209 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 15:42:22,211 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 15:42:22,216 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 15:42:22,217 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 15:42:22,222 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 15:42:22,222 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 15:42:22,224 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 15:42:22,225 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 15:42:22,228 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 15:42:22,229 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 15:42:22,230 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 15:42:22,232 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 15:42:22,237 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 15:42:22,238 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 15:42:22,239 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 15:42:22,241 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 15:42:22,242 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 15:42:22,243 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 15:42:22,258 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 15:42:22,259 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 15:42:22,259 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 15:42:22,260 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 15:42:22,260 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 15:42:22,262 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 15:42:22,262 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 15:42:22,264 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 15:42:22,264 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 15:42:22,266 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 15:42:22,267 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 15:42:22,267 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 15:42:22,267 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 15:42:22,268 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 15:42:22,268 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 15:42:22,269 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 15:42:22,270 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 15:42:22,278 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-21 15:42:22,311 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 15:42:22,312 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 15:42:22,312 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 15:42:22,313 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 15:42:22,313 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 15:42:22,314 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 15:42:22,314 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 15:42:22,315 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 15:42:22,315 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 15:42:22,316 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 15:42:22,316 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 15:42:22,316 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 15:42:22,317 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 15:42:22,317 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 15:42:22,317 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 15:42:22,318 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 15:42:22,318 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 15:42:22,318 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 15:42:22,318 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 15:42:22,318 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 15:42:22,319 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 15:42:22,319 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 15:42:22,319 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 15:42:22,319 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 15:42:22,320 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 15:42:22,320 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 15:42:22,320 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 15:42:22,320 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 15:42:22,321 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 15:42:22,321 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 15:42:22,321 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-21 15:42:22,649 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 15:42:22,668 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 15:42:22,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 15:42:22,673 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 15:42:22,674 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 15:42:22,676 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-21 15:42:22,743 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f370dc151/94b095ec738240cb97bf63f1d89f7cf0/FLAG03dee4bfa [2022-07-21 15:42:23,526 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 15:42:23,527 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-21 15:42:23,587 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f370dc151/94b095ec738240cb97bf63f1d89f7cf0/FLAG03dee4bfa [2022-07-21 15:42:23,718 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f370dc151/94b095ec738240cb97bf63f1d89f7cf0 [2022-07-21 15:42:23,720 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 15:42:23,721 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 15:42:23,724 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 15:42:23,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 15:42:23,727 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 15:42:23,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 03:42:23" (1/1) ... [2022-07-21 15:42:23,729 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cc14fe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:42:23, skipping insertion in model container [2022-07-21 15:42:23,729 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 03:42:23" (1/1) ... [2022-07-21 15:42:23,736 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 15:42:23,891 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 15:42:27,922 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:27,925 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[374705,374718] [2022-07-21 15:42:27,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[374851,374864] [2022-07-21 15:42:27,927 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[375016,375029] [2022-07-21 15:42:27,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[375174,375187] [2022-07-21 15:42:27,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[375332,375345] [2022-07-21 15:42:27,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[375490,375503] [2022-07-21 15:42:27,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[375650,375663] [2022-07-21 15:42:27,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[375809,375822] [2022-07-21 15:42:27,931 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:27,931 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:27,932 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:27,932 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:27,932 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:27,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[376693,376706] [2022-07-21 15:42:27,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[376844,376857] [2022-07-21 15:42:27,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[376995,377008] [2022-07-21 15:42:27,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[377147,377160] [2022-07-21 15:42:27,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[377296,377309] [2022-07-21 15:42:27,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[377444,377457] [2022-07-21 15:42:27,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[377601,377614] [2022-07-21 15:42:27,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[377750,377763] [2022-07-21 15:42:27,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[377906,377919] [2022-07-21 15:42:27,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[378059,378072] [2022-07-21 15:42:27,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[378205,378218] [2022-07-21 15:42:27,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[378348,378361] [2022-07-21 15:42:27,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[378500,378513] [2022-07-21 15:42:27,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[378646,378659] [2022-07-21 15:42:27,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[378791,378804] [2022-07-21 15:42:27,949 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:27,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[379096,379109] [2022-07-21 15:42:27,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[379251,379264] [2022-07-21 15:42:27,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[379403,379416] [2022-07-21 15:42:27,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[379558,379571] [2022-07-21 15:42:27,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[379722,379735] [2022-07-21 15:42:27,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[379878,379891] [2022-07-21 15:42:27,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[380042,380055] [2022-07-21 15:42:27,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[380184,380197] [2022-07-21 15:42:27,955 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:27,955 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:27,955 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:27,956 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:27,956 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:27,956 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:27,957 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:27,957 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:27,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[381591,381604] [2022-07-21 15:42:27,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[381755,381768] [2022-07-21 15:42:27,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[381920,381933] [2022-07-21 15:42:27,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[382085,382098] [2022-07-21 15:42:27,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[382251,382264] [2022-07-21 15:42:27,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[382416,382429] [2022-07-21 15:42:27,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[382583,382596] [2022-07-21 15:42:27,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[382743,382756] [2022-07-21 15:42:27,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[382905,382918] [2022-07-21 15:42:27,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[383064,383077] [2022-07-21 15:42:27,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[383210,383223] [2022-07-21 15:42:27,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[383353,383366] [2022-07-21 15:42:27,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[383497,383510] [2022-07-21 15:42:27,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[383640,383653] [2022-07-21 15:42:27,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[383784,383797] [2022-07-21 15:42:27,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[383925,383938] [2022-07-21 15:42:27,971 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:27,971 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:27,972 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:27,972 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:27,973 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:27,973 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:27,973 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:27,973 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:27,974 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:27,975 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:27,975 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:27,975 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:27,976 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:27,976 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:27,977 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:27,977 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:27,978 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:27,978 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:27,978 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:27,979 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:27,979 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:27,979 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:27,980 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:27,980 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:27,980 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:27,980 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:27,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 15:42:28,018 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 15:42:28,365 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[374560,374573] [2022-07-21 15:42:28,366 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[374705,374718] [2022-07-21 15:42:28,366 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[374851,374864] [2022-07-21 15:42:28,367 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[375016,375029] [2022-07-21 15:42:28,367 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[375174,375187] [2022-07-21 15:42:28,367 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[375332,375345] [2022-07-21 15:42:28,368 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[375490,375503] [2022-07-21 15:42:28,368 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[375650,375663] [2022-07-21 15:42:28,368 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[375809,375822] [2022-07-21 15:42:28,369 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[375948,375961] [2022-07-21 15:42:28,369 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[376090,376103] [2022-07-21 15:42:28,369 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[376239,376252] [2022-07-21 15:42:28,370 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[376378,376391] [2022-07-21 15:42:28,370 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[376533,376546] [2022-07-21 15:42:28,370 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[376693,376706] [2022-07-21 15:42:28,371 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[376844,376857] [2022-07-21 15:42:28,371 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[376995,377008] [2022-07-21 15:42:28,371 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[377147,377160] [2022-07-21 15:42:28,372 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[377296,377309] [2022-07-21 15:42:28,372 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[377444,377457] [2022-07-21 15:42:28,372 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[377601,377614] [2022-07-21 15:42:28,373 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[377750,377763] [2022-07-21 15:42:28,373 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[377906,377919] [2022-07-21 15:42:28,373 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[378059,378072] [2022-07-21 15:42:28,374 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[378205,378218] [2022-07-21 15:42:28,374 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[378348,378361] [2022-07-21 15:42:28,374 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[378500,378513] [2022-07-21 15:42:28,374 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[378646,378659] [2022-07-21 15:42:28,375 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[378791,378804] [2022-07-21 15:42:28,375 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[378945,378958] [2022-07-21 15:42:28,375 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[379096,379109] [2022-07-21 15:42:28,387 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,388 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,388 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,388 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,389 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,389 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,389 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,389 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,390 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,390 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,391 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,391 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,391 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,392 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,392 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,392 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,393 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,393 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,393 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,394 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,394 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,394 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,394 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,395 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,395 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,395 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,396 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,396 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,396 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,397 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,397 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,397 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,398 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,398 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,398 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,399 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,399 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,399 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,400 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,400 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,400 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,401 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,401 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,401 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,402 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,402 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,402 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,403 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,403 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,403 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,403 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,404 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,404 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,404 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,405 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,405 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,405 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-21 15:42:28,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 15:42:28,719 INFO L208 MainTranslator]: Completed translation [2022-07-21 15:42:28,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:42:28 WrapperNode [2022-07-21 15:42:28,719 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 15:42:28,720 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 15:42:28,721 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 15:42:28,721 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 15:42:28,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:42:28" (1/1) ... [2022-07-21 15:42:28,860 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:42:28" (1/1) ... [2022-07-21 15:42:29,274 INFO L137 Inliner]: procedures = 640, calls = 2778, calls flagged for inlining = 295, calls inlined = 219, statements flattened = 6490 [2022-07-21 15:42:29,288 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 15:42:29,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 15:42:29,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 15:42:29,289 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 15:42:29,297 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:42:28" (1/1) ... [2022-07-21 15:42:29,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:42:28" (1/1) ... [2022-07-21 15:42:29,422 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:42:28" (1/1) ... [2022-07-21 15:42:29,423 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:42:28" (1/1) ... [2022-07-21 15:42:29,796 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:42:28" (1/1) ... [2022-07-21 15:42:29,859 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:42:28" (1/1) ... [2022-07-21 15:42:29,904 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:42:28" (1/1) ... [2022-07-21 15:42:30,008 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 15:42:30,011 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 15:42:30,011 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 15:42:30,011 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 15:42:30,012 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:42:28" (1/1) ... [2022-07-21 15:42:30,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 15:42:30,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:42:30,045 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 15:42:30,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 15:42:30,086 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_97 [2022-07-21 15:42:30,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_97 [2022-07-21 15:42:30,086 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-21 15:42:30,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-21 15:42:30,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-21 15:42:30,087 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-21 15:42:30,087 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_wakeup [2022-07-21 15:42:30,087 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_wakeup [2022-07-21 15:42:30,087 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_read_fifo [2022-07-21 15:42:30,087 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_read_fifo [2022-07-21 15:42:30,087 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_write_fifo [2022-07-21 15:42:30,088 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_write_fifo [2022-07-21 15:42:30,088 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-21 15:42:30,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-21 15:42:30,088 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_net2272 [2022-07-21 15:42:30,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_net2272 [2022-07-21 15:42:30,088 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_io_mem_remap [2022-07-21 15:42:30,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_io_mem_remap [2022-07-21 15:42:30,089 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-21 15:42:30,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-21 15:42:30,089 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2022-07-21 15:42:30,089 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2022-07-21 15:42:30,089 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-21 15:42:30,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-21 15:42:30,090 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_read [2022-07-21 15:42:30,090 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_read [2022-07-21 15:42:30,090 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_in [2022-07-21 15:42:30,090 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_in [2022-07-21 15:42:30,090 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_enable [2022-07-21 15:42:30,090 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_enable [2022-07-21 15:42:30,091 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_pio_advance [2022-07-21 15:42:30,091 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_pio_advance [2022-07-21 15:42:30,091 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-21 15:42:30,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-21 15:42:30,091 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-21 15:42:30,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-21 15:42:30,091 INFO L130 BoogieDeclarations]: Found specification of procedure set_fifo_bytecount [2022-07-21 15:42:30,092 INFO L138 BoogieDeclarations]: Found implementation of procedure set_fifo_bytecount [2022-07-21 15:42:30,092 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_usb_reset [2022-07-21 15:42:30,092 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_usb_reset [2022-07-21 15:42:30,092 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-21 15:42:30,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-21 15:42:30,092 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-21 15:42:30,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-21 15:42:30,093 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-21 15:42:30,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-21 15:42:30,093 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_usb_reinit [2022-07-21 15:42:30,093 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_usb_reinit [2022-07-21 15:42:30,093 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_pci_unregister [2022-07-21 15:42:30,093 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_pci_unregister [2022-07-21 15:42:30,094 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_resource [2022-07-21 15:42:30,094 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_resource [2022-07-21 15:42:30,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 15:42:30,094 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_101 [2022-07-21 15:42:30,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_101 [2022-07-21 15:42:30,094 INFO L130 BoogieDeclarations]: Found specification of procedure type_string [2022-07-21 15:42:30,094 INFO L138 BoogieDeclarations]: Found implementation of procedure type_string [2022-07-21 15:42:30,095 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_gadget_release [2022-07-21 15:42:30,095 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_gadget_release [2022-07-21 15:42:30,095 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-21 15:42:30,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-21 15:42:30,095 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_handle_dma [2022-07-21 15:42:30,095 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_handle_dma [2022-07-21 15:42:30,096 INFO L130 BoogieDeclarations]: Found specification of procedure allow_status [2022-07-21 15:42:30,096 INFO L138 BoogieDeclarations]: Found implementation of procedure allow_status [2022-07-21 15:42:30,096 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-07-21 15:42:30,096 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-07-21 15:42:30,096 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-21 15:42:30,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-21 15:42:30,096 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-21 15:42:30,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-21 15:42:30,097 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_request_dma [2022-07-21 15:42:30,097 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_request_dma [2022-07-21 15:42:30,097 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-21 15:42:30,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-21 15:42:30,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 15:42:30,098 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-21 15:42:30,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-21 15:42:30,098 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-21 15:42:30,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-21 15:42:30,098 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2022-07-21 15:42:30,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2022-07-21 15:42:30,098 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_ep_read [2022-07-21 15:42:30,099 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_ep_read [2022-07-21 15:42:30,099 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2022-07-21 15:42:30,099 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2022-07-21 15:42:30,099 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-21 15:42:30,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-21 15:42:30,099 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2022-07-21 15:42:30,100 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_device [2022-07-21 15:42:30,100 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-21 15:42:30,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-21 15:42:30,100 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_check_return_value_probe [2022-07-21 15:42:30,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_check_return_value_probe [2022-07-21 15:42:30,100 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_set_halt_and_wedge [2022-07-21 15:42:30,100 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_set_halt_and_wedge [2022-07-21 15:42:30,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 15:42:30,101 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_interrupt_interrupt_instance_0 [2022-07-21 15:42:30,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_interrupt_interrupt_instance_0 [2022-07-21 15:42:30,101 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_check_return_value_probe [2022-07-21 15:42:30,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_check_return_value_probe [2022-07-21 15:42:30,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 15:42:30,102 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-21 15:42:30,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-21 15:42:30,102 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-07-21 15:42:30,102 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-07-21 15:42:30,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 15:42:30,102 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-21 15:42:30,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-21 15:42:30,103 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-21 15:42:30,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-21 15:42:30,103 INFO L130 BoogieDeclarations]: Found specification of procedure set_halt [2022-07-21 15:42:30,103 INFO L138 BoogieDeclarations]: Found implementation of procedure set_halt [2022-07-21 15:42:30,103 INFO L130 BoogieDeclarations]: Found specification of procedure usb_ep_set_maxpacket_limit [2022-07-21 15:42:30,103 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_ep_set_maxpacket_limit [2022-07-21 15:42:30,104 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-21 15:42:30,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-21 15:42:30,104 INFO L130 BoogieDeclarations]: Found specification of procedure writel [2022-07-21 15:42:30,104 INFO L138 BoogieDeclarations]: Found implementation of procedure writel [2022-07-21 15:42:30,104 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_set_wedge [2022-07-21 15:42:30,104 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_set_wedge [2022-07-21 15:42:30,104 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_ep_reset [2022-07-21 15:42:30,105 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_ep_reset [2022-07-21 15:42:30,105 INFO L130 BoogieDeclarations]: Found specification of procedure writeb [2022-07-21 15:42:30,105 INFO L138 BoogieDeclarations]: Found implementation of procedure writeb [2022-07-21 15:42:30,105 INFO L130 BoogieDeclarations]: Found specification of procedure writew [2022-07-21 15:42:30,105 INFO L138 BoogieDeclarations]: Found implementation of procedure writew [2022-07-21 15:42:30,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 15:42:30,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 15:42:30,105 INFO L130 BoogieDeclarations]: Found specification of procedure stop_activity [2022-07-21 15:42:30,106 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_activity [2022-07-21 15:42:30,106 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-07-21 15:42:30,106 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-07-21 15:42:30,106 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-21 15:42:30,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-21 15:42:30,106 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_irq [2022-07-21 15:42:30,106 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_irq [2022-07-21 15:42:30,107 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_handle_ep [2022-07-21 15:42:30,107 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_handle_ep [2022-07-21 15:42:30,107 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_start [2022-07-21 15:42:30,107 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_start [2022-07-21 15:42:30,107 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_ep_write [2022-07-21 15:42:30,107 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_ep_write [2022-07-21 15:42:30,107 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_pci_probe [2022-07-21 15:42:30,108 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_pci_probe [2022-07-21 15:42:30,108 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-21 15:42:30,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-21 15:42:30,108 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_probe_fin [2022-07-21 15:42:30,108 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_probe_fin [2022-07-21 15:42:30,108 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_fifo_flush [2022-07-21 15:42:30,108 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_fifo_flush [2022-07-21 15:42:30,109 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_done [2022-07-21 15:42:30,109 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_done [2022-07-21 15:42:30,109 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_cancel_dma [2022-07-21 15:42:30,109 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_cancel_dma [2022-07-21 15:42:30,109 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_io_mem_unmap [2022-07-21 15:42:30,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_io_mem_unmap [2022-07-21 15:42:30,109 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_dequeue_all [2022-07-21 15:42:30,110 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_dequeue_all [2022-07-21 15:42:30,110 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_post_probe [2022-07-21 15:42:30,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_post_probe [2022-07-21 15:42:30,110 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_probe_init [2022-07-21 15:42:30,110 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_probe_init [2022-07-21 15:42:30,110 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-21 15:42:30,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-21 15:42:30,111 INFO L130 BoogieDeclarations]: Found specification of procedure ERR_PTR [2022-07-21 15:42:30,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ERR_PTR [2022-07-21 15:42:30,111 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_remove [2022-07-21 15:42:30,111 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_remove [2022-07-21 15:42:30,111 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-21 15:42:30,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-21 15:42:30,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 15:42:30,112 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-07-21 15:42:30,112 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-07-21 15:42:30,112 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-21 15:42:30,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-21 15:42:30,112 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_fifo_status [2022-07-21 15:42:30,112 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_fifo_status [2022-07-21 15:42:30,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 15:42:30,113 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_request_irq_130 [2022-07-21 15:42:30,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_request_irq_130 [2022-07-21 15:42:30,113 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_isoc [2022-07-21 15:42:30,113 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_isoc [2022-07-21 15:42:30,113 INFO L130 BoogieDeclarations]: Found specification of procedure buf_state_string [2022-07-21 15:42:30,113 INFO L138 BoogieDeclarations]: Found implementation of procedure buf_state_string [2022-07-21 15:42:30,113 INFO L130 BoogieDeclarations]: Found specification of procedure clear_halt [2022-07-21 15:42:30,114 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_halt [2022-07-21 15:42:30,114 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2022-07-21 15:42:30,114 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2022-07-21 15:42:30,114 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_stop [2022-07-21 15:42:30,114 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_stop [2022-07-21 15:42:30,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 15:42:30,114 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-07-21 15:42:30,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-07-21 15:42:30,115 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_pre_probe [2022-07-21 15:42:30,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_pre_probe [2022-07-21 15:42:30,115 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_reg_addr [2022-07-21 15:42:30,115 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_reg_addr [2022-07-21 15:42:30,115 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_net2272 [2022-07-21 15:42:30,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_net2272 [2022-07-21 15:42:30,116 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-21 15:42:30,116 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-21 15:42:30,116 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_plat_probe [2022-07-21 15:42:30,116 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_plat_probe [2022-07-21 15:42:30,116 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-21 15:42:30,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-21 15:42:30,117 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_request_irq [2022-07-21 15:42:30,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_request_irq [2022-07-21 15:42:30,117 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dispatch_irq_register_11_2 [2022-07-21 15:42:30,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dispatch_irq_register_11_2 [2022-07-21 15:42:30,117 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-21 15:42:30,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-21 15:42:30,117 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_write [2022-07-21 15:42:30,118 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_write [2022-07-21 15:42:30,118 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_irq [2022-07-21 15:42:30,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_irq [2022-07-21 15:42:30,118 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-21 15:42:30,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-21 15:42:30,118 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_plat_remove [2022-07-21 15:42:30,118 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_plat_remove [2022-07-21 15:42:30,119 INFO L130 BoogieDeclarations]: Found specification of procedure list_empty [2022-07-21 15:42:30,119 INFO L138 BoogieDeclarations]: Found implementation of procedure list_empty [2022-07-21 15:42:30,119 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_ep0_start [2022-07-21 15:42:30,119 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_ep0_start [2022-07-21 15:42:30,119 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-21 15:42:30,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-21 15:42:30,120 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-21 15:42:30,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-21 15:42:30,120 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-21 15:42:30,120 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-21 15:42:30,120 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_pci_remove [2022-07-21 15:42:30,120 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_pci_remove [2022-07-21 15:42:30,120 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_disable [2022-07-21 15:42:30,120 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_disable [2022-07-21 15:42:30,121 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-21 15:42:30,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-21 15:42:30,121 INFO L130 BoogieDeclarations]: Found specification of procedure __release_region [2022-07-21 15:42:30,121 INFO L138 BoogieDeclarations]: Found implementation of procedure __release_region [2022-07-21 15:42:30,121 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-21 15:42:30,121 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-21 15:42:30,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 15:42:30,122 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_handle_stat0_irqs [2022-07-21 15:42:30,122 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_handle_stat0_irqs [2022-07-21 15:42:30,122 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-21 15:42:30,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-21 15:42:30,122 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-21 15:42:30,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-21 15:42:30,122 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_get_frame [2022-07-21 15:42:30,123 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_get_frame [2022-07-21 15:42:30,123 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-21 15:42:30,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-21 15:42:30,123 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_102 [2022-07-21 15:42:30,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_102 [2022-07-21 15:42:30,123 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_get_ep_by_addr [2022-07-21 15:42:30,123 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_get_ep_by_addr [2022-07-21 15:42:30,123 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2022-07-21 15:42:30,124 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2022-07-21 15:42:30,124 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-21 15:42:30,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-21 15:42:30,124 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-21 15:42:30,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-21 15:42:30,124 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_interrupt_instance_handler_0_5 [2022-07-21 15:42:30,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_interrupt_instance_handler_0_5 [2022-07-21 15:42:30,125 INFO L130 BoogieDeclarations]: Found specification of procedure readw [2022-07-21 15:42:30,125 INFO L138 BoogieDeclarations]: Found implementation of procedure readw [2022-07-21 15:42:30,125 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_kick_dma [2022-07-21 15:42:30,125 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_kick_dma [2022-07-21 15:42:30,125 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_dequeue [2022-07-21 15:42:30,125 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_dequeue [2022-07-21 15:42:30,125 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-21 15:42:30,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-21 15:42:30,126 INFO L130 BoogieDeclarations]: Found specification of procedure readl [2022-07-21 15:42:30,126 INFO L138 BoogieDeclarations]: Found implementation of procedure readl [2022-07-21 15:42:30,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 15:42:30,126 INFO L130 BoogieDeclarations]: Found specification of procedure __request_region [2022-07-21 15:42:30,126 INFO L138 BoogieDeclarations]: Found implementation of procedure __request_region [2022-07-21 15:42:30,126 INFO L130 BoogieDeclarations]: Found specification of procedure resource_size [2022-07-21 15:42:30,126 INFO L138 BoogieDeclarations]: Found implementation of procedure resource_size [2022-07-21 15:42:30,127 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2022-07-21 15:42:30,127 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2022-07-21 15:42:30,127 INFO L130 BoogieDeclarations]: Found specification of procedure readb [2022-07-21 15:42:30,127 INFO L138 BoogieDeclarations]: Found implementation of procedure readb [2022-07-21 15:42:30,919 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 15:42:30,922 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 15:42:31,264 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-21 15:42:31,528 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-21 15:42:31,640 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-21 15:42:31,641 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-21 15:42:31,641 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-21 15:42:31,641 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-21 15:42:31,641 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L4824: goto; [2022-07-21 15:42:31,641 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-21 15:42:31,642 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##47: assume !(0 != assert_out_naking_~tmp___0~4#1); [2022-07-21 15:42:31,642 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-21 15:42:31,642 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-21 15:42:35,149 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 15:42:35,175 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 15:42:35,175 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 15:42:35,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:42:35 BoogieIcfgContainer [2022-07-21 15:42:35,180 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 15:42:35,182 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 15:42:35,182 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 15:42:35,185 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 15:42:35,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 03:42:23" (1/3) ... [2022-07-21 15:42:35,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bb75632 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 03:42:35, skipping insertion in model container [2022-07-21 15:42:35,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:42:28" (2/3) ... [2022-07-21 15:42:35,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bb75632 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 03:42:35, skipping insertion in model container [2022-07-21 15:42:35,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:42:35" (3/3) ... [2022-07-21 15:42:35,188 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i [2022-07-21 15:42:35,202 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 15:42:35,203 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-07-21 15:42:35,308 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 15:42:35,320 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@1bbb9b99, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4b5ac18b [2022-07-21 15:42:35,321 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2022-07-21 15:42:35,334 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-21 15:42:35,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-21 15:42:35,349 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:42:35,350 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-21 15:42:35,351 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-21 15:42:35,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:42:35,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1907190920, now seen corresponding path program 1 times [2022-07-21 15:42:35,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:42:35,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671149848] [2022-07-21 15:42:35,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:42:35,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:42:35,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:35,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:42:36,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:36,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:42:36,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:36,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:42:36,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:36,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 15:42:36,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:36,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 15:42:36,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:36,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:42:36,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:36,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:42:36,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:36,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 15:42:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:36,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 15:42:36,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:36,124 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:42:36,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:42:36,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671149848] [2022-07-21 15:42:36,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671149848] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:42:36,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:42:36,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:42:36,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670357612] [2022-07-21 15:42:36,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:42:36,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:42:36,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:42:36,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:42:36,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:42:36,163 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-21 15:42:48,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:42:48,686 INFO L93 Difference]: Finished difference Result 7591 states and 11348 transitions. [2022-07-21 15:42:48,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 15:42:48,689 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-21 15:42:48,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:42:48,733 INFO L225 Difference]: With dead ends: 7591 [2022-07-21 15:42:48,734 INFO L226 Difference]: Without dead ends: 5012 [2022-07-21 15:42:48,758 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-21 15:42:48,765 INFO L413 NwaCegarLoop]: 3512 mSDtfsCounter, 8537 mSDsluCounter, 2967 mSDsCounter, 0 mSdLazyCounter, 8327 mSolverCounterSat, 5582 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s 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, 11.7s IncrementalHoareTripleChecker+Time [2022-07-21 15:42:48,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8731 Valid, 6479 Invalid, 13909 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5582 Valid, 8327 Invalid, 0 Unknown, 0 Unchecked, 11.7s Time] [2022-07-21 15:42:48,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5012 states. [2022-07-21 15:42:49,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5012 to 4815. [2022-07-21 15:42:49,122 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-21 15:42:49,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4815 states to 4815 states and 6885 transitions. [2022-07-21 15:42:49,176 INFO L78 Accepts]: Start accepts. Automaton has 4815 states and 6885 transitions. Word has length 66 [2022-07-21 15:42:49,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:42:49,178 INFO L495 AbstractCegarLoop]: Abstraction has 4815 states and 6885 transitions. [2022-07-21 15:42:49,178 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-21 15:42:49,178 INFO L276 IsEmpty]: Start isEmpty. Operand 4815 states and 6885 transitions. [2022-07-21 15:42:49,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-21 15:42:49,188 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:42:49,188 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-21 15:42:49,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 15:42:49,189 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-21 15:42:49,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:42:49,190 INFO L85 PathProgramCache]: Analyzing trace with hash 259434772, now seen corresponding path program 1 times [2022-07-21 15:42:49,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:42:49,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401609751] [2022-07-21 15:42:49,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:42:49,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:42:49,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:49,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:42:49,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:49,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:42:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:49,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:42:49,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:49,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 15:42:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:49,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 15:42:49,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:49,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:42:49,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:49,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:42:49,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:49,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 15:42:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:49,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 15:42:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:49,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 15:42:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:49,581 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:42:49,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:42:49,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401609751] [2022-07-21 15:42:49,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401609751] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:42:49,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:42:49,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:42:49,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640930405] [2022-07-21 15:42:49,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:42:49,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:42:49,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:42:49,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:42:49,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:42:49,586 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-21 15:42:56,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:42:56,049 INFO L93 Difference]: Finished difference Result 4815 states and 6885 transitions. [2022-07-21 15:42:56,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:42:56,050 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-21 15:42:56,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:42:56,079 INFO L225 Difference]: With dead ends: 4815 [2022-07-21 15:42:56,080 INFO L226 Difference]: Without dead ends: 4813 [2022-07-21 15:42:56,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:42:56,084 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-21 15:42:56,084 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-21 15:42:56,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4813 states. [2022-07-21 15:42:56,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4813 to 4813. [2022-07-21 15:42:56,278 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-21 15:42:56,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4813 states to 4813 states and 6883 transitions. [2022-07-21 15:42:56,306 INFO L78 Accepts]: Start accepts. Automaton has 4813 states and 6883 transitions. Word has length 72 [2022-07-21 15:42:56,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:42:56,309 INFO L495 AbstractCegarLoop]: Abstraction has 4813 states and 6883 transitions. [2022-07-21 15:42:56,309 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-21 15:42:56,309 INFO L276 IsEmpty]: Start isEmpty. Operand 4813 states and 6883 transitions. [2022-07-21 15:42:56,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-21 15:42:56,312 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:42:56,312 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-21 15:42:56,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 15:42:56,313 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-21 15:42:56,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:42:56,314 INFO L85 PathProgramCache]: Analyzing trace with hash -458841926, now seen corresponding path program 1 times [2022-07-21 15:42:56,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:42:56,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410510553] [2022-07-21 15:42:56,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:42:56,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:42:56,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:56,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:42:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:56,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:42:56,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:56,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:42:56,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:56,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 15:42:56,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:56,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 15:42:56,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:56,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:42:56,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:56,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:42:56,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:56,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 15:42:56,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:56,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 15:42:56,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:56,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 15:42:56,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:56,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 15:42:56,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:56,634 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:42:56,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:42:56,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410510553] [2022-07-21 15:42:56,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410510553] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:42:56,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:42:56,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:42:56,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003005981] [2022-07-21 15:42:56,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:42:56,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:42:56,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:42:56,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:42:56,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:42:56,637 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-21 15:43:01,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:43:01,990 INFO L93 Difference]: Finished difference Result 4813 states and 6883 transitions. [2022-07-21 15:43:01,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:43:01,991 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-21 15:43:01,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:43:02,015 INFO L225 Difference]: With dead ends: 4813 [2022-07-21 15:43:02,016 INFO L226 Difference]: Without dead ends: 4811 [2022-07-21 15:43:02,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:43:02,019 INFO L413 NwaCegarLoop]: 3100 mSDtfsCounter, 5574 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3712 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5795 SdHoareTripleChecker+Valid, 5056 SdHoareTripleChecker+Invalid, 6994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3282 IncrementalHoareTripleChecker+Valid, 3712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-07-21 15:43:02,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5795 Valid, 5056 Invalid, 6994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3282 Valid, 3712 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-07-21 15:43:02,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4811 states. [2022-07-21 15:43:02,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4811 to 4811. [2022-07-21 15:43:02,206 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-21 15:43:02,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4811 states to 4811 states and 6881 transitions. [2022-07-21 15:43:02,231 INFO L78 Accepts]: Start accepts. Automaton has 4811 states and 6881 transitions. Word has length 78 [2022-07-21 15:43:02,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:43:02,231 INFO L495 AbstractCegarLoop]: Abstraction has 4811 states and 6881 transitions. [2022-07-21 15:43:02,232 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-21 15:43:02,232 INFO L276 IsEmpty]: Start isEmpty. Operand 4811 states and 6881 transitions. [2022-07-21 15:43:02,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-21 15:43:02,235 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:43:02,235 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-21 15:43:02,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 15:43:02,235 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-21 15:43:02,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:43:02,236 INFO L85 PathProgramCache]: Analyzing trace with hash 134960499, now seen corresponding path program 1 times [2022-07-21 15:43:02,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:43:02,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106192631] [2022-07-21 15:43:02,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:43:02,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:43:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:02,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:43:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:02,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:43:02,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:02,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:43:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:02,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 15:43:02,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:02,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 15:43:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:02,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:43:02,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:02,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:02,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:02,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 15:43:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:02,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 15:43:02,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:02,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 15:43:02,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:02,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 15:43:02,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:02,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:43:02,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:02,514 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:43:02,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:43:02,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106192631] [2022-07-21 15:43:02,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106192631] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:43:02,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:43:02,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:43:02,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035299963] [2022-07-21 15:43:02,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:43:02,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:43:02,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:43:02,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:43:02,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:43:02,517 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-21 15:43:07,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:43:07,622 INFO L93 Difference]: Finished difference Result 4811 states and 6881 transitions. [2022-07-21 15:43:07,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:43:07,623 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-21 15:43:07,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:43:07,651 INFO L225 Difference]: With dead ends: 4811 [2022-07-21 15:43:07,651 INFO L226 Difference]: Without dead ends: 4809 [2022-07-21 15:43:07,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:43:07,654 INFO L413 NwaCegarLoop]: 3098 mSDtfsCounter, 5568 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3710 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5788 SdHoareTripleChecker+Valid, 5054 SdHoareTripleChecker+Invalid, 6992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3282 IncrementalHoareTripleChecker+Valid, 3710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-07-21 15:43:07,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5788 Valid, 5054 Invalid, 6992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3282 Valid, 3710 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-07-21 15:43:07,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4809 states. [2022-07-21 15:43:07,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4809 to 4809. [2022-07-21 15:43:07,834 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-21 15:43:07,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4809 states to 4809 states and 6879 transitions. [2022-07-21 15:43:07,858 INFO L78 Accepts]: Start accepts. Automaton has 4809 states and 6879 transitions. Word has length 84 [2022-07-21 15:43:07,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:43:07,859 INFO L495 AbstractCegarLoop]: Abstraction has 4809 states and 6879 transitions. [2022-07-21 15:43:07,859 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-21 15:43:07,859 INFO L276 IsEmpty]: Start isEmpty. Operand 4809 states and 6879 transitions. [2022-07-21 15:43:07,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-21 15:43:07,861 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:43:07,861 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-21 15:43:07,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 15:43:07,862 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-21 15:43:07,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:43:07,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1947085320, now seen corresponding path program 1 times [2022-07-21 15:43:07,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:43:07,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684283201] [2022-07-21 15:43:07,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:43:07,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:43:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:08,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:43:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:08,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:43:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:08,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:43:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:08,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 15:43:08,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:08,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 15:43:08,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:08,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:43:08,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:08,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:08,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:08,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 15:43:08,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:08,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 15:43:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:08,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 15:43:08,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:08,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 15:43:08,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:08,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:43:08,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:08,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 15:43:08,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:08,145 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:43:08,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:43:08,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684283201] [2022-07-21 15:43:08,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684283201] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:43:08,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:43:08,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:43:08,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276383704] [2022-07-21 15:43:08,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:43:08,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:43:08,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:43:08,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:43:08,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:43:08,148 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-21 15:43:13,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:43:13,328 INFO L93 Difference]: Finished difference Result 4809 states and 6879 transitions. [2022-07-21 15:43:13,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:43:13,329 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-21 15:43:13,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:43:13,355 INFO L225 Difference]: With dead ends: 4809 [2022-07-21 15:43:13,355 INFO L226 Difference]: Without dead ends: 4807 [2022-07-21 15:43:13,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:43:13,359 INFO L413 NwaCegarLoop]: 3096 mSDtfsCounter, 5562 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3708 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5781 SdHoareTripleChecker+Valid, 5052 SdHoareTripleChecker+Invalid, 6990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3282 IncrementalHoareTripleChecker+Valid, 3708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-07-21 15:43:13,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5781 Valid, 5052 Invalid, 6990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3282 Valid, 3708 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-07-21 15:43:13,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4807 states. [2022-07-21 15:43:13,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4807 to 4807. [2022-07-21 15:43:13,574 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-21 15:43:13,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4807 states to 4807 states and 6877 transitions. [2022-07-21 15:43:13,597 INFO L78 Accepts]: Start accepts. Automaton has 4807 states and 6877 transitions. Word has length 90 [2022-07-21 15:43:13,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:43:13,599 INFO L495 AbstractCegarLoop]: Abstraction has 4807 states and 6877 transitions. [2022-07-21 15:43:13,599 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-21 15:43:13,599 INFO L276 IsEmpty]: Start isEmpty. Operand 4807 states and 6877 transitions. [2022-07-21 15:43:13,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-21 15:43:13,606 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:43:13,606 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-21 15:43:13,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 15:43:13,607 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-21 15:43:13,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:43:13,607 INFO L85 PathProgramCache]: Analyzing trace with hash 674168724, now seen corresponding path program 1 times [2022-07-21 15:43:13,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:43:13,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043947369] [2022-07-21 15:43:13,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:43:13,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:43:13,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:13,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:43:13,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:13,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:43:13,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:13,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:43:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:13,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 15:43:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:13,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:13,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:13,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:43:13,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:13,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:43:13,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:13,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:43:13,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:13,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:13,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:43:13,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:13,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:43:13,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:13,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 15:43:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:13,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:13,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:13,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:43:13,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:13,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:43:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:13,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 15:43:13,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:13,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:43:13,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:13,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:43:13,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:13,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-21 15:43:13,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:13,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 15:43:13,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:13,963 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-21 15:43:13,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:43:13,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043947369] [2022-07-21 15:43:13,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043947369] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:43:13,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:43:13,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 15:43:13,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173877208] [2022-07-21 15:43:13,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:43:13,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 15:43:13,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:43:13,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 15:43:13,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-21 15:43:13,966 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-21 15:43:27,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:43:27,887 INFO L93 Difference]: Finished difference Result 12257 states and 17686 transitions. [2022-07-21 15:43:27,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 15:43:27,887 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-21 15:43:27,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:43:27,931 INFO L225 Difference]: With dead ends: 12257 [2022-07-21 15:43:27,931 INFO L226 Difference]: Without dead ends: 7471 [2022-07-21 15:43:27,963 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-21 15:43:27,964 INFO L413 NwaCegarLoop]: 3216 mSDtfsCounter, 8990 mSDsluCounter, 3899 mSDsCounter, 0 mSdLazyCounter, 14910 mSolverCounterSat, 6118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9188 SdHoareTripleChecker+Valid, 7115 SdHoareTripleChecker+Invalid, 21028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6118 IncrementalHoareTripleChecker+Valid, 14910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.3s IncrementalHoareTripleChecker+Time [2022-07-21 15:43:27,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9188 Valid, 7115 Invalid, 21028 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6118 Valid, 14910 Invalid, 0 Unknown, 0 Unchecked, 13.3s Time] [2022-07-21 15:43:27,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7471 states. [2022-07-21 15:43:28,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7471 to 7257. [2022-07-21 15:43:28,372 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-21 15:43:28,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7257 states to 7257 states and 10327 transitions. [2022-07-21 15:43:28,411 INFO L78 Accepts]: Start accepts. Automaton has 7257 states and 10327 transitions. Word has length 120 [2022-07-21 15:43:28,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:43:28,411 INFO L495 AbstractCegarLoop]: Abstraction has 7257 states and 10327 transitions. [2022-07-21 15:43:28,412 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-21 15:43:28,412 INFO L276 IsEmpty]: Start isEmpty. Operand 7257 states and 10327 transitions. [2022-07-21 15:43:28,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-21 15:43:28,414 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:43:28,414 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-21 15:43:28,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 15:43:28,414 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-21 15:43:28,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:43:28,415 INFO L85 PathProgramCache]: Analyzing trace with hash 674228306, now seen corresponding path program 1 times [2022-07-21 15:43:28,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:43:28,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139385023] [2022-07-21 15:43:28,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:43:28,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:43:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:28,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:43:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:28,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:43:28,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:28,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:43:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:28,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 15:43:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:28,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:28,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:28,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:43:28,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:28,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:43:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:28,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:43:28,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:28,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:28,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:43:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:28,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:43:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:28,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 15:43:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:28,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:28,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:43:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:28,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:43:28,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:28,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 15:43:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:28,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:43:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:28,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:43:28,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:28,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-21 15:43:28,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:28,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 15:43:28,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:28,739 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-21 15:43:28,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:43:28,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139385023] [2022-07-21 15:43:28,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139385023] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:43:28,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:43:28,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 15:43:28,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353842609] [2022-07-21 15:43:28,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:43:28,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 15:43:28,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:43:28,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 15:43:28,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 15:43:28,742 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-21 15:43:36,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:43:36,637 INFO L93 Difference]: Finished difference Result 7487 states and 10683 transitions. [2022-07-21 15:43:36,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 15:43:36,638 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-21 15:43:36,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:43:36,667 INFO L225 Difference]: With dead ends: 7487 [2022-07-21 15:43:36,667 INFO L226 Difference]: Without dead ends: 7485 [2022-07-21 15:43:36,671 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-21 15:43:36,672 INFO L413 NwaCegarLoop]: 3112 mSDtfsCounter, 4433 mSDsluCounter, 3325 mSDsCounter, 0 mSdLazyCounter, 7943 mSolverCounterSat, 3515 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s 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.4s IncrementalHoareTripleChecker+Time [2022-07-21 15:43:36,672 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.4s Time] [2022-07-21 15:43:36,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7485 states. [2022-07-21 15:43:36,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7485 to 7261. [2022-07-21 15:43:36,967 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-21 15:43:37,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7261 states to 7261 states and 10329 transitions. [2022-07-21 15:43:37,004 INFO L78 Accepts]: Start accepts. Automaton has 7261 states and 10329 transitions. Word has length 120 [2022-07-21 15:43:37,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:43:37,005 INFO L495 AbstractCegarLoop]: Abstraction has 7261 states and 10329 transitions. [2022-07-21 15:43:37,005 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-21 15:43:37,005 INFO L276 IsEmpty]: Start isEmpty. Operand 7261 states and 10329 transitions. [2022-07-21 15:43:37,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-21 15:43:37,007 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:43:37,007 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-21 15:43:37,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 15:43:37,009 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-21 15:43:37,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:43:37,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1135512486, now seen corresponding path program 1 times [2022-07-21 15:43:37,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:43:37,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615623395] [2022-07-21 15:43:37,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:43:37,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:43:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:37,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:43:37,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:37,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:43:37,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:37,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:43:37,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:37,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 15:43:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:37,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 15:43:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:37,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:43:37,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:37,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:37,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:37,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 15:43:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:37,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 15:43:37,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:37,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 15:43:37,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:37,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 15:43:37,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:37,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:43:37,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:37,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 15:43:37,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:37,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 15:43:37,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:37,300 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:43:37,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:43:37,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615623395] [2022-07-21 15:43:37,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615623395] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:43:37,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:43:37,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:43:37,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426959752] [2022-07-21 15:43:37,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:43:37,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:43:37,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:43:37,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:43:37,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:43:37,303 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-21 15:43:42,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:43:42,643 INFO L93 Difference]: Finished difference Result 7261 states and 10329 transitions. [2022-07-21 15:43:42,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:43:42,643 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-21 15:43:42,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:43:42,674 INFO L225 Difference]: With dead ends: 7261 [2022-07-21 15:43:42,674 INFO L226 Difference]: Without dead ends: 7259 [2022-07-21 15:43:42,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:43:42,681 INFO L413 NwaCegarLoop]: 3094 mSDtfsCounter, 5556 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3706 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s 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.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:43:42,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5774 Valid, 5050 Invalid, 6988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3282 Valid, 3706 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-07-21 15:43:42,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7259 states. [2022-07-21 15:43:42,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7259 to 7259. [2022-07-21 15:43:42,976 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-21 15:43:43,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7259 states to 7259 states and 10327 transitions. [2022-07-21 15:43:43,013 INFO L78 Accepts]: Start accepts. Automaton has 7259 states and 10327 transitions. Word has length 96 [2022-07-21 15:43:43,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:43:43,013 INFO L495 AbstractCegarLoop]: Abstraction has 7259 states and 10327 transitions. [2022-07-21 15:43:43,013 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-21 15:43:43,014 INFO L276 IsEmpty]: Start isEmpty. Operand 7259 states and 10327 transitions. [2022-07-21 15:43:43,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-21 15:43:43,016 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:43:43,017 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-21 15:43:43,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 15:43:43,017 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-21 15:43:43,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:43:43,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1329569048, now seen corresponding path program 1 times [2022-07-21 15:43:43,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:43:43,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598063603] [2022-07-21 15:43:43,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:43:43,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:43:43,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:43:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:43:43,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:43:43,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 15:43:43,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:43,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:43:43,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:43:43,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:43:43,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:43:43,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:43:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 15:43:43,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:43:43,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:43:43,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 15:43:43,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:43:43,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:43:43,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-21 15:43:43,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 15:43:43,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,310 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-21 15:43:43,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:43:43,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598063603] [2022-07-21 15:43:43,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598063603] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:43:43,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:43:43,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:43:43,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932101710] [2022-07-21 15:43:43,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:43:43,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:43:43,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:43:43,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:43:43,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:43:43,313 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-21 15:43:48,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:43:48,363 INFO L93 Difference]: Finished difference Result 14673 states and 21127 transitions. [2022-07-21 15:43:48,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:43:48,364 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-21 15:43:48,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:43:48,399 INFO L225 Difference]: With dead ends: 14673 [2022-07-21 15:43:48,400 INFO L226 Difference]: Without dead ends: 7435 [2022-07-21 15:43:48,436 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-21 15:43:48,439 INFO L413 NwaCegarLoop]: 3106 mSDtfsCounter, 6756 mSDsluCounter, 1709 mSDsCounter, 0 mSdLazyCounter, 2311 mSolverCounterSat, 4521 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6983 SdHoareTripleChecker+Valid, 4815 SdHoareTripleChecker+Invalid, 6832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4521 IncrementalHoareTripleChecker+Valid, 2311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-07-21 15:43:48,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6983 Valid, 4815 Invalid, 6832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4521 Valid, 2311 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-07-21 15:43:48,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7435 states. [2022-07-21 15:43:48,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7435 to 7249. [2022-07-21 15:43:48,762 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-21 15:43:48,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7249 states to 7249 states and 10310 transitions. [2022-07-21 15:43:48,799 INFO L78 Accepts]: Start accepts. Automaton has 7249 states and 10310 transitions. Word has length 124 [2022-07-21 15:43:48,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:43:48,800 INFO L495 AbstractCegarLoop]: Abstraction has 7249 states and 10310 transitions. [2022-07-21 15:43:48,801 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-21 15:43:48,801 INFO L276 IsEmpty]: Start isEmpty. Operand 7249 states and 10310 transitions. [2022-07-21 15:43:48,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-21 15:43:48,802 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:43:48,803 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-21 15:43:48,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 15:43:48,803 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-21 15:43:48,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:43:48,804 INFO L85 PathProgramCache]: Analyzing trace with hash -336041078, now seen corresponding path program 1 times [2022-07-21 15:43:48,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:43:48,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868566706] [2022-07-21 15:43:48,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:43:48,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:43:48,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:48,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:43:48,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:48,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:43:48,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:48,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:43:48,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:48,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 15:43:48,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:48,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 15:43:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:48,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:43:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:48,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:48,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 15:43:48,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:48,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 15:43:48,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:48,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:43:48,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:48,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:43:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:49,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:49,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:43:49,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:49,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:43:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:49,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 15:43:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:49,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-21 15:43:49,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:49,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-21 15:43:49,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:49,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:43:49,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:49,041 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-21 15:43:49,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:43:49,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868566706] [2022-07-21 15:43:49,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868566706] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:43:49,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:43:49,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:43:49,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696357018] [2022-07-21 15:43:49,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:43:49,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:43:49,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:43:49,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:43:49,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:43:49,044 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-21 15:43:54,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:43:54,272 INFO L93 Difference]: Finished difference Result 14657 states and 20892 transitions. [2022-07-21 15:43:54,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 15:43:54,273 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-21 15:43:54,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:43:54,307 INFO L225 Difference]: With dead ends: 14657 [2022-07-21 15:43:54,307 INFO L226 Difference]: Without dead ends: 7429 [2022-07-21 15:43:54,337 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-21 15:43:54,338 INFO L413 NwaCegarLoop]: 2848 mSDtfsCounter, 6755 mSDsluCounter, 1709 mSDsCounter, 0 mSdLazyCounter, 2564 mSolverCounterSat, 4534 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s 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-21 15:43:54,339 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-21 15:43:54,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7429 states. [2022-07-21 15:43:54,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7429 to 7243. [2022-07-21 15:43:54,662 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-21 15:43:54,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7243 states to 7243 states and 10301 transitions. [2022-07-21 15:43:54,701 INFO L78 Accepts]: Start accepts. Automaton has 7243 states and 10301 transitions. Word has length 113 [2022-07-21 15:43:54,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:43:54,702 INFO L495 AbstractCegarLoop]: Abstraction has 7243 states and 10301 transitions. [2022-07-21 15:43:54,702 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-21 15:43:54,702 INFO L276 IsEmpty]: Start isEmpty. Operand 7243 states and 10301 transitions. [2022-07-21 15:43:54,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-21 15:43:54,704 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:43:54,704 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-21 15:43:54,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 15:43:54,705 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-21 15:43:54,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:43:54,705 INFO L85 PathProgramCache]: Analyzing trace with hash 5687637, now seen corresponding path program 1 times [2022-07-21 15:43:54,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:43:54,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956340215] [2022-07-21 15:43:54,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:43:54,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:43:54,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:54,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:43:54,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:54,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:43:54,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:54,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:43:54,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:54,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 15:43:54,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:54,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 15:43:54,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:54,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:43:54,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:54,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:54,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:54,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 15:43:54,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:54,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 15:43:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:54,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 15:43:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:54,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 15:43:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:54,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:43:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:54,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 15:43:54,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:54,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 15:43:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:54,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:43:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:54,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-21 15:43:54,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:43:54,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956340215] [2022-07-21 15:43:54,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956340215] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:43:54,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:43:54,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:43:54,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762259205] [2022-07-21 15:43:54,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:43:54,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:43:54,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:43:54,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:43:54,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:43:54,952 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-21 15:44:00,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:00,452 INFO L93 Difference]: Finished difference Result 7243 states and 10301 transitions. [2022-07-21 15:44:00,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:44:00,453 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-21 15:44:00,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:00,480 INFO L225 Difference]: With dead ends: 7243 [2022-07-21 15:44:00,480 INFO L226 Difference]: Without dead ends: 7241 [2022-07-21 15:44:00,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:44:00,487 INFO L413 NwaCegarLoop]: 3083 mSDtfsCounter, 5520 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3693 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5737 SdHoareTripleChecker+Valid, 5039 SdHoareTripleChecker+Invalid, 6975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3282 IncrementalHoareTripleChecker+Valid, 3693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:00,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5737 Valid, 5039 Invalid, 6975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3282 Valid, 3693 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-07-21 15:44:00,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7241 states. [2022-07-21 15:44:00,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7241 to 7241. [2022-07-21 15:44:00,794 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-21 15:44:00,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7241 states to 7241 states and 10299 transitions. [2022-07-21 15:44:00,832 INFO L78 Accepts]: Start accepts. Automaton has 7241 states and 10299 transitions. Word has length 102 [2022-07-21 15:44:00,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:00,833 INFO L495 AbstractCegarLoop]: Abstraction has 7241 states and 10299 transitions. [2022-07-21 15:44:00,833 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-21 15:44:00,833 INFO L276 IsEmpty]: Start isEmpty. Operand 7241 states and 10299 transitions. [2022-07-21 15:44:00,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-21 15:44:00,835 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:00,835 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-21 15:44:00,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 15:44:00,836 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-21 15:44:00,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:00,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1765061470, now seen corresponding path program 1 times [2022-07-21 15:44:00,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:00,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904280888] [2022-07-21 15:44:00,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:00,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:00,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:00,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:00,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:00,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:01,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:44:01,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:01,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 15:44:01,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:01,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 15:44:01,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:01,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:44:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:01,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:01,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:01,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 15:44:01,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:01,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 15:44:01,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:01,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:44:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:01,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:44:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:01,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:01,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:01,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:01,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:01,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:01,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 15:44:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:01,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-21 15:44:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:01,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-21 15:44:01,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:01,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:44:01,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:01,208 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-21 15:44:01,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:01,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904280888] [2022-07-21 15:44:01,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904280888] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:01,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:01,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 15:44:01,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756907490] [2022-07-21 15:44:01,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:01,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 15:44:01,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:01,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 15:44:01,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 15:44:01,210 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-21 15:44:13,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:13,549 INFO L93 Difference]: Finished difference Result 10926 states and 15450 transitions. [2022-07-21 15:44:13,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 15:44:13,550 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-21 15:44:13,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:13,592 INFO L225 Difference]: With dead ends: 10926 [2022-07-21 15:44:13,592 INFO L226 Difference]: Without dead ends: 10924 [2022-07-21 15:44:13,601 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-21 15:44:13,602 INFO L413 NwaCegarLoop]: 3485 mSDtfsCounter, 7242 mSDsluCounter, 3511 mSDsCounter, 0 mSdLazyCounter, 11772 mSolverCounterSat, 5287 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s 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.6s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:13,602 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.6s Time] [2022-07-21 15:44:13,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10924 states. [2022-07-21 15:44:14,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10924 to 10550. [2022-07-21 15:44:14,073 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-21 15:44:14,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10550 states to 10550 states and 14874 transitions. [2022-07-21 15:44:14,127 INFO L78 Accepts]: Start accepts. Automaton has 10550 states and 14874 transitions. Word has length 119 [2022-07-21 15:44:14,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:14,128 INFO L495 AbstractCegarLoop]: Abstraction has 10550 states and 14874 transitions. [2022-07-21 15:44:14,128 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-21 15:44:14,128 INFO L276 IsEmpty]: Start isEmpty. Operand 10550 states and 14874 transitions. [2022-07-21 15:44:14,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-21 15:44:14,130 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:14,130 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:44:14,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 15:44:14,130 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-21 15:44:14,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:14,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1282682864, now seen corresponding path program 1 times [2022-07-21 15:44:14,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:14,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318623298] [2022-07-21 15:44:14,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:14,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:14,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:14,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:14,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:14,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:14,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:44:14,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:14,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 15:44:14,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:14,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 15:44:14,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:14,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:44:14,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:14,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:14,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:14,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 15:44:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:14,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 15:44:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:14,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 15:44:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:14,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 15:44:14,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:14,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:44:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:14,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 15:44:14,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:14,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 15:44:14,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:14,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:44:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:14,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-21 15:44:14,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:14,350 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:44:14,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:14,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318623298] [2022-07-21 15:44:14,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318623298] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:14,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:14,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:44:14,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956187992] [2022-07-21 15:44:14,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:14,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:44:14,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:14,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:44:14,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:44:14,353 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-21 15:44:20,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:20,057 INFO L93 Difference]: Finished difference Result 10550 states and 14874 transitions. [2022-07-21 15:44:20,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:44:20,060 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 108 [2022-07-21 15:44:20,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:20,102 INFO L225 Difference]: With dead ends: 10550 [2022-07-21 15:44:20,102 INFO L226 Difference]: Without dead ends: 10548 [2022-07-21 15:44:20,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:44:20,112 INFO L413 NwaCegarLoop]: 3081 mSDtfsCounter, 5518 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3687 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s 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.3s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:20,113 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.3s Time] [2022-07-21 15:44:20,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10548 states. [2022-07-21 15:44:20,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10548 to 10548. [2022-07-21 15:44:20,702 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-21 15:44:20,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10548 states to 10548 states and 14872 transitions. [2022-07-21 15:44:20,752 INFO L78 Accepts]: Start accepts. Automaton has 10548 states and 14872 transitions. Word has length 108 [2022-07-21 15:44:20,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:20,753 INFO L495 AbstractCegarLoop]: Abstraction has 10548 states and 14872 transitions. [2022-07-21 15:44:20,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-21 15:44:20,753 INFO L276 IsEmpty]: Start isEmpty. Operand 10548 states and 14872 transitions. [2022-07-21 15:44:20,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-21 15:44:20,755 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:20,756 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-21 15:44:20,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 15:44:20,756 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-21 15:44:20,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:20,756 INFO L85 PathProgramCache]: Analyzing trace with hash -2105982114, now seen corresponding path program 1 times [2022-07-21 15:44:20,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:20,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467489246] [2022-07-21 15:44:20,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:20,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:20,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:20,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:20,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:20,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:20,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:44:20,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:20,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 15:44:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:20,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 15:44:20,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:20,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:44:20,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:20,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:20,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 15:44:20,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:20,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 15:44:20,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:20,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:44:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:20,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:44:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:20,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:20,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:20,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:20,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:20,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 15:44:20,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:20,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-21 15:44:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:20,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-21 15:44:20,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:20,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:44:21,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:21,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 15:44:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:21,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:21,032 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-21 15:44:21,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:21,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467489246] [2022-07-21 15:44:21,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467489246] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:44:21,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167485628] [2022-07-21 15:44:21,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:21,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:44:21,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:44:21,039 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 15:44:21,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 15:44:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:21,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 2520 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 15:44:21,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 15:44:22,009 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-21 15:44:22,009 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 15:44:22,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167485628] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:22,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 15:44:22,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-07-21 15:44:22,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733041800] [2022-07-21 15:44:22,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:22,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 15:44:22,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:22,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 15:44:22,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-21 15:44:22,012 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-21 15:44:22,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:22,529 INFO L93 Difference]: Finished difference Result 21069 states and 29712 transitions. [2022-07-21 15:44:22,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 15:44:22,530 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-21 15:44:22,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:22,566 INFO L225 Difference]: With dead ends: 21069 [2022-07-21 15:44:22,566 INFO L226 Difference]: Without dead ends: 10542 [2022-07-21 15:44:22,605 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-21 15:44:22,606 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-21 15:44:22,606 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-21 15:44:22,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10542 states. [2022-07-21 15:44:23,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10542 to 10542. [2022-07-21 15:44:23,208 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-21 15:44:23,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10542 states to 10542 states and 14863 transitions. [2022-07-21 15:44:23,249 INFO L78 Accepts]: Start accepts. Automaton has 10542 states and 14863 transitions. Word has length 122 [2022-07-21 15:44:23,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:23,250 INFO L495 AbstractCegarLoop]: Abstraction has 10542 states and 14863 transitions. [2022-07-21 15:44:23,250 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-21 15:44:23,250 INFO L276 IsEmpty]: Start isEmpty. Operand 10542 states and 14863 transitions. [2022-07-21 15:44:23,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-21 15:44:23,255 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:23,255 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-21 15:44:23,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-21 15:44:23,483 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-21 15:44:23,484 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-21 15:44:23,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:23,484 INFO L85 PathProgramCache]: Analyzing trace with hash -2455789, now seen corresponding path program 1 times [2022-07-21 15:44:23,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:23,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470907253] [2022-07-21 15:44:23,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:23,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:23,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:23,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:23,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:23,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:23,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:23,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:44:23,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:23,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 15:44:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:23,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 15:44:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:23,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:44:23,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:23,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:23,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:23,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 15:44:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:23,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 15:44:23,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:23,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 15:44:23,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:23,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 15:44:23,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:23,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:44:23,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:23,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 15:44:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:23,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 15:44:23,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:23,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:44:23,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:23,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-21 15:44:23,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:23,736 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:44:23,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:23,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470907253] [2022-07-21 15:44:23,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470907253] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:23,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:23,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:44:23,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606940519] [2022-07-21 15:44:23,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:23,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:44:23,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:23,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:44:23,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:44:23,738 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-21 15:44:29,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:29,493 INFO L93 Difference]: Finished difference Result 10542 states and 14863 transitions. [2022-07-21 15:44:29,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:44:29,494 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-21 15:44:29,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:29,529 INFO L225 Difference]: With dead ends: 10542 [2022-07-21 15:44:29,529 INFO L226 Difference]: Without dead ends: 10540 [2022-07-21 15:44:29,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:44:29,536 INFO L413 NwaCegarLoop]: 3075 mSDtfsCounter, 5491 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3683 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s 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.2s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:29,537 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.2s Time] [2022-07-21 15:44:29,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10540 states. [2022-07-21 15:44:30,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10540 to 10540. [2022-07-21 15:44:30,024 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-21 15:44:30,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10540 states to 10540 states and 14861 transitions. [2022-07-21 15:44:30,060 INFO L78 Accepts]: Start accepts. Automaton has 10540 states and 14861 transitions. Word has length 110 [2022-07-21 15:44:30,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:30,060 INFO L495 AbstractCegarLoop]: Abstraction has 10540 states and 14861 transitions. [2022-07-21 15:44:30,060 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-21 15:44:30,061 INFO L276 IsEmpty]: Start isEmpty. Operand 10540 states and 14861 transitions. [2022-07-21 15:44:30,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-21 15:44:30,063 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:30,064 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-21 15:44:30,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 15:44:30,064 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-21 15:44:30,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:30,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1227318538, now seen corresponding path program 1 times [2022-07-21 15:44:30,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:30,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569590028] [2022-07-21 15:44:30,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:30,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:30,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:30,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:30,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:30,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:30,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:30,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:44:30,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:30,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 15:44:30,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:30,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 15:44:30,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:30,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:44:30,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:30,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:30,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 15:44:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:30,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 15:44:30,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:30,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 15:44:30,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:30,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 15:44:30,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:30,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:44:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:30,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 15:44:30,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:30,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 15:44:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:30,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:44:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:30,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-21 15:44:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:30,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-21 15:44:30,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:30,292 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:44:30,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:30,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569590028] [2022-07-21 15:44:30,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569590028] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:30,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:30,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:44:30,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770765726] [2022-07-21 15:44:30,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:30,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:44:30,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:30,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:44:30,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:44:30,294 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-21 15:44:35,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:35,921 INFO L93 Difference]: Finished difference Result 10540 states and 14861 transitions. [2022-07-21 15:44:35,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:44:35,922 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-21 15:44:35,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:35,957 INFO L225 Difference]: With dead ends: 10540 [2022-07-21 15:44:35,957 INFO L226 Difference]: Without dead ends: 10538 [2022-07-21 15:44:35,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:44:35,966 INFO L413 NwaCegarLoop]: 3073 mSDtfsCounter, 5487 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3681 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s 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.1s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:35,967 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.1s Time] [2022-07-21 15:44:35,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10538 states. [2022-07-21 15:44:36,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10538 to 10538. [2022-07-21 15:44:36,414 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-21 15:44:36,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10538 states to 10538 states and 14859 transitions. [2022-07-21 15:44:36,453 INFO L78 Accepts]: Start accepts. Automaton has 10538 states and 14859 transitions. Word has length 116 [2022-07-21 15:44:36,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:36,454 INFO L495 AbstractCegarLoop]: Abstraction has 10538 states and 14859 transitions. [2022-07-21 15:44:36,454 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-21 15:44:36,454 INFO L276 IsEmpty]: Start isEmpty. Operand 10538 states and 14859 transitions. [2022-07-21 15:44:36,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-21 15:44:36,456 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:36,457 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-21 15:44:36,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-21 15:44:36,457 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-21 15:44:36,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:36,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1970825439, now seen corresponding path program 1 times [2022-07-21 15:44:36,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:36,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321422344] [2022-07-21 15:44:36,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:36,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:36,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:36,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:36,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:44:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 15:44:36,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 15:44:36,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:44:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:36,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 15:44:36,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 15:44:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:44:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:44:36,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:36,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:36,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 15:44:36,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-21 15:44:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-21 15:44:36,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:44:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-21 15:44:36,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-21 15:44:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 15:44:36,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,945 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-21 15:44:36,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:36,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321422344] [2022-07-21 15:44:36,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321422344] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:44:36,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270088905] [2022-07-21 15:44:36,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:36,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:44:36,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:44:36,947 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 15:44:36,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 15:44:37,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:37,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 2766 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-21 15:44:37,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 15:44:37,967 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-21 15:44:37,968 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 15:44:37,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270088905] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:37,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 15:44:37,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [17] total 19 [2022-07-21 15:44:37,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954851283] [2022-07-21 15:44:37,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:37,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 15:44:37,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:37,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 15:44:37,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2022-07-21 15:44:37,970 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-21 15:44:38,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:38,957 INFO L93 Difference]: Finished difference Result 20562 states and 28906 transitions. [2022-07-21 15:44:38,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 15:44:38,958 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-21 15:44:38,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:39,005 INFO L225 Difference]: With dead ends: 20562 [2022-07-21 15:44:39,005 INFO L226 Difference]: Without dead ends: 10591 [2022-07-21 15:44:39,055 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-21 15:44:39,055 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.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:39,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 45625 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 15:44:39,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10591 states. [2022-07-21 15:44:39,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10591 to 10562. [2022-07-21 15:44:39,621 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-21 15:44:39,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10562 states to 10562 states and 14891 transitions. [2022-07-21 15:44:39,676 INFO L78 Accepts]: Start accepts. Automaton has 10562 states and 14891 transitions. Word has length 135 [2022-07-21 15:44:39,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:39,677 INFO L495 AbstractCegarLoop]: Abstraction has 10562 states and 14891 transitions. [2022-07-21 15:44:39,677 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-21 15:44:39,677 INFO L276 IsEmpty]: Start isEmpty. Operand 10562 states and 14891 transitions. [2022-07-21 15:44:39,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-21 15:44:39,679 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:39,680 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-21 15:44:39,708 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-21 15:44:39,896 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-21 15:44:39,896 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-21 15:44:39,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:39,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1099724524, now seen corresponding path program 1 times [2022-07-21 15:44:39,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:39,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460106140] [2022-07-21 15:44:39,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:39,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:39,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:40,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:40,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:40,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:40,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:44:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:40,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 15:44:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:40,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 15:44:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:40,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:44:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:40,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:40,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 15:44:40,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:40,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 15:44:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:40,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 15:44:40,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:40,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 15:44:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:40,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:44:40,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:40,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 15:44:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:40,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 15:44:40,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:40,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:44:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:40,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-21 15:44:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:40,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-21 15:44:40,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:40,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-21 15:44:40,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:40,173 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:44:40,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:40,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460106140] [2022-07-21 15:44:40,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460106140] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:40,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:40,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:44:40,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21403675] [2022-07-21 15:44:40,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:40,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:44:40,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:40,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:44:40,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:44:40,175 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-21 15:44:45,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:45,992 INFO L93 Difference]: Finished difference Result 10562 states and 14891 transitions. [2022-07-21 15:44:45,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:44:45,994 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-21 15:44:45,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:46,025 INFO L225 Difference]: With dead ends: 10562 [2022-07-21 15:44:46,026 INFO L226 Difference]: Without dead ends: 10560 [2022-07-21 15:44:46,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:44:46,034 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-21 15:44:46,034 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-21 15:44:46,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10560 states. [2022-07-21 15:44:46,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10560 to 10560. [2022-07-21 15:44:46,523 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-21 15:44:46,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10560 states to 10560 states and 14889 transitions. [2022-07-21 15:44:46,559 INFO L78 Accepts]: Start accepts. Automaton has 10560 states and 14889 transitions. Word has length 122 [2022-07-21 15:44:46,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:46,559 INFO L495 AbstractCegarLoop]: Abstraction has 10560 states and 14889 transitions. [2022-07-21 15:44:46,560 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-21 15:44:46,560 INFO L276 IsEmpty]: Start isEmpty. Operand 10560 states and 14889 transitions. [2022-07-21 15:44:46,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-21 15:44:46,561 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:46,562 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-21 15:44:46,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-21 15:44:46,562 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-21 15:44:46,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:46,562 INFO L85 PathProgramCache]: Analyzing trace with hash -894151915, now seen corresponding path program 1 times [2022-07-21 15:44:46,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:46,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876606276] [2022-07-21 15:44:46,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:46,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:46,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:46,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:46,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:46,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:46,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:46,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:44:46,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:46,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 15:44:46,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:46,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 15:44:46,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:46,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:44:46,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:46,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:46,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:46,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 15:44:46,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:46,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 15:44:46,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:46,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 15:44:46,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:46,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 15:44:46,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:46,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:44:46,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:46,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 15:44:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:46,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 15:44:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:46,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:44:46,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:46,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-21 15:44:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:46,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-21 15:44:46,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:46,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-21 15:44:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:46,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-21 15:44:46,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:46,813 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:44:46,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:46,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876606276] [2022-07-21 15:44:46,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876606276] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:46,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:46,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:44:46,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808673654] [2022-07-21 15:44:46,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:46,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:44:46,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:46,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:44:46,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:44:46,817 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-21 15:44:52,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:52,780 INFO L93 Difference]: Finished difference Result 10560 states and 14889 transitions. [2022-07-21 15:44:52,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:44:52,782 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-21 15:44:52,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:52,807 INFO L225 Difference]: With dead ends: 10560 [2022-07-21 15:44:52,807 INFO L226 Difference]: Without dead ends: 10558 [2022-07-21 15:44:52,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:44:52,812 INFO L413 NwaCegarLoop]: 3069 mSDtfsCounter, 5475 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3677 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s 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.4s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:52,812 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.4s Time] [2022-07-21 15:44:52,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10558 states. [2022-07-21 15:44:53,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10558 to 10558. [2022-07-21 15:44:53,214 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-21 15:44:53,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10558 states to 10558 states and 14887 transitions. [2022-07-21 15:44:53,254 INFO L78 Accepts]: Start accepts. Automaton has 10558 states and 14887 transitions. Word has length 128 [2022-07-21 15:44:53,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:53,255 INFO L495 AbstractCegarLoop]: Abstraction has 10558 states and 14887 transitions. [2022-07-21 15:44:53,255 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-21 15:44:53,255 INFO L276 IsEmpty]: Start isEmpty. Operand 10558 states and 14887 transitions. [2022-07-21 15:44:53,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-21 15:44:53,258 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:53,258 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-21 15:44:53,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-21 15:44:53,259 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-21 15:44:53,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:53,259 INFO L85 PathProgramCache]: Analyzing trace with hash 150555854, now seen corresponding path program 1 times [2022-07-21 15:44:53,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:53,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279790184] [2022-07-21 15:44:53,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:53,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:53,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:53,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:53,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:53,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:53,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:44:53,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:53,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 15:44:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:53,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 15:44:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:53,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:44:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:53,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:53,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 15:44:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:53,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 15:44:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:53,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 15:44:53,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:53,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 15:44:53,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:53,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:44:53,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:53,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 15:44:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:53,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 15:44:53,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:53,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:44:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:53,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-21 15:44:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:53,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-21 15:44:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:53,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-21 15:44:53,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:53,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-21 15:44:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:53,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 15:44:53,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:53,508 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:44:53,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:53,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279790184] [2022-07-21 15:44:53,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279790184] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:53,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:53,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:44:53,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194814168] [2022-07-21 15:44:53,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:53,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:44:53,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:53,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:44:53,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:44:53,511 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-21 15:44:59,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:59,327 INFO L93 Difference]: Finished difference Result 10558 states and 14887 transitions. [2022-07-21 15:44:59,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:44:59,329 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-21 15:44:59,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:59,362 INFO L225 Difference]: With dead ends: 10558 [2022-07-21 15:44:59,362 INFO L226 Difference]: Without dead ends: 10556 [2022-07-21 15:44:59,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:44:59,370 INFO L413 NwaCegarLoop]: 3067 mSDtfsCounter, 5469 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3675 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s 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.3s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:59,371 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.3s Time] [2022-07-21 15:44:59,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10556 states. [2022-07-21 15:44:59,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10556 to 10556. [2022-07-21 15:44:59,811 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-21 15:44:59,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10556 states to 10556 states and 14885 transitions. [2022-07-21 15:44:59,851 INFO L78 Accepts]: Start accepts. Automaton has 10556 states and 14885 transitions. Word has length 134 [2022-07-21 15:44:59,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:59,852 INFO L495 AbstractCegarLoop]: Abstraction has 10556 states and 14885 transitions. [2022-07-21 15:44:59,852 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-21 15:44:59,852 INFO L276 IsEmpty]: Start isEmpty. Operand 10556 states and 14885 transitions. [2022-07-21 15:44:59,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-21 15:44:59,855 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:59,856 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-21 15:44:59,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-21 15:44:59,856 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-21 15:44:59,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:59,856 INFO L85 PathProgramCache]: Analyzing trace with hash -931896786, now seen corresponding path program 1 times [2022-07-21 15:44:59,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:59,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329438897] [2022-07-21 15:44:59,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:59,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:59,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:00,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:45:00,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:00,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:45:00,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:00,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:45:00,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:00,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 15:45:00,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:00,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:45:00,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:00,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:45:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:00,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:45:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:00,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-21 15:45:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:00,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:00,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:00,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:45:00,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:00,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:45:00,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:00,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 15:45:00,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:00,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 15:45:00,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:00,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:00,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:00,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:00,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:00,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:00,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:00,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-21 15:45:00,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:00,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 15:45:00,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:00,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-21 15:45:00,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:00,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-21 15:45:00,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:00,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 15:45:00,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:00,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:45:00,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:00,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 15:45:00,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:00,209 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-21 15:45:00,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:45:00,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329438897] [2022-07-21 15:45:00,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329438897] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:45:00,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775608088] [2022-07-21 15:45:00,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:45:00,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:45:00,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:45:00,212 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 15:45:00,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-21 15:45:01,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:01,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 2868 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-21 15:45:01,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 15:45:01,160 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-21 15:45:01,160 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 15:45:01,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775608088] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:45:01,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 15:45:01,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 12 [2022-07-21 15:45:01,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778970299] [2022-07-21 15:45:01,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:45:01,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 15:45:01,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:45:01,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 15:45:01,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-21 15:45:01,164 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-21 15:45:01,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:45:01,926 INFO L93 Difference]: Finished difference Result 21742 states and 30764 transitions. [2022-07-21 15:45:01,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 15:45:01,927 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-21 15:45:01,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:45:01,977 INFO L225 Difference]: With dead ends: 21742 [2022-07-21 15:45:01,977 INFO L226 Difference]: Without dead ends: 11376 [2022-07-21 15:45:02,014 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-21 15:45:02,015 INFO L413 NwaCegarLoop]: 3928 mSDtfsCounter, 401 mSDsluCounter, 26985 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 30913 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 15:45:02,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 30913 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 15:45:02,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11376 states. [2022-07-21 15:45:02,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11376 to 10560. [2022-07-21 15:45:02,462 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-21 15:45:02,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10560 states to 10560 states and 14889 transitions. [2022-07-21 15:45:02,610 INFO L78 Accepts]: Start accepts. Automaton has 10560 states and 14889 transitions. Word has length 151 [2022-07-21 15:45:02,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:45:02,611 INFO L495 AbstractCegarLoop]: Abstraction has 10560 states and 14889 transitions. [2022-07-21 15:45:02,611 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-21 15:45:02,611 INFO L276 IsEmpty]: Start isEmpty. Operand 10560 states and 14889 transitions. [2022-07-21 15:45:02,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-21 15:45:02,613 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:45:02,613 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-21 15:45:02,635 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-21 15:45:02,813 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-21 15:45:02,814 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-21 15:45:02,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:45:02,814 INFO L85 PathProgramCache]: Analyzing trace with hash 2137124343, now seen corresponding path program 1 times [2022-07-21 15:45:02,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:45:02,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491004145] [2022-07-21 15:45:02,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:45:02,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:45:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:02,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:45:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:02,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:45:02,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:02,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:45:02,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:02,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 15:45:02,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:02,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 15:45:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:02,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:45:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:02,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:02,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:02,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 15:45:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:02,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 15:45:02,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:02,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 15:45:02,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 15:45:03,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:45:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 15:45:03,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 15:45:03,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:45:03,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-21 15:45:03,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-21 15:45:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-21 15:45:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-21 15:45:03,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 15:45:03,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 15:45:03,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,077 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:45:03,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:45:03,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491004145] [2022-07-21 15:45:03,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491004145] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:45:03,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:45:03,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:45:03,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618133547] [2022-07-21 15:45:03,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:45:03,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:45:03,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:45:03,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:45:03,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:45:03,080 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-21 15:45:09,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:45:09,215 INFO L93 Difference]: Finished difference Result 10560 states and 14889 transitions. [2022-07-21 15:45:09,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:45:09,216 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-21 15:45:09,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:45:09,253 INFO L225 Difference]: With dead ends: 10560 [2022-07-21 15:45:09,254 INFO L226 Difference]: Without dead ends: 10558 [2022-07-21 15:45:09,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:45:09,263 INFO L413 NwaCegarLoop]: 3065 mSDtfsCounter, 5463 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3673 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5674 SdHoareTripleChecker+Valid, 5021 SdHoareTripleChecker+Invalid, 6955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3282 IncrementalHoareTripleChecker+Valid, 3673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-07-21 15:45:09,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5674 Valid, 5021 Invalid, 6955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3282 Valid, 3673 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-07-21 15:45:09,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10558 states. [2022-07-21 15:45:09,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10558 to 10558. [2022-07-21 15:45:09,767 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-21 15:45:09,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10558 states to 10558 states and 14887 transitions. [2022-07-21 15:45:09,807 INFO L78 Accepts]: Start accepts. Automaton has 10558 states and 14887 transitions. Word has length 140 [2022-07-21 15:45:09,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:45:09,808 INFO L495 AbstractCegarLoop]: Abstraction has 10558 states and 14887 transitions. [2022-07-21 15:45:09,808 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-21 15:45:09,808 INFO L276 IsEmpty]: Start isEmpty. Operand 10558 states and 14887 transitions. [2022-07-21 15:45:09,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-21 15:45:09,813 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:45:09,813 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-21 15:45:09,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-21 15:45:09,814 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-21 15:45:09,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:45:09,814 INFO L85 PathProgramCache]: Analyzing trace with hash -938020630, now seen corresponding path program 1 times [2022-07-21 15:45:09,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:45:09,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584724167] [2022-07-21 15:45:09,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:45:09,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:45:09,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:45:09,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:45:09,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:45:09,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 15:45:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 15:45:09,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:45:09,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 15:45:09,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 15:45:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 15:45:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 15:45:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:45:09,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 15:45:10,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:10,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 15:45:10,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:10,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:45:10,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:10,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-21 15:45:10,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:10,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-21 15:45:10,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:10,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-21 15:45:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:10,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-21 15:45:10,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:10,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 15:45:10,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:10,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 15:45:10,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:10,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-21 15:45:10,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:10,082 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:45:10,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:45:10,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584724167] [2022-07-21 15:45:10,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584724167] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:45:10,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:45:10,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:45:10,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948235536] [2022-07-21 15:45:10,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:45:10,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:45:10,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:45:10,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:45:10,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:45:10,085 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-21 15:45:15,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:45:15,993 INFO L93 Difference]: Finished difference Result 10558 states and 14887 transitions. [2022-07-21 15:45:15,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:45:15,994 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-21 15:45:15,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:45:16,024 INFO L225 Difference]: With dead ends: 10558 [2022-07-21 15:45:16,025 INFO L226 Difference]: Without dead ends: 10556 [2022-07-21 15:45:16,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:45:16,032 INFO L413 NwaCegarLoop]: 3063 mSDtfsCounter, 5457 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3671 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s 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.2s IncrementalHoareTripleChecker+Time [2022-07-21 15:45:16,032 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.2s Time] [2022-07-21 15:45:16,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10556 states. [2022-07-21 15:45:16,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10556 to 10556. [2022-07-21 15:45:16,632 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-21 15:45:16,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10556 states to 10556 states and 14885 transitions. [2022-07-21 15:45:16,672 INFO L78 Accepts]: Start accepts. Automaton has 10556 states and 14885 transitions. Word has length 146 [2022-07-21 15:45:16,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:45:16,673 INFO L495 AbstractCegarLoop]: Abstraction has 10556 states and 14885 transitions. [2022-07-21 15:45:16,673 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-21 15:45:16,673 INFO L276 IsEmpty]: Start isEmpty. Operand 10556 states and 14885 transitions. [2022-07-21 15:45:16,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-21 15:45:16,675 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:45:16,675 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-21 15:45:16,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-21 15:45:16,675 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-21 15:45:16,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:45:16,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1073850845, now seen corresponding path program 1 times [2022-07-21 15:45:16,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:45:16,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091188542] [2022-07-21 15:45:16,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:45:16,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:45:16,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:16,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:45:16,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:16,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:45:16,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:16,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:45:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:16,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 15:45:16,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:16,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 15:45:16,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:16,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:45:16,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:16,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:16,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:16,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 15:45:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:16,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 15:45:16,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:16,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 15:45:16,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:16,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 15:45:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:16,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:45:16,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:16,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 15:45:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:16,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 15:45:16,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:16,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:45:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:16,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-21 15:45:16,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:16,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-21 15:45:16,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:16,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-21 15:45:16,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:16,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-21 15:45:16,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:16,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 15:45:16,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:16,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 15:45:16,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:16,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-21 15:45:16,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:16,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-21 15:45:16,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:16,914 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:45:16,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:45:16,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091188542] [2022-07-21 15:45:16,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091188542] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:45:16,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:45:16,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:45:16,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170080035] [2022-07-21 15:45:16,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:45:16,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:45:16,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:45:16,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:45:16,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:45:16,917 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-21 15:45:22,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:45:22,936 INFO L93 Difference]: Finished difference Result 10556 states and 14885 transitions. [2022-07-21 15:45:22,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:45:22,937 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-21 15:45:22,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:45:22,968 INFO L225 Difference]: With dead ends: 10556 [2022-07-21 15:45:22,968 INFO L226 Difference]: Without dead ends: 10554 [2022-07-21 15:45:22,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:45:22,976 INFO L413 NwaCegarLoop]: 3061 mSDtfsCounter, 5451 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3669 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5660 SdHoareTripleChecker+Valid, 5017 SdHoareTripleChecker+Invalid, 6951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3282 IncrementalHoareTripleChecker+Valid, 3669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-07-21 15:45:22,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5660 Valid, 5017 Invalid, 6951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3282 Valid, 3669 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-07-21 15:45:22,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10554 states. [2022-07-21 15:45:23,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10554 to 10554. [2022-07-21 15:45:23,452 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-21 15:45:23,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10554 states to 10554 states and 14883 transitions. [2022-07-21 15:45:23,490 INFO L78 Accepts]: Start accepts. Automaton has 10554 states and 14883 transitions. Word has length 152 [2022-07-21 15:45:23,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:45:23,490 INFO L495 AbstractCegarLoop]: Abstraction has 10554 states and 14883 transitions. [2022-07-21 15:45:23,490 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-21 15:45:23,490 INFO L276 IsEmpty]: Start isEmpty. Operand 10554 states and 14883 transitions. [2022-07-21 15:45:23,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-07-21 15:45:23,493 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:45:23,493 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-21 15:45:23,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-21 15:45:23,493 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-21 15:45:23,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:45:23,494 INFO L85 PathProgramCache]: Analyzing trace with hash -242444843, now seen corresponding path program 1 times [2022-07-21 15:45:23,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:45:23,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053601854] [2022-07-21 15:45:23,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:45:23,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:45:23,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:23,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:45:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:23,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:45:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:23,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:45:23,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:23,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 15:45:23,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:23,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:23,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:23,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:23,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:23,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:23,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:45:23,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:23,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:23,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:23,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:23,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:23,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:23,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:23,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 15:45:23,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:23,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:23,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:23,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:23,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:23,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:23,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 15:45:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:23,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:45:23,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:23,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:45:23,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:23,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-21 15:45:23,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:23,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-21 15:45:23,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:23,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:45:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:23,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 15:45:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:23,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 15:45:23,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:23,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:23,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-21 15:45:23,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:23,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:23,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:23,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:23,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-21 15:45:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:23,896 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-21 15:45:23,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:45:23,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053601854] [2022-07-21 15:45:23,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053601854] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:45:23,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:45:23,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 15:45:23,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962426471] [2022-07-21 15:45:23,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:45:23,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 15:45:23,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:45:23,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 15:45:23,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-21 15:45:23,898 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-21 15:45:36,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:45:36,447 INFO L93 Difference]: Finished difference Result 22631 states and 33041 transitions. [2022-07-21 15:45:36,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 15:45:36,449 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-21 15:45:36,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:45:36,490 INFO L225 Difference]: With dead ends: 22631 [2022-07-21 15:45:36,490 INFO L226 Difference]: Without dead ends: 12102 [2022-07-21 15:45:36,514 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-21 15:45:36,514 INFO L413 NwaCegarLoop]: 2957 mSDtfsCounter, 4582 mSDsluCounter, 3797 mSDsCounter, 0 mSdLazyCounter, 10001 mSolverCounterSat, 4154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4582 SdHoareTripleChecker+Valid, 6754 SdHoareTripleChecker+Invalid, 14155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4154 IncrementalHoareTripleChecker+Valid, 10001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2022-07-21 15:45:36,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4582 Valid, 6754 Invalid, 14155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4154 Valid, 10001 Invalid, 0 Unknown, 0 Unchecked, 11.6s Time] [2022-07-21 15:45:36,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12102 states. [2022-07-21 15:45:37,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12102 to 10838. [2022-07-21 15:45:37,081 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-21 15:45:37,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10838 states to 10838 states and 15581 transitions. [2022-07-21 15:45:37,123 INFO L78 Accepts]: Start accepts. Automaton has 10838 states and 15581 transitions. Word has length 176 [2022-07-21 15:45:37,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:45:37,124 INFO L495 AbstractCegarLoop]: Abstraction has 10838 states and 15581 transitions. [2022-07-21 15:45:37,124 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-21 15:45:37,124 INFO L276 IsEmpty]: Start isEmpty. Operand 10838 states and 15581 transitions. [2022-07-21 15:45:37,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-07-21 15:45:37,126 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:45:37,126 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-21 15:45:37,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-21 15:45:37,127 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-21 15:45:37,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:45:37,127 INFO L85 PathProgramCache]: Analyzing trace with hash 573026121, now seen corresponding path program 1 times [2022-07-21 15:45:37,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:45:37,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284278297] [2022-07-21 15:45:37,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:45:37,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:45:37,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:37,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:45:37,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:37,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:45:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:37,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:45:37,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:37,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 15:45:37,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:37,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:37,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:37,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:37,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:37,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:37,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:37,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:45:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:37,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:37,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:37,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:37,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:37,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 15:45:37,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:37,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:37,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:37,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:37,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:37,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 15:45:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:37,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:45:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:37,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:45:37,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:37,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-21 15:45:37,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:37,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-21 15:45:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:37,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:45:37,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:37,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 15:45:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:37,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 15:45:37,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:37,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:37,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-21 15:45:37,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:37,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:37,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:37,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:37,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:37,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-21 15:45:37,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:37,420 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-21 15:45:37,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:45:37,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284278297] [2022-07-21 15:45:37,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284278297] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:45:37,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:45:37,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 15:45:37,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047650749] [2022-07-21 15:45:37,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:45:37,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 15:45:37,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:45:37,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 15:45:37,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-21 15:45:37,423 INFO L87 Difference]: Start difference. First operand 10838 states and 15581 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 4 states have internal predecessors, (78), 3 states have call successors, (24), 6 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-21 15:45:50,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:45:50,020 INFO L93 Difference]: Finished difference Result 23099 states and 34027 transitions. [2022-07-21 15:45:50,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 15:45:50,021 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 4 states have internal predecessors, (78), 3 states have call successors, (24), 6 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 177 [2022-07-21 15:45:50,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:45:50,070 INFO L225 Difference]: With dead ends: 23099 [2022-07-21 15:45:50,070 INFO L226 Difference]: Without dead ends: 12286 [2022-07-21 15:45:50,107 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-21 15:45:50,108 INFO L413 NwaCegarLoop]: 2958 mSDtfsCounter, 4579 mSDsluCounter, 3797 mSDsCounter, 0 mSdLazyCounter, 10012 mSolverCounterSat, 4157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4579 SdHoareTripleChecker+Valid, 6755 SdHoareTripleChecker+Invalid, 14169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4157 IncrementalHoareTripleChecker+Valid, 10012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2022-07-21 15:45:50,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4579 Valid, 6755 Invalid, 14169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4157 Valid, 10012 Invalid, 0 Unknown, 0 Unchecked, 11.6s Time] [2022-07-21 15:45:50,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12286 states. [2022-07-21 15:45:50,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12286 to 11030. [2022-07-21 15:45:50,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11030 states, 7337 states have (on average 1.2716369088183181) internal successors, (9330), 7591 states have internal predecessors, (9330), 2946 states have call successors, (2946), 711 states have call predecessors, (2946), 737 states have return successors, (3589), 2860 states have call predecessors, (3589), 2944 states have call successors, (3589) [2022-07-21 15:45:50,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11030 states to 11030 states and 15865 transitions. [2022-07-21 15:45:50,835 INFO L78 Accepts]: Start accepts. Automaton has 11030 states and 15865 transitions. Word has length 177 [2022-07-21 15:45:50,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:45:50,836 INFO L495 AbstractCegarLoop]: Abstraction has 11030 states and 15865 transitions. [2022-07-21 15:45:50,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 4 states have internal predecessors, (78), 3 states have call successors, (24), 6 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-21 15:45:50,836 INFO L276 IsEmpty]: Start isEmpty. Operand 11030 states and 15865 transitions. [2022-07-21 15:45:50,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-07-21 15:45:50,838 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:45:50,838 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:45:50,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-21 15:45:50,839 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-21 15:45:50,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:45:50,840 INFO L85 PathProgramCache]: Analyzing trace with hash -574680277, now seen corresponding path program 1 times [2022-07-21 15:45:50,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:45:50,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384850775] [2022-07-21 15:45:50,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:45:50,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:45:50,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:50,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:45:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:50,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:45:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:50,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:45:50,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:50,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 15:45:50,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:51,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 15:45:51,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:51,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:45:51,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:51,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:51,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:51,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 15:45:51,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:51,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 15:45:51,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:51,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 15:45:51,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:51,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 15:45:51,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:51,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:45:51,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:51,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 15:45:51,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:51,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 15:45:51,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:51,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:45:51,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:51,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-21 15:45:51,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:51,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-21 15:45:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:51,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-21 15:45:51,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:51,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-21 15:45:51,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:51,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 15:45:51,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:51,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 15:45:51,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:51,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-21 15:45:51,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:51,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-21 15:45:51,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:51,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-21 15:45:51,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:51,108 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:45:51,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:45:51,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384850775] [2022-07-21 15:45:51,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384850775] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:45:51,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:45:51,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:45:51,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007686162] [2022-07-21 15:45:51,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:45:51,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:45:51,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:45:51,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:45:51,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:45:51,110 INFO L87 Difference]: Start difference. First operand 11030 states and 15865 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24)