./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--hid--usbhid--usbhid.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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--hid--usbhid--usbhid.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 7c12097eac5f261adffff229683e356131e183db7c13bb0d667f223c1dbcfa9a --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 16:53:58,546 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 16:53:58,548 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 16:53:58,578 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 16:53:58,578 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 16:53:58,579 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 16:53:58,583 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 16:53:58,585 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 16:53:58,586 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 16:53:58,589 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 16:53:58,590 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 16:53:58,592 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 16:53:58,592 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 16:53:58,593 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 16:53:58,595 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 16:53:58,597 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 16:53:58,597 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 16:53:58,599 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 16:53:58,600 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 16:53:58,605 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 16:53:58,607 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 16:53:58,607 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 16:53:58,608 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 16:53:58,609 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 16:53:58,610 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 16:53:58,612 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 16:53:58,612 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 16:53:58,612 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 16:53:58,613 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 16:53:58,613 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 16:53:58,614 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 16:53:58,614 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 16:53:58,615 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 16:53:58,616 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 16:53:58,616 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 16:53:58,617 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 16:53:58,617 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 16:53:58,618 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 16:53:58,618 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 16:53:58,618 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 16:53:58,619 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 16:53:58,620 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 16:53:58,620 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 16:53:58,645 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 16:53:58,645 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 16:53:58,645 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 16:53:58,646 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 16:53:58,646 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 16:53:58,646 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 16:53:58,647 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 16:53:58,647 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 16:53:58,647 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 16:53:58,648 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 16:53:58,648 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 16:53:58,648 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 16:53:58,648 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 16:53:58,648 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 16:53:58,649 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 16:53:58,649 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 16:53:58,649 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 16:53:58,649 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 16:53:58,649 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 16:53:58,649 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 16:53:58,650 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 16:53:58,650 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 16:53:58,650 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 16:53:58,650 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 16:53:58,650 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 16:53:58,650 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 16:53:58,650 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 16:53:58,651 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 16:53:58,651 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 16:53:58,651 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 16:53:58,651 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 -> 7c12097eac5f261adffff229683e356131e183db7c13bb0d667f223c1dbcfa9a [2022-07-12 16:53:58,874 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 16:53:58,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 16:53:58,896 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 16:53:58,897 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 16:53:58,897 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 16:53:58,898 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--hid--usbhid--usbhid.ko.cil.i [2022-07-12 16:53:58,947 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4181ed420/b1157f430a6b492ba21416f7daed3f4e/FLAGe316fa34d [2022-07-12 16:53:59,649 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 16:53:59,650 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i [2022-07-12 16:53:59,693 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4181ed420/b1157f430a6b492ba21416f7daed3f4e/FLAGe316fa34d [2022-07-12 16:53:59,976 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4181ed420/b1157f430a6b492ba21416f7daed3f4e [2022-07-12 16:53:59,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 16:53:59,979 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 16:53:59,981 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 16:53:59,982 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 16:53:59,984 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 16:53:59,984 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 04:53:59" (1/1) ... [2022-07-12 16:53:59,986 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6078ccfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:53:59, skipping insertion in model container [2022-07-12 16:53:59,986 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 04:53:59" (1/1) ... [2022-07-12 16:53:59,991 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 16:54:00,124 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 16:54:04,297 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[497733,497746] [2022-07-12 16:54:04,300 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[497878,497891] [2022-07-12 16:54:04,300 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[498024,498037] [2022-07-12 16:54:04,301 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[498189,498202] [2022-07-12 16:54:04,301 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[498347,498360] [2022-07-12 16:54:04,301 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[498505,498518] [2022-07-12 16:54:04,302 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[498663,498676] [2022-07-12 16:54:04,302 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[498823,498836] [2022-07-12 16:54:04,302 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[498982,498995] [2022-07-12 16:54:04,302 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[499121,499134] [2022-07-12 16:54:04,303 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[499263,499276] [2022-07-12 16:54:04,303 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[499412,499425] [2022-07-12 16:54:04,303 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[499551,499564] [2022-07-12 16:54:04,304 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[499706,499719] [2022-07-12 16:54:04,304 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[499866,499879] [2022-07-12 16:54:04,304 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[500017,500030] [2022-07-12 16:54:04,305 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[500168,500181] [2022-07-12 16:54:04,305 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[500320,500333] [2022-07-12 16:54:04,305 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[500469,500482] [2022-07-12 16:54:04,306 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[500617,500630] [2022-07-12 16:54:04,306 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[500774,500787] [2022-07-12 16:54:04,307 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[500923,500936] [2022-07-12 16:54:04,307 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[501079,501092] [2022-07-12 16:54:04,307 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[501232,501245] [2022-07-12 16:54:04,308 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[501378,501391] [2022-07-12 16:54:04,308 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[501521,501534] [2022-07-12 16:54:04,308 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[501673,501686] [2022-07-12 16:54:04,308 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[501819,501832] [2022-07-12 16:54:04,309 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[501964,501977] [2022-07-12 16:54:04,309 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[502118,502131] [2022-07-12 16:54:04,309 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[502269,502282] [2022-07-12 16:54:04,310 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[502424,502437] [2022-07-12 16:54:04,310 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[502576,502589] [2022-07-12 16:54:04,310 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[502731,502744] [2022-07-12 16:54:04,310 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[502895,502908] [2022-07-12 16:54:04,311 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[503051,503064] [2022-07-12 16:54:04,311 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[503215,503228] [2022-07-12 16:54:04,311 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[503357,503370] [2022-07-12 16:54:04,312 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[503515,503528] [2022-07-12 16:54:04,312 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[503682,503695] [2022-07-12 16:54:04,312 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[503841,503854] [2022-07-12 16:54:04,312 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[504000,504013] [2022-07-12 16:54:04,313 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[504149,504162] [2022-07-12 16:54:04,313 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[504296,504309] [2022-07-12 16:54:04,313 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[504435,504448] [2022-07-12 16:54:04,314 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[504598,504611] [2022-07-12 16:54:04,314 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[504764,504777] [2022-07-12 16:54:04,314 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[504928,504941] [2022-07-12 16:54:04,314 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[505093,505106] [2022-07-12 16:54:04,315 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[505258,505271] [2022-07-12 16:54:04,315 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[505424,505437] [2022-07-12 16:54:04,315 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[505589,505602] [2022-07-12 16:54:04,316 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[505756,505769] [2022-07-12 16:54:04,316 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[505916,505929] [2022-07-12 16:54:04,316 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[506078,506091] [2022-07-12 16:54:04,316 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[506237,506250] [2022-07-12 16:54:04,317 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[506383,506396] [2022-07-12 16:54:04,317 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[506526,506539] [2022-07-12 16:54:04,317 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[506670,506683] [2022-07-12 16:54:04,317 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[506813,506826] [2022-07-12 16:54:04,318 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[506957,506970] [2022-07-12 16:54:04,318 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[507098,507111] [2022-07-12 16:54:04,318 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[507236,507249] [2022-07-12 16:54:04,319 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[507394,507407] [2022-07-12 16:54:04,319 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[507553,507566] [2022-07-12 16:54:04,319 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[507709,507722] [2022-07-12 16:54:04,319 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[507858,507871] [2022-07-12 16:54:04,320 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[508010,508023] [2022-07-12 16:54:04,320 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[508161,508174] [2022-07-12 16:54:04,320 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[508310,508323] [2022-07-12 16:54:04,320 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[508462,508475] [2022-07-12 16:54:04,321 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[508610,508623] [2022-07-12 16:54:04,321 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[508763,508776] [2022-07-12 16:54:04,321 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[508914,508927] [2022-07-12 16:54:04,322 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[509064,509077] [2022-07-12 16:54:04,322 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[509211,509224] [2022-07-12 16:54:04,322 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[509362,509375] [2022-07-12 16:54:04,322 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[509513,509526] [2022-07-12 16:54:04,323 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[509661,509674] [2022-07-12 16:54:04,323 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[509827,509840] [2022-07-12 16:54:04,323 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[509996,510009] [2022-07-12 16:54:04,323 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[510163,510176] [2022-07-12 16:54:04,324 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[510331,510344] [2022-07-12 16:54:04,324 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[510481,510494] [2022-07-12 16:54:04,324 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[510628,510641] [2022-07-12 16:54:04,325 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[510789,510802] [2022-07-12 16:54:04,325 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[510959,510972] [2022-07-12 16:54:04,325 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[511121,511134] [2022-07-12 16:54:04,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 16:54:04,365 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 16:54:04,718 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[497733,497746] [2022-07-12 16:54:04,720 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[497878,497891] [2022-07-12 16:54:04,720 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[498024,498037] [2022-07-12 16:54:04,720 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[498189,498202] [2022-07-12 16:54:04,721 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[498347,498360] [2022-07-12 16:54:04,722 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[498505,498518] [2022-07-12 16:54:04,722 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[498663,498676] [2022-07-12 16:54:04,722 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[498823,498836] [2022-07-12 16:54:04,723 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[498982,498995] [2022-07-12 16:54:04,724 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[499121,499134] [2022-07-12 16:54:04,724 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[499263,499276] [2022-07-12 16:54:04,724 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[499412,499425] [2022-07-12 16:54:04,725 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[499551,499564] [2022-07-12 16:54:04,725 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[499706,499719] [2022-07-12 16:54:04,725 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[499866,499879] [2022-07-12 16:54:04,726 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[500017,500030] [2022-07-12 16:54:04,726 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[500168,500181] [2022-07-12 16:54:04,726 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[500320,500333] [2022-07-12 16:54:04,726 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[500469,500482] [2022-07-12 16:54:04,727 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[500617,500630] [2022-07-12 16:54:04,728 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[500774,500787] [2022-07-12 16:54:04,728 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[500923,500936] [2022-07-12 16:54:04,729 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[501079,501092] [2022-07-12 16:54:04,729 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[501232,501245] [2022-07-12 16:54:04,729 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[501378,501391] [2022-07-12 16:54:04,730 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[501521,501534] [2022-07-12 16:54:04,730 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[501673,501686] [2022-07-12 16:54:04,730 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[501819,501832] [2022-07-12 16:54:04,730 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[501964,501977] [2022-07-12 16:54:04,731 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[502118,502131] [2022-07-12 16:54:04,731 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[502269,502282] [2022-07-12 16:54:04,731 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[502424,502437] [2022-07-12 16:54:04,732 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[502576,502589] [2022-07-12 16:54:04,733 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[502731,502744] [2022-07-12 16:54:04,733 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[502895,502908] [2022-07-12 16:54:04,733 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[503051,503064] [2022-07-12 16:54:04,734 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[503215,503228] [2022-07-12 16:54:04,734 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[503357,503370] [2022-07-12 16:54:04,735 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[503515,503528] [2022-07-12 16:54:04,735 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[503682,503695] [2022-07-12 16:54:04,736 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[503841,503854] [2022-07-12 16:54:04,736 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[504000,504013] [2022-07-12 16:54:04,736 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[504149,504162] [2022-07-12 16:54:04,736 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[504296,504309] [2022-07-12 16:54:04,737 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[504435,504448] [2022-07-12 16:54:04,737 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[504598,504611] [2022-07-12 16:54:04,737 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[504764,504777] [2022-07-12 16:54:04,738 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[504928,504941] [2022-07-12 16:54:04,738 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[505093,505106] [2022-07-12 16:54:04,738 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[505258,505271] [2022-07-12 16:54:04,739 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[505424,505437] [2022-07-12 16:54:04,739 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[505589,505602] [2022-07-12 16:54:04,740 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[505756,505769] [2022-07-12 16:54:04,740 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[505916,505929] [2022-07-12 16:54:04,740 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[506078,506091] [2022-07-12 16:54:04,740 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[506237,506250] [2022-07-12 16:54:04,741 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[506383,506396] [2022-07-12 16:54:04,741 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[506526,506539] [2022-07-12 16:54:04,742 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[506670,506683] [2022-07-12 16:54:04,742 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[506813,506826] [2022-07-12 16:54:04,742 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[506957,506970] [2022-07-12 16:54:04,743 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[507098,507111] [2022-07-12 16:54:04,744 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[507236,507249] [2022-07-12 16:54:04,748 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[507394,507407] [2022-07-12 16:54:04,749 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[507553,507566] [2022-07-12 16:54:04,749 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[507709,507722] [2022-07-12 16:54:04,750 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[507858,507871] [2022-07-12 16:54:04,750 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[508010,508023] [2022-07-12 16:54:04,751 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[508161,508174] [2022-07-12 16:54:04,751 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[508310,508323] [2022-07-12 16:54:04,751 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[508462,508475] [2022-07-12 16:54:04,752 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[508610,508623] [2022-07-12 16:54:04,756 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[508763,508776] [2022-07-12 16:54:04,756 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[508914,508927] [2022-07-12 16:54:04,756 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[509064,509077] [2022-07-12 16:54:04,757 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[509211,509224] [2022-07-12 16:54:04,757 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[509362,509375] [2022-07-12 16:54:04,758 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[509513,509526] [2022-07-12 16:54:04,759 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[509661,509674] [2022-07-12 16:54:04,760 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[509827,509840] [2022-07-12 16:54:04,760 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[509996,510009] [2022-07-12 16:54:04,761 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[510163,510176] [2022-07-12 16:54:04,761 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[510331,510344] [2022-07-12 16:54:04,762 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[510481,510494] [2022-07-12 16:54:04,762 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[510628,510641] [2022-07-12 16:54:04,762 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[510789,510802] [2022-07-12 16:54:04,762 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[510959,510972] [2022-07-12 16:54:04,763 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[511121,511134] [2022-07-12 16:54:04,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 16:54:04,957 INFO L208 MainTranslator]: Completed translation [2022-07-12 16:54:04,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:54:04 WrapperNode [2022-07-12 16:54:04,958 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 16:54:04,959 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 16:54:04,959 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 16:54:04,959 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 16:54:04,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:54:04" (1/1) ... [2022-07-12 16:54:05,048 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:54:04" (1/1) ... [2022-07-12 16:54:05,275 INFO L137 Inliner]: procedures = 791, calls = 4679, calls flagged for inlining = 346, calls inlined = 247, statements flattened = 8171 [2022-07-12 16:54:05,276 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 16:54:05,277 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 16:54:05,277 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 16:54:05,277 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 16:54:05,284 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:54:04" (1/1) ... [2022-07-12 16:54:05,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:54:04" (1/1) ... [2022-07-12 16:54:05,347 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:54:04" (1/1) ... [2022-07-12 16:54:05,348 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:54:04" (1/1) ... [2022-07-12 16:54:05,529 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:54:04" (1/1) ... [2022-07-12 16:54:05,573 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:54:04" (1/1) ... [2022-07-12 16:54:05,608 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:54:04" (1/1) ... [2022-07-12 16:54:05,642 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 16:54:05,643 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 16:54:05,644 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 16:54:05,644 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 16:54:05,644 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:54:04" (1/1) ... [2022-07-12 16:54:05,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 16:54:05,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 16:54:05,666 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-12 16:54:05,673 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-12 16:54:05,694 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2022-07-12 16:54:05,694 INFO L130 BoogieDeclarations]: Found specification of procedure pidff_request_effect_upload [2022-07-12 16:54:05,695 INFO L138 BoogieDeclarations]: Found implementation of procedure pidff_request_effect_upload [2022-07-12 16:54:05,695 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_int [2022-07-12 16:54:05,695 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_int [2022-07-12 16:54:05,695 INFO L130 BoogieDeclarations]: Found specification of procedure pidff_find_special_field [2022-07-12 16:54:05,695 INFO L138 BoogieDeclarations]: Found implementation of procedure pidff_find_special_field [2022-07-12 16:54:05,695 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_usbhid_device [2022-07-12 16:54:05,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_usbhid_device [2022-07-12 16:54:05,695 INFO L130 BoogieDeclarations]: Found specification of procedure pidff_check_usage [2022-07-12 16:54:05,696 INFO L138 BoogieDeclarations]: Found implementation of procedure pidff_check_usage [2022-07-12 16:54:05,696 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-12 16:54:05,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-12 16:54:05,696 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_get_interface [2022-07-12 16:54:05,696 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_get_interface [2022-07-12 16:54:05,696 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-12 16:54:05,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-12 16:54:05,697 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_in [2022-07-12 16:54:05,697 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_in [2022-07-12 16:54:05,697 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-12 16:54:05,697 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-12 16:54:05,697 INFO L130 BoogieDeclarations]: Found specification of procedure hid_suspend [2022-07-12 16:54:05,697 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_suspend [2022-07-12 16:54:05,697 INFO L130 BoogieDeclarations]: Found specification of procedure pidff_erase_pid [2022-07-12 16:54:05,697 INFO L138 BoogieDeclarations]: Found implementation of procedure pidff_erase_pid [2022-07-12 16:54:05,697 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-12 16:54:05,697 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-07-12 16:54:05,698 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-07-12 16:54:05,698 INFO L130 BoogieDeclarations]: Found specification of procedure hid_submit_out [2022-07-12 16:54:05,698 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_submit_out [2022-07-12 16:54:05,698 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_108 [2022-07-12 16:54:05,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_108 [2022-07-12 16:54:05,698 INFO L130 BoogieDeclarations]: Found specification of procedure hid_output_report [2022-07-12 16:54:05,698 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_output_report [2022-07-12 16:54:05,698 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-12 16:54:05,698 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-12 16:54:05,698 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-12 16:54:05,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-12 16:54:05,699 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_existancelock_of_hiddev [2022-07-12 16:54:05,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_existancelock_of_hiddev [2022-07-12 16:54:05,699 INFO L130 BoogieDeclarations]: Found specification of procedure hid_find_max_report [2022-07-12 16:54:05,699 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_find_max_report [2022-07-12 16:54:05,699 INFO L130 BoogieDeclarations]: Found specification of procedure pidff_autocenter [2022-07-12 16:54:05,699 INFO L138 BoogieDeclarations]: Found implementation of procedure pidff_autocenter [2022-07-12 16:54:05,699 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-12 16:54:05,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-12 16:54:05,699 INFO L130 BoogieDeclarations]: Found specification of procedure hiddev_ioctl [2022-07-12 16:54:05,700 INFO L138 BoogieDeclarations]: Found implementation of procedure hiddev_ioctl [2022-07-12 16:54:05,700 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-12 16:54:05,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-12 16:54:05,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 16:54:05,700 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-12 16:54:05,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-12 16:54:05,700 INFO L130 BoogieDeclarations]: Found specification of procedure hid_submit_ctrl [2022-07-12 16:54:05,700 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_submit_ctrl [2022-07-12 16:54:05,700 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irq_120 [2022-07-12 16:54:05,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irq_120 [2022-07-12 16:54:05,701 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2022-07-12 16:54:05,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2022-07-12 16:54:05,701 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~pm_message_t~0~TO~int [2022-07-12 16:54:05,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~pm_message_t~0~TO~int [2022-07-12 16:54:05,701 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_restart_out_queue [2022-07-12 16:54:05,701 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_restart_out_queue [2022-07-12 16:54:05,701 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2022-07-12 16:54:05,701 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2022-07-12 16:54:05,701 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-12 16:54:05,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-12 16:54:05,702 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_stop [2022-07-12 16:54:05,702 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_stop [2022-07-12 16:54:05,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 16:54:05,702 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mod_timer [2022-07-12 16:54:05,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mod_timer [2022-07-12 16:54:05,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 16:54:05,702 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-12 16:54:05,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-12 16:54:05,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 16:54:05,703 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-12 16:54:05,703 INFO L130 BoogieDeclarations]: Found specification of procedure hid_cease_io [2022-07-12 16:54:05,703 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_cease_io [2022-07-12 16:54:05,703 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2022-07-12 16:54:05,703 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2022-07-12 16:54:05,703 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_irq [2022-07-12 16:54:05,703 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_irq [2022-07-12 16:54:05,703 INFO L130 BoogieDeclarations]: Found specification of procedure usb_control_msg [2022-07-12 16:54:05,703 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_control_msg [2022-07-12 16:54:05,703 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-12 16:54:05,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-12 16:54:05,704 INFO L130 BoogieDeclarations]: Found specification of procedure hid_hw_wait [2022-07-12 16:54:05,704 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_hw_wait [2022-07-12 16:54:05,704 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-12 16:54:05,704 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-12 16:54:05,704 INFO L130 BoogieDeclarations]: Found specification of procedure hid_start_in [2022-07-12 16:54:05,704 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_start_in [2022-07-12 16:54:05,704 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2022-07-12 16:54:05,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2022-07-12 16:54:05,704 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-12 16:54:05,704 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-12 16:54:05,705 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_hid_open_mut [2022-07-12 16:54:05,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_hid_open_mut [2022-07-12 16:54:05,705 INFO L130 BoogieDeclarations]: Found specification of procedure hid_io_error [2022-07-12 16:54:05,705 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_io_error [2022-07-12 16:54:05,705 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2022-07-12 16:54:05,705 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2022-07-12 16:54:05,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 16:54:05,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 16:54:05,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 16:54:05,706 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-07-12 16:54:05,706 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-07-12 16:54:05,706 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_process_context [2022-07-12 16:54:05,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_process_context [2022-07-12 16:54:05,706 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2022-07-12 16:54:05,706 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2022-07-12 16:54:05,706 INFO L130 BoogieDeclarations]: Found specification of procedure hid_cancel_delayed_stuff [2022-07-12 16:54:05,706 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_cancel_delayed_stuff [2022-07-12 16:54:05,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-12 16:54:05,706 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-12 16:54:05,706 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_usbhid_device [2022-07-12 16:54:05,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_usbhid_device [2022-07-12 16:54:05,707 INFO L130 BoogieDeclarations]: Found specification of procedure hiddev_lookup_report [2022-07-12 16:54:05,707 INFO L138 BoogieDeclarations]: Found implementation of procedure hiddev_lookup_report [2022-07-12 16:54:05,707 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-12 16:54:05,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-12 16:54:05,707 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_free_urb [2022-07-12 16:54:05,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_free_urb [2022-07-12 16:54:05,707 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-12 16:54:05,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-12 16:54:05,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 16:54:05,708 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-07-12 16:54:05,708 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-07-12 16:54:05,708 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-12 16:54:05,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-12 16:54:05,708 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_submit_report [2022-07-12 16:54:05,708 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_submit_report [2022-07-12 16:54:05,708 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_mark_busy [2022-07-12 16:54:05,708 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_mark_busy [2022-07-12 16:54:05,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 16:54:05,708 INFO L130 BoogieDeclarations]: Found specification of procedure hid_set_idle [2022-07-12 16:54:05,708 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_set_idle [2022-07-12 16:54:05,709 INFO L130 BoogieDeclarations]: Found specification of procedure pidff_set [2022-07-12 16:54:05,709 INFO L138 BoogieDeclarations]: Found implementation of procedure pidff_set [2022-07-12 16:54:05,709 INFO L130 BoogieDeclarations]: Found specification of procedure hid_reset_resume [2022-07-12 16:54:05,709 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_reset_resume [2022-07-12 16:54:05,709 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2022-07-12 16:54:05,709 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2022-07-12 16:54:05,709 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-12 16:54:05,709 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-12 16:54:05,709 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-12 16:54:05,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-12 16:54:05,709 INFO L130 BoogieDeclarations]: Found specification of procedure hid_alloc_report_buf [2022-07-12 16:54:05,710 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_alloc_report_buf [2022-07-12 16:54:05,710 INFO L130 BoogieDeclarations]: Found specification of procedure pidff_find_reports [2022-07-12 16:54:05,710 INFO L138 BoogieDeclarations]: Found implementation of procedure pidff_find_reports [2022-07-12 16:54:05,710 INFO L130 BoogieDeclarations]: Found specification of procedure list_empty [2022-07-12 16:54:05,710 INFO L138 BoogieDeclarations]: Found implementation of procedure list_empty [2022-07-12 16:54:05,710 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_alloc_urb [2022-07-12 16:54:05,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_alloc_urb [2022-07-12 16:54:05,710 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-12 16:54:05,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-12 16:54:05,710 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-12 16:54:05,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-12 16:54:05,711 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2022-07-12 16:54:05,711 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2022-07-12 16:54:05,711 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-12 16:54:05,711 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-12 16:54:05,711 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-12 16:54:05,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-12 16:54:05,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 16:54:05,711 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irq [2022-07-12 16:54:05,711 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irq [2022-07-12 16:54:05,711 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-12 16:54:05,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-12 16:54:05,712 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_restart_ctrl_queue [2022-07-12 16:54:05,712 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_restart_ctrl_queue [2022-07-12 16:54:05,712 INFO L130 BoogieDeclarations]: Found specification of procedure pidff_reset [2022-07-12 16:54:05,712 INFO L138 BoogieDeclarations]: Found implementation of procedure pidff_reset [2022-07-12 16:54:05,712 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_thread_lock_of_hiddev_list [2022-07-12 16:54:05,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_thread_lock_of_hiddev_list [2022-07-12 16:54:05,712 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2022-07-12 16:54:05,712 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2022-07-12 16:54:05,712 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_lookup_quirk [2022-07-12 16:54:05,712 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_lookup_quirk [2022-07-12 16:54:05,713 INFO L130 BoogieDeclarations]: Found specification of procedure usb_string [2022-07-12 16:54:05,713 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_string [2022-07-12 16:54:05,713 INFO L130 BoogieDeclarations]: Found specification of procedure hid_resume [2022-07-12 16:54:05,713 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_resume [2022-07-12 16:54:05,713 INFO L130 BoogieDeclarations]: Found specification of procedure hid_get_class_descriptor [2022-07-12 16:54:05,713 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_get_class_descriptor [2022-07-12 16:54:05,713 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_107 [2022-07-12 16:54:05,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_107 [2022-07-12 16:54:05,713 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_96 [2022-07-12 16:54:05,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_96 [2022-07-12 16:54:05,713 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_97 [2022-07-12 16:54:05,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_97 [2022-07-12 16:54:05,714 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-12 16:54:05,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-12 16:54:05,714 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_thread_lock_of_hiddev_list [2022-07-12 16:54:05,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_thread_lock_of_hiddev_list [2022-07-12 16:54:05,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-12 16:54:05,714 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-12 16:54:05,714 INFO L130 BoogieDeclarations]: Found specification of procedure pidff_playback_pid [2022-07-12 16:54:05,714 INFO L138 BoogieDeclarations]: Found implementation of procedure pidff_playback_pid [2022-07-12 16:54:05,714 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 16:54:05,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 16:54:05,715 INFO L130 BoogieDeclarations]: Found specification of procedure usb_block_urb [2022-07-12 16:54:05,715 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_block_urb [2022-07-12 16:54:05,715 INFO L130 BoogieDeclarations]: Found specification of procedure hid_retry_timeout [2022-07-12 16:54:05,715 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_retry_timeout [2022-07-12 16:54:05,715 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_timer_timer_instance_3 [2022-07-12 16:54:05,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_timer_timer_instance_3 [2022-07-12 16:54:05,715 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_usb_alloc_coherent [2022-07-12 16:54:05,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_usb_alloc_coherent [2022-07-12 16:54:05,715 INFO L130 BoogieDeclarations]: Found specification of procedure __usb_get_extra_descriptor [2022-07-12 16:54:05,716 INFO L138 BoogieDeclarations]: Found implementation of procedure __usb_get_extra_descriptor [2022-07-12 16:54:05,716 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_init_reports [2022-07-12 16:54:05,716 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_init_reports [2022-07-12 16:54:05,716 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_hid_open_mut [2022-07-12 16:54:05,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_hid_open_mut [2022-07-12 16:54:05,716 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-12 16:54:05,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-12 16:54:05,716 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-12 16:54:05,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-12 16:54:05,716 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-12 16:54:05,716 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-12 16:54:05,717 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unpoison_urb [2022-07-12 16:54:05,717 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unpoison_urb [2022-07-12 16:54:05,717 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-12 16:54:05,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-12 16:54:05,717 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-12 16:54:05,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-12 16:54:05,717 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-12 16:54:05,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-12 16:54:05,717 INFO L130 BoogieDeclarations]: Found specification of procedure hid_resume_common [2022-07-12 16:54:05,717 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_resume_common [2022-07-12 16:54:05,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 16:54:05,718 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_del_timer_sync [2022-07-12 16:54:05,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_del_timer_sync [2022-07-12 16:54:05,718 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2022-07-12 16:54:05,718 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2022-07-12 16:54:05,718 INFO L130 BoogieDeclarations]: Found specification of procedure hid_free_buffers [2022-07-12 16:54:05,718 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_free_buffers [2022-07-12 16:54:05,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-12 16:54:05,718 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-07-12 16:54:05,718 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-07-12 16:54:05,718 INFO L130 BoogieDeclarations]: Found specification of procedure hid_pidff_init [2022-07-12 16:54:05,718 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_pidff_init [2022-07-12 16:54:05,719 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-12 16:54:05,719 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-12 16:54:05,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-12 16:54:05,719 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-12 16:54:05,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-12 16:54:05,719 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_put_interface [2022-07-12 16:54:05,719 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_put_interface [2022-07-12 16:54:05,719 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2022-07-12 16:54:05,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2022-07-12 16:54:05,719 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_existancelock_of_hiddev [2022-07-12 16:54:05,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_existancelock_of_hiddev [2022-07-12 16:54:05,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-12 16:54:05,720 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-12 16:54:05,720 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-12 16:54:05,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-12 16:54:05,720 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_interrupt_context [2022-07-12 16:54:05,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_interrupt_context [2022-07-12 16:54:05,720 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-12 16:54:05,720 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-12 16:54:05,720 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-12 16:54:05,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-12 16:54:05,721 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_timer_instance_callback_3_2 [2022-07-12 16:54:05,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_timer_instance_callback_3_2 [2022-07-12 16:54:05,721 INFO L130 BoogieDeclarations]: Found specification of procedure vfree [2022-07-12 16:54:05,721 INFO L138 BoogieDeclarations]: Found implementation of procedure vfree [2022-07-12 16:54:05,721 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2022-07-12 16:54:05,721 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2022-07-12 16:54:05,721 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-12 16:54:05,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-12 16:54:05,721 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_parse [2022-07-12 16:54:05,721 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_parse [2022-07-12 16:54:05,721 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_put_interface_async [2022-07-12 16:54:05,722 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_put_interface_async [2022-07-12 16:54:05,722 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_wait_io [2022-07-12 16:54:05,722 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_wait_io [2022-07-12 16:54:05,722 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_put_power [2022-07-12 16:54:05,722 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_put_power [2022-07-12 16:54:05,722 INFO L130 BoogieDeclarations]: Found specification of procedure pidff_check_autocenter [2022-07-12 16:54:05,722 INFO L138 BoogieDeclarations]: Found implementation of procedure pidff_check_autocenter [2022-07-12 16:54:05,722 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-12 16:54:05,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-12 16:54:05,722 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mod_timer_99 [2022-07-12 16:54:05,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mod_timer_99 [2022-07-12 16:54:05,723 INFO L130 BoogieDeclarations]: Found specification of procedure pidff_find_special_keys [2022-07-12 16:54:05,723 INFO L138 BoogieDeclarations]: Found implementation of procedure pidff_find_special_keys [2022-07-12 16:54:05,723 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-12 16:54:05,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-12 16:54:05,723 INFO L130 BoogieDeclarations]: Found specification of procedure down_write [2022-07-12 16:54:05,723 INFO L138 BoogieDeclarations]: Found implementation of procedure down_write [2022-07-12 16:54:05,723 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2022-07-12 16:54:05,723 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2022-07-12 16:54:05,723 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2022-07-12 16:54:05,723 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2022-07-12 16:54:05,724 INFO L130 BoogieDeclarations]: Found specification of procedure hid_hw_request [2022-07-12 16:54:05,724 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_hw_request [2022-07-12 16:54:05,724 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2022-07-12 16:54:05,724 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2022-07-12 16:54:05,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-12 16:54:05,724 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 16:54:05,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 16:54:05,724 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-12 16:54:05,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-12 16:54:05,724 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_put_interface_no_suspend [2022-07-12 16:54:05,725 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_put_interface_no_suspend [2022-07-12 16:54:05,725 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_get_interface_no_resume [2022-07-12 16:54:05,725 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_get_interface_no_resume [2022-07-12 16:54:05,725 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_disconnect [2022-07-12 16:54:05,725 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_disconnect [2022-07-12 16:54:05,725 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unlink_urb [2022-07-12 16:54:05,725 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unlink_urb [2022-07-12 16:54:05,725 INFO L130 BoogieDeclarations]: Found specification of procedure hid_destroy_device [2022-07-12 16:54:05,725 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_destroy_device [2022-07-12 16:54:05,725 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_usb_free_coherent [2022-07-12 16:54:05,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_usb_free_coherent [2022-07-12 16:54:05,726 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_open [2022-07-12 16:54:05,726 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_open [2022-07-12 16:54:05,726 INFO L130 BoogieDeclarations]: Found specification of procedure up_write [2022-07-12 16:54:05,726 INFO L138 BoogieDeclarations]: Found implementation of procedure up_write [2022-07-12 16:54:05,726 INFO L130 BoogieDeclarations]: Found specification of procedure pidff_rescale [2022-07-12 16:54:05,726 INFO L138 BoogieDeclarations]: Found implementation of procedure pidff_rescale [2022-07-12 16:54:05,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 16:54:05,726 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-12 16:54:05,726 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-12 16:54:05,726 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-12 16:54:05,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-12 16:54:05,727 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_close [2022-07-12 16:54:05,727 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_close [2022-07-12 16:54:05,727 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-12 16:54:05,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-12 16:54:05,727 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dispatch_instance_register_7_2 [2022-07-12 16:54:05,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dispatch_instance_register_7_2 [2022-07-12 16:54:05,727 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-12 16:54:05,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-12 16:54:05,727 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_get_interface_async [2022-07-12 16:54:05,727 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_get_interface_async [2022-07-12 16:54:05,728 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-12 16:54:05,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-12 16:54:05,728 INFO L130 BoogieDeclarations]: Found specification of procedure pidff_find_fields [2022-07-12 16:54:05,728 INFO L138 BoogieDeclarations]: Found implementation of procedure pidff_find_fields [2022-07-12 16:54:05,728 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-12 16:54:05,728 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-12 16:54:05,728 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_quirks_exit [2022-07-12 16:54:05,728 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_quirks_exit [2022-07-12 16:54:05,728 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-12 16:54:05,728 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-12 16:54:05,728 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_restart_queues [2022-07-12 16:54:05,729 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_restart_queues [2022-07-12 16:54:05,729 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-12 16:54:05,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-12 16:54:05,729 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_int_urb [2022-07-12 16:54:05,729 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_int_urb [2022-07-12 16:54:05,729 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-12 16:54:05,729 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-12 16:54:05,729 INFO L130 BoogieDeclarations]: Found specification of procedure hid_device_io_stop [2022-07-12 16:54:05,729 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_device_io_stop [2022-07-12 16:54:05,729 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-12 16:54:05,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-12 16:54:05,730 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_start [2022-07-12 16:54:05,730 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_start [2022-07-12 16:54:05,730 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-12 16:54:05,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-12 16:54:05,730 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2022-07-12 16:54:05,730 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2022-07-12 16:54:05,730 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2022-07-12 16:54:05,730 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2022-07-12 16:54:05,730 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_list_lock_of_hiddev [2022-07-12 16:54:05,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_list_lock_of_hiddev [2022-07-12 16:54:05,731 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-12 16:54:05,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-12 16:54:05,731 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_work [2022-07-12 16:54:05,731 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_work [2022-07-12 16:54:05,731 INFO L130 BoogieDeclarations]: Found specification of procedure hid_pre_reset [2022-07-12 16:54:05,731 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_pre_reset [2022-07-12 16:54:05,731 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-12 16:54:05,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-12 16:54:05,731 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_list_lock_of_hiddev [2022-07-12 16:54:05,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_list_lock_of_hiddev [2022-07-12 16:54:05,732 INFO L130 BoogieDeclarations]: Found specification of procedure msecs_to_jiffies [2022-07-12 16:54:05,732 INFO L138 BoogieDeclarations]: Found implementation of procedure msecs_to_jiffies [2022-07-12 16:54:05,732 INFO L130 BoogieDeclarations]: Found specification of procedure hid_post_reset [2022-07-12 16:54:05,732 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_post_reset [2022-07-12 16:54:05,732 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_get_power [2022-07-12 16:54:05,732 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_get_power [2022-07-12 16:54:05,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 16:54:05,732 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_irq_119 [2022-07-12 16:54:05,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_irq_119 [2022-07-12 16:54:06,733 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 16:54:06,736 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 16:54:06,982 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 16:54:18,744 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 16:54:18,759 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 16:54:18,760 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-12 16:54:18,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 04:54:18 BoogieIcfgContainer [2022-07-12 16:54:18,765 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 16:54:18,766 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 16:54:18,766 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 16:54:18,781 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 16:54:18,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 04:53:59" (1/3) ... [2022-07-12 16:54:18,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35e800c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 04:54:18, skipping insertion in model container [2022-07-12 16:54:18,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:54:04" (2/3) ... [2022-07-12 16:54:18,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35e800c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 04:54:18, skipping insertion in model container [2022-07-12 16:54:18,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 04:54:18" (3/3) ... [2022-07-12 16:54:18,783 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i [2022-07-12 16:54:18,793 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 16:54:18,793 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 33 error locations. [2022-07-12 16:54:18,890 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 16:54:18,896 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@2e054d0a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4a6c30fa [2022-07-12 16:54:18,896 INFO L358 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2022-07-12 16:54:18,907 INFO L276 IsEmpty]: Start isEmpty. Operand has 3037 states, 2051 states have (on average 1.3310580204778157) internal successors, (2730), 2143 states have internal predecessors, (2730), 768 states have call successors, (768), 186 states have call predecessors, (768), 185 states have return successors, (762), 755 states have call predecessors, (762), 762 states have call successors, (762) [2022-07-12 16:54:18,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 16:54:18,913 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:54:18,914 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 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-12 16:54:18,914 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-12 16:54:18,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:54:18,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1407426503, now seen corresponding path program 1 times [2022-07-12 16:54:18,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:54:18,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3351700] [2022-07-12 16:54:18,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:54:18,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:54:19,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:19,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:54:19,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:19,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 16:54:19,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:19,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 16:54:19,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:54:19,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3351700] [2022-07-12 16:54:19,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3351700] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:54:19,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:54:19,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:54:19,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180114957] [2022-07-12 16:54:19,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:54:19,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:54:19,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:54:19,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:54:19,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:54:19,609 INFO L87 Difference]: Start difference. First operand has 3037 states, 2051 states have (on average 1.3310580204778157) internal successors, (2730), 2143 states have internal predecessors, (2730), 768 states have call successors, (768), 186 states have call predecessors, (768), 185 states have return successors, (762), 755 states have call predecessors, (762), 762 states have call successors, (762) Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 16:54:22,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:54:22,275 INFO L93 Difference]: Finished difference Result 6251 states and 8986 transitions. [2022-07-12 16:54:22,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:54:22,277 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-07-12 16:54:22,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:54:22,301 INFO L225 Difference]: With dead ends: 6251 [2022-07-12 16:54:22,301 INFO L226 Difference]: Without dead ends: 3209 [2022-07-12 16:54:22,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-12 16:54:22,321 INFO L413 NwaCegarLoop]: 4226 mSDtfsCounter, 4134 mSDsluCounter, 11398 mSDsCounter, 0 mSdLazyCounter, 1542 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4143 SdHoareTripleChecker+Valid, 15624 SdHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-12 16:54:22,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4143 Valid, 15624 Invalid, 1544 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2 Valid, 1542 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-12 16:54:22,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3209 states. [2022-07-12 16:54:22,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3209 to 3189. [2022-07-12 16:54:22,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3189 states, 2146 states have (on average 1.2912395153774465) internal successors, (2771), 2237 states have internal predecessors, (2771), 799 states have call successors, (799), 214 states have call predecessors, (799), 211 states have return successors, (800), 786 states have call predecessors, (800), 797 states have call successors, (800) [2022-07-12 16:54:22,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3189 states to 3189 states and 4370 transitions. [2022-07-12 16:54:22,501 INFO L78 Accepts]: Start accepts. Automaton has 3189 states and 4370 transitions. Word has length 30 [2022-07-12 16:54:22,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:54:22,502 INFO L495 AbstractCegarLoop]: Abstraction has 3189 states and 4370 transitions. [2022-07-12 16:54:22,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 16:54:22,502 INFO L276 IsEmpty]: Start isEmpty. Operand 3189 states and 4370 transitions. [2022-07-12 16:54:22,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 16:54:22,505 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:54:22,505 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 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-12 16:54:22,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 16:54:22,505 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-12 16:54:22,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:54:22,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1407486085, now seen corresponding path program 1 times [2022-07-12 16:54:22,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:54:22,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754217936] [2022-07-12 16:54:22,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:54:22,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:54:22,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:22,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:54:22,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:22,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 16:54:22,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:22,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 16:54:22,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:54:22,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754217936] [2022-07-12 16:54:22,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754217936] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:54:22,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:54:22,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 16:54:22,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306870675] [2022-07-12 16:54:22,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:54:22,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 16:54:22,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:54:22,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 16:54:22,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 16:54:22,776 INFO L87 Difference]: Start difference. First operand 3189 states and 4370 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 16:54:22,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:54:22,862 INFO L93 Difference]: Finished difference Result 3196 states and 4377 transitions. [2022-07-12 16:54:22,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 16:54:22,863 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-07-12 16:54:22,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:54:22,880 INFO L225 Difference]: With dead ends: 3196 [2022-07-12 16:54:22,881 INFO L226 Difference]: Without dead ends: 3194 [2022-07-12 16:54:22,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 16:54:22,884 INFO L413 NwaCegarLoop]: 4152 mSDtfsCounter, 9 mSDsluCounter, 8299 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 12451 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 16:54:22,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 12451 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 16:54:22,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3194 states. [2022-07-12 16:54:22,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3194 to 3191. [2022-07-12 16:54:22,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3191 states, 2148 states have (on average 1.2905027932960893) internal successors, (2772), 2239 states have internal predecessors, (2772), 799 states have call successors, (799), 214 states have call predecessors, (799), 211 states have return successors, (800), 786 states have call predecessors, (800), 797 states have call successors, (800) [2022-07-12 16:54:22,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3191 states to 3191 states and 4371 transitions. [2022-07-12 16:54:22,978 INFO L78 Accepts]: Start accepts. Automaton has 3191 states and 4371 transitions. Word has length 30 [2022-07-12 16:54:22,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:54:22,978 INFO L495 AbstractCegarLoop]: Abstraction has 3191 states and 4371 transitions. [2022-07-12 16:54:22,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 16:54:22,978 INFO L276 IsEmpty]: Start isEmpty. Operand 3191 states and 4371 transitions. [2022-07-12 16:54:22,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 16:54:22,979 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:54:22,980 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 16:54:22,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 16:54:22,980 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-12 16:54:22,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:54:22,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1476967390, now seen corresponding path program 1 times [2022-07-12 16:54:22,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:54:22,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988696486] [2022-07-12 16:54:22,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:54:22,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:54:23,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:23,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:54:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:23,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 16:54:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:23,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:54:23,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:23,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 16:54:23,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:54:23,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988696486] [2022-07-12 16:54:23,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988696486] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:54:23,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:54:23,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 16:54:23,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365834012] [2022-07-12 16:54:23,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:54:23,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 16:54:23,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:54:23,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 16:54:23,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 16:54:23,239 INFO L87 Difference]: Start difference. First operand 3191 states and 4371 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 16:54:23,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:54:23,355 INFO L93 Difference]: Finished difference Result 6371 states and 8827 transitions. [2022-07-12 16:54:23,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 16:54:23,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2022-07-12 16:54:23,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:54:23,373 INFO L225 Difference]: With dead ends: 6371 [2022-07-12 16:54:23,373 INFO L226 Difference]: Without dead ends: 3185 [2022-07-12 16:54:23,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 16:54:23,390 INFO L413 NwaCegarLoop]: 4147 mSDtfsCounter, 4131 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4131 SdHoareTripleChecker+Valid, 4147 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 16:54:23,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4131 Valid, 4147 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 16:54:23,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3185 states. [2022-07-12 16:54:23,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3185 to 3185. [2022-07-12 16:54:23,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3185 states, 2143 states have (on average 1.2893140457302847) internal successors, (2763), 2233 states have internal predecessors, (2763), 799 states have call successors, (799), 214 states have call predecessors, (799), 211 states have return successors, (800), 786 states have call predecessors, (800), 797 states have call successors, (800) [2022-07-12 16:54:23,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3185 states to 3185 states and 4362 transitions. [2022-07-12 16:54:23,504 INFO L78 Accepts]: Start accepts. Automaton has 3185 states and 4362 transitions. Word has length 37 [2022-07-12 16:54:23,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:54:23,505 INFO L495 AbstractCegarLoop]: Abstraction has 3185 states and 4362 transitions. [2022-07-12 16:54:23,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 16:54:23,505 INFO L276 IsEmpty]: Start isEmpty. Operand 3185 states and 4362 transitions. [2022-07-12 16:54:23,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-12 16:54:23,512 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:54:23,513 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 16:54:23,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 16:54:23,513 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-12 16:54:23,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:54:23,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1976461436, now seen corresponding path program 1 times [2022-07-12 16:54:23,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:54:23,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609498135] [2022-07-12 16:54:23,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:54:23,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:54:23,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:23,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:54:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:23,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:54:23,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:23,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 16:54:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:23,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 16:54:23,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:23,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:54:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:23,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 16:54:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:23,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 16:54:23,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:23,776 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 16:54:23,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:54:23,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609498135] [2022-07-12 16:54:23,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609498135] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:54:23,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:54:23,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:54:23,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303381236] [2022-07-12 16:54:23,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:54:23,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:54:23,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:54:23,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:54:23,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:54:23,778 INFO L87 Difference]: Start difference. First operand 3185 states and 4362 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-12 16:54:29,210 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 16:54:30,237 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 16:54:35,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:54:35,068 INFO L93 Difference]: Finished difference Result 6479 states and 8906 transitions. [2022-07-12 16:54:35,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:54:35,069 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 55 [2022-07-12 16:54:35,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:54:35,088 INFO L225 Difference]: With dead ends: 6479 [2022-07-12 16:54:35,088 INFO L226 Difference]: Without dead ends: 3619 [2022-07-12 16:54:35,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-12 16:54:35,101 INFO L413 NwaCegarLoop]: 3823 mSDtfsCounter, 5469 mSDsluCounter, 2111 mSDsCounter, 0 mSdLazyCounter, 7805 mSolverCounterSat, 3285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5619 SdHoareTripleChecker+Valid, 5934 SdHoareTripleChecker+Invalid, 11090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3285 IncrementalHoareTripleChecker+Valid, 7805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2022-07-12 16:54:35,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5619 Valid, 5934 Invalid, 11090 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3285 Valid, 7805 Invalid, 0 Unknown, 0 Unchecked, 10.9s Time] [2022-07-12 16:54:35,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3619 states. [2022-07-12 16:54:35,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3619 to 3185. [2022-07-12 16:54:35,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3185 states, 2143 states have (on average 1.2888474101726553) internal successors, (2762), 2232 states have internal predecessors, (2762), 799 states have call successors, (799), 214 states have call predecessors, (799), 211 states have return successors, (800), 786 states have call predecessors, (800), 797 states have call successors, (800) [2022-07-12 16:54:35,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3185 states to 3185 states and 4361 transitions. [2022-07-12 16:54:35,227 INFO L78 Accepts]: Start accepts. Automaton has 3185 states and 4361 transitions. Word has length 55 [2022-07-12 16:54:35,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:54:35,228 INFO L495 AbstractCegarLoop]: Abstraction has 3185 states and 4361 transitions. [2022-07-12 16:54:35,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-12 16:54:35,229 INFO L276 IsEmpty]: Start isEmpty. Operand 3185 states and 4361 transitions. [2022-07-12 16:54:35,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-12 16:54:35,230 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:54:35,231 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:54:35,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 16:54:35,231 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-12 16:54:35,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:54:35,232 INFO L85 PathProgramCache]: Analyzing trace with hash 162297118, now seen corresponding path program 1 times [2022-07-12 16:54:35,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:54:35,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191480099] [2022-07-12 16:54:35,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:54:35,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:54:35,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:35,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:54:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:35,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 16:54:35,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:35,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 16:54:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:35,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 16:54:35,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:35,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 16:54:35,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:35,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 16:54:35,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:35,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:54:35,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:35,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:54:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:35,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:54:35,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:35,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:54:35,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:35,646 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:54:35,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:54:35,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191480099] [2022-07-12 16:54:35,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191480099] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:54:35,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:54:35,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:54:35,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971337] [2022-07-12 16:54:35,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:54:35,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:54:35,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:54:35,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:54:35,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:54:35,648 INFO L87 Difference]: Start difference. First operand 3185 states and 4361 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 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-12 16:54:42,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:54:42,915 INFO L93 Difference]: Finished difference Result 3185 states and 4361 transitions. [2022-07-12 16:54:42,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:54:42,915 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 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 77 [2022-07-12 16:54:42,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:54:42,931 INFO L225 Difference]: With dead ends: 3185 [2022-07-12 16:54:42,931 INFO L226 Difference]: Without dead ends: 3183 [2022-07-12 16:54:42,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:54:42,934 INFO L413 NwaCegarLoop]: 3591 mSDtfsCounter, 6952 mSDsluCounter, 1870 mSDsCounter, 0 mSdLazyCounter, 4353 mSolverCounterSat, 3728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7147 SdHoareTripleChecker+Valid, 5461 SdHoareTripleChecker+Invalid, 8081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3728 IncrementalHoareTripleChecker+Valid, 4353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-07-12 16:54:42,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7147 Valid, 5461 Invalid, 8081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3728 Valid, 4353 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2022-07-12 16:54:42,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3183 states. [2022-07-12 16:54:43,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3183 to 3183. [2022-07-12 16:54:43,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3183 states, 2142 states have (on average 1.288515406162465) internal successors, (2760), 2230 states have internal predecessors, (2760), 799 states have call successors, (799), 214 states have call predecessors, (799), 211 states have return successors, (800), 786 states have call predecessors, (800), 797 states have call successors, (800) [2022-07-12 16:54:43,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 3183 states and 4359 transitions. [2022-07-12 16:54:43,039 INFO L78 Accepts]: Start accepts. Automaton has 3183 states and 4359 transitions. Word has length 77 [2022-07-12 16:54:43,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:54:43,039 INFO L495 AbstractCegarLoop]: Abstraction has 3183 states and 4359 transitions. [2022-07-12 16:54:43,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 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-12 16:54:43,040 INFO L276 IsEmpty]: Start isEmpty. Operand 3183 states and 4359 transitions. [2022-07-12 16:54:43,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-12 16:54:43,041 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:54:43,041 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:54:43,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 16:54:43,041 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-12 16:54:43,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:54:43,042 INFO L85 PathProgramCache]: Analyzing trace with hash -2088716267, now seen corresponding path program 1 times [2022-07-12 16:54:43,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:54:43,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126438885] [2022-07-12 16:54:43,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:54:43,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:54:43,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:43,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:54:43,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:43,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 16:54:43,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:43,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 16:54:43,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:43,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 16:54:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:43,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 16:54:43,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:43,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 16:54:43,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:43,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:54:43,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:43,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:54:43,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:43,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:54:43,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:43,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:54:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:43,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:54:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:43,383 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:54:43,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:54:43,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126438885] [2022-07-12 16:54:43,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126438885] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:54:43,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:54:43,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:54:43,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780548909] [2022-07-12 16:54:43,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:54:43,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:54:43,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:54:43,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:54:43,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:54:43,386 INFO L87 Difference]: Start difference. First operand 3183 states and 4359 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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-12 16:54:48,549 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 16:54:52,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:54:52,103 INFO L93 Difference]: Finished difference Result 3183 states and 4359 transitions. [2022-07-12 16:54:52,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:54:52,107 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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 83 [2022-07-12 16:54:52,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:54:52,118 INFO L225 Difference]: With dead ends: 3183 [2022-07-12 16:54:52,119 INFO L226 Difference]: Without dead ends: 3181 [2022-07-12 16:54:52,119 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-12 16:54:52,121 INFO L413 NwaCegarLoop]: 3589 mSDtfsCounter, 6946 mSDsluCounter, 1870 mSDsCounter, 0 mSdLazyCounter, 4350 mSolverCounterSat, 3728 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7140 SdHoareTripleChecker+Valid, 5459 SdHoareTripleChecker+Invalid, 8079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3728 IncrementalHoareTripleChecker+Valid, 4350 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-07-12 16:54:52,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7140 Valid, 5459 Invalid, 8079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3728 Valid, 4350 Invalid, 1 Unknown, 0 Unchecked, 8.5s Time] [2022-07-12 16:54:52,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3181 states. [2022-07-12 16:54:52,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3181 to 3181. [2022-07-12 16:54:52,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3181 states, 2141 states have (on average 1.288183092013078) internal successors, (2758), 2228 states have internal predecessors, (2758), 799 states have call successors, (799), 214 states have call predecessors, (799), 211 states have return successors, (800), 786 states have call predecessors, (800), 797 states have call successors, (800) [2022-07-12 16:54:52,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 4357 transitions. [2022-07-12 16:54:52,226 INFO L78 Accepts]: Start accepts. Automaton has 3181 states and 4357 transitions. Word has length 83 [2022-07-12 16:54:52,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:54:52,227 INFO L495 AbstractCegarLoop]: Abstraction has 3181 states and 4357 transitions. [2022-07-12 16:54:52,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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-12 16:54:52,227 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 4357 transitions. [2022-07-12 16:54:52,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-12 16:54:52,229 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:54:52,229 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:54:52,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 16:54:52,229 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-12 16:54:52,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:54:52,229 INFO L85 PathProgramCache]: Analyzing trace with hash 257795529, now seen corresponding path program 1 times [2022-07-12 16:54:52,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:54:52,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293000951] [2022-07-12 16:54:52,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:54:52,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:54:52,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:52,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:54:52,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:52,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 16:54:52,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:52,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 16:54:52,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:52,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 16:54:52,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:52,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 16:54:52,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:52,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 16:54:52,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:52,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:54:52,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:52,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:54:52,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:52,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:54:52,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:52,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:54:52,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:52,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:54:52,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:52,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 16:54:52,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:52,564 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:54:52,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:54:52,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293000951] [2022-07-12 16:54:52,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293000951] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:54:52,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:54:52,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:54:52,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285394262] [2022-07-12 16:54:52,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:54:52,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:54:52,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:54:52,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:54:52,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:54:52,566 INFO L87 Difference]: Start difference. First operand 3181 states and 4357 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 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-12 16:54:57,309 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 16:55:00,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:55:00,659 INFO L93 Difference]: Finished difference Result 3181 states and 4357 transitions. [2022-07-12 16:55:00,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:55:00,659 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 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 89 [2022-07-12 16:55:00,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:55:00,673 INFO L225 Difference]: With dead ends: 3181 [2022-07-12 16:55:00,673 INFO L226 Difference]: Without dead ends: 3179 [2022-07-12 16:55:00,675 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-12 16:55:00,675 INFO L413 NwaCegarLoop]: 3587 mSDtfsCounter, 6940 mSDsluCounter, 1870 mSDsCounter, 0 mSdLazyCounter, 4349 mSolverCounterSat, 3728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7133 SdHoareTripleChecker+Valid, 5457 SdHoareTripleChecker+Invalid, 8077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3728 IncrementalHoareTripleChecker+Valid, 4349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-07-12 16:55:00,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7133 Valid, 5457 Invalid, 8077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3728 Valid, 4349 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2022-07-12 16:55:00,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3179 states. [2022-07-12 16:55:00,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3179 to 3179. [2022-07-12 16:55:00,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3179 states, 2140 states have (on average 1.2878504672897195) internal successors, (2756), 2226 states have internal predecessors, (2756), 799 states have call successors, (799), 214 states have call predecessors, (799), 211 states have return successors, (800), 786 states have call predecessors, (800), 797 states have call successors, (800) [2022-07-12 16:55:00,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3179 states to 3179 states and 4355 transitions. [2022-07-12 16:55:00,771 INFO L78 Accepts]: Start accepts. Automaton has 3179 states and 4355 transitions. Word has length 89 [2022-07-12 16:55:00,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:55:00,772 INFO L495 AbstractCegarLoop]: Abstraction has 3179 states and 4355 transitions. [2022-07-12 16:55:00,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 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-12 16:55:00,772 INFO L276 IsEmpty]: Start isEmpty. Operand 3179 states and 4355 transitions. [2022-07-12 16:55:00,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-12 16:55:00,773 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:55:00,773 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:55:00,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 16:55:00,774 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-12 16:55:00,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:55:00,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1869749641, now seen corresponding path program 1 times [2022-07-12 16:55:00,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:55:00,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232666250] [2022-07-12 16:55:00,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:55:00,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:55:00,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:00,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:55:00,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:00,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 16:55:00,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:00,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 16:55:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:00,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 16:55:00,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:00,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 16:55:00,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:00,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 16:55:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:01,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:55:01,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:01,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:55:01,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:01,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:55:01,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:01,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:55:01,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:01,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:55:01,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:01,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 16:55:01,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:01,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 16:55:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:01,061 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:55:01,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:55:01,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232666250] [2022-07-12 16:55:01,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232666250] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:55:01,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:55:01,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:55:01,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656249896] [2022-07-12 16:55:01,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:55:01,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:55:01,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:55:01,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:55:01,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:55:01,063 INFO L87 Difference]: Start difference. First operand 3179 states and 4355 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 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-12 16:55:06,240 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 16:55:09,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:55:09,484 INFO L93 Difference]: Finished difference Result 3179 states and 4355 transitions. [2022-07-12 16:55:09,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:55:09,485 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 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 95 [2022-07-12 16:55:09,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:55:09,497 INFO L225 Difference]: With dead ends: 3179 [2022-07-12 16:55:09,497 INFO L226 Difference]: Without dead ends: 3177 [2022-07-12 16:55:09,499 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-12 16:55:09,499 INFO L413 NwaCegarLoop]: 3585 mSDtfsCounter, 6934 mSDsluCounter, 1870 mSDsCounter, 0 mSdLazyCounter, 4346 mSolverCounterSat, 3728 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7126 SdHoareTripleChecker+Valid, 5455 SdHoareTripleChecker+Invalid, 8075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3728 IncrementalHoareTripleChecker+Valid, 4346 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-07-12 16:55:09,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7126 Valid, 5455 Invalid, 8075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3728 Valid, 4346 Invalid, 1 Unknown, 0 Unchecked, 8.2s Time] [2022-07-12 16:55:09,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3177 states. [2022-07-12 16:55:09,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3177 to 3177. [2022-07-12 16:55:09,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3177 states, 2139 states have (on average 1.2875175315568022) internal successors, (2754), 2224 states have internal predecessors, (2754), 799 states have call successors, (799), 214 states have call predecessors, (799), 211 states have return successors, (800), 786 states have call predecessors, (800), 797 states have call successors, (800) [2022-07-12 16:55:09,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3177 states to 3177 states and 4353 transitions. [2022-07-12 16:55:09,594 INFO L78 Accepts]: Start accepts. Automaton has 3177 states and 4353 transitions. Word has length 95 [2022-07-12 16:55:09,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:55:09,594 INFO L495 AbstractCegarLoop]: Abstraction has 3177 states and 4353 transitions. [2022-07-12 16:55:09,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 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-12 16:55:09,594 INFO L276 IsEmpty]: Start isEmpty. Operand 3177 states and 4353 transitions. [2022-07-12 16:55:09,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-12 16:55:09,596 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:55:09,596 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:55:09,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 16:55:09,596 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-12 16:55:09,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:55:09,596 INFO L85 PathProgramCache]: Analyzing trace with hash 500393985, now seen corresponding path program 1 times [2022-07-12 16:55:09,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:55:09,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320859214] [2022-07-12 16:55:09,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:55:09,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:55:09,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:09,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:55:09,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:09,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 16:55:09,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:09,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 16:55:09,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:09,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 16:55:09,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:09,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 16:55:09,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:09,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 16:55:09,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:09,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:55:09,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:09,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:55:09,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:09,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:55:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:09,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:55:09,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:09,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:55:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:09,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 16:55:09,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:09,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 16:55:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:09,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 16:55:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:09,936 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:55:09,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:55:09,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320859214] [2022-07-12 16:55:09,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320859214] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:55:09,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:55:09,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:55:09,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315712799] [2022-07-12 16:55:09,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:55:09,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:55:09,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:55:09,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:55:09,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:55:09,938 INFO L87 Difference]: Start difference. First operand 3177 states and 4353 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 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-12 16:55:17,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:55:17,127 INFO L93 Difference]: Finished difference Result 3177 states and 4353 transitions. [2022-07-12 16:55:17,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:55:17,128 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 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 101 [2022-07-12 16:55:17,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:55:17,140 INFO L225 Difference]: With dead ends: 3177 [2022-07-12 16:55:17,140 INFO L226 Difference]: Without dead ends: 3175 [2022-07-12 16:55:17,142 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-12 16:55:17,142 INFO L413 NwaCegarLoop]: 3583 mSDtfsCounter, 6928 mSDsluCounter, 1870 mSDsCounter, 0 mSdLazyCounter, 4345 mSolverCounterSat, 3728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7119 SdHoareTripleChecker+Valid, 5453 SdHoareTripleChecker+Invalid, 8073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3728 IncrementalHoareTripleChecker+Valid, 4345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-07-12 16:55:17,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7119 Valid, 5453 Invalid, 8073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3728 Valid, 4345 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2022-07-12 16:55:17,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3175 states. [2022-07-12 16:55:17,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3175 to 3175. [2022-07-12 16:55:17,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3175 states, 2138 states have (on average 1.2871842843779233) internal successors, (2752), 2222 states have internal predecessors, (2752), 799 states have call successors, (799), 214 states have call predecessors, (799), 211 states have return successors, (800), 786 states have call predecessors, (800), 797 states have call successors, (800) [2022-07-12 16:55:17,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3175 states to 3175 states and 4351 transitions. [2022-07-12 16:55:17,236 INFO L78 Accepts]: Start accepts. Automaton has 3175 states and 4351 transitions. Word has length 101 [2022-07-12 16:55:17,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:55:17,236 INFO L495 AbstractCegarLoop]: Abstraction has 3175 states and 4351 transitions. [2022-07-12 16:55:17,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 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-12 16:55:17,237 INFO L276 IsEmpty]: Start isEmpty. Operand 3175 states and 4351 transitions. [2022-07-12 16:55:17,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-12 16:55:17,238 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:55:17,238 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:55:17,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 16:55:17,238 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-12 16:55:17,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:55:17,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1002834405, now seen corresponding path program 1 times [2022-07-12 16:55:17,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:55:17,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281836914] [2022-07-12 16:55:17,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:55:17,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:55:17,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:17,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:55:17,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:17,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 16:55:17,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:17,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 16:55:17,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:17,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 16:55:17,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:17,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 16:55:17,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:17,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 16:55:17,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:17,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:55:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:17,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:55:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:17,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:55:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:17,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:55:17,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:17,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:55:17,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:17,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 16:55:17,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:17,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 16:55:17,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:17,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 16:55:17,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:17,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 16:55:17,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:17,591 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:55:17,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:55:17,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281836914] [2022-07-12 16:55:17,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281836914] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:55:17,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:55:17,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:55:17,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860800383] [2022-07-12 16:55:17,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:55:17,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:55:17,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:55:17,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:55:17,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:55:17,593 INFO L87 Difference]: Start difference. First operand 3175 states and 4351 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 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-12 16:55:24,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:55:24,575 INFO L93 Difference]: Finished difference Result 3175 states and 4351 transitions. [2022-07-12 16:55:24,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:55:24,576 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 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 107 [2022-07-12 16:55:24,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:55:24,587 INFO L225 Difference]: With dead ends: 3175 [2022-07-12 16:55:24,587 INFO L226 Difference]: Without dead ends: 3173 [2022-07-12 16:55:24,589 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-12 16:55:24,590 INFO L413 NwaCegarLoop]: 3581 mSDtfsCounter, 6922 mSDsluCounter, 1870 mSDsCounter, 0 mSdLazyCounter, 4343 mSolverCounterSat, 3728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7112 SdHoareTripleChecker+Valid, 5451 SdHoareTripleChecker+Invalid, 8071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3728 IncrementalHoareTripleChecker+Valid, 4343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-07-12 16:55:24,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7112 Valid, 5451 Invalid, 8071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3728 Valid, 4343 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2022-07-12 16:55:24,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3173 states. [2022-07-12 16:55:24,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3173 to 3173. [2022-07-12 16:55:24,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3173 states, 2137 states have (on average 1.2868507253158634) internal successors, (2750), 2220 states have internal predecessors, (2750), 799 states have call successors, (799), 214 states have call predecessors, (799), 211 states have return successors, (800), 786 states have call predecessors, (800), 797 states have call successors, (800) [2022-07-12 16:55:24,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3173 states to 3173 states and 4349 transitions. [2022-07-12 16:55:24,690 INFO L78 Accepts]: Start accepts. Automaton has 3173 states and 4349 transitions. Word has length 107 [2022-07-12 16:55:24,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:55:24,690 INFO L495 AbstractCegarLoop]: Abstraction has 3173 states and 4349 transitions. [2022-07-12 16:55:24,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 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-12 16:55:24,690 INFO L276 IsEmpty]: Start isEmpty. Operand 3173 states and 4349 transitions. [2022-07-12 16:55:24,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-12 16:55:24,693 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:55:24,694 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:55:24,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 16:55:24,694 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_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-12 16:55:24,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:55:24,694 INFO L85 PathProgramCache]: Analyzing trace with hash -379953983, now seen corresponding path program 1 times [2022-07-12 16:55:24,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:55:24,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656880011] [2022-07-12 16:55:24,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:55:24,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:55:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:24,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:55:24,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:24,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 16:55:24,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:24,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 16:55:24,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:24,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 16:55:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:24,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 16:55:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:24,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 16:55:24,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:24,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:55:24,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:24,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:55:24,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:24,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:55:24,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:24,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:55:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:24,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:55:24,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:24,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 16:55:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:24,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 16:55:24,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:24,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 16:55:24,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:24,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 16:55:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:25,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 16:55:25,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:25,012 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:55:25,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:55:25,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656880011] [2022-07-12 16:55:25,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656880011] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:55:25,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:55:25,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:55:25,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827796487] [2022-07-12 16:55:25,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:55:25,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:55:25,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:55:25,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:55:25,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:55:25,013 INFO L87 Difference]: Start difference. First operand 3173 states and 4349 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (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-12 16:55:32,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:55:32,515 INFO L93 Difference]: Finished difference Result 3173 states and 4349 transitions. [2022-07-12 16:55:32,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:55:32,516 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (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 113 [2022-07-12 16:55:32,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:55:32,523 INFO L225 Difference]: With dead ends: 3173 [2022-07-12 16:55:32,524 INFO L226 Difference]: Without dead ends: 3171 [2022-07-12 16:55:32,524 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-12 16:55:32,525 INFO L413 NwaCegarLoop]: 3579 mSDtfsCounter, 6916 mSDsluCounter, 1870 mSDsCounter, 0 mSdLazyCounter, 4341 mSolverCounterSat, 3728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7105 SdHoareTripleChecker+Valid, 5449 SdHoareTripleChecker+Invalid, 8069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3728 IncrementalHoareTripleChecker+Valid, 4341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-07-12 16:55:32,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7105 Valid, 5449 Invalid, 8069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3728 Valid, 4341 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2022-07-12 16:55:32,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3171 states. [2022-07-12 16:55:32,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3171 to 3171. [2022-07-12 16:55:32,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3171 states, 2136 states have (on average 1.2865168539325842) internal successors, (2748), 2218 states have internal predecessors, (2748), 799 states have call successors, (799), 214 states have call predecessors, (799), 211 states have return successors, (800), 786 states have call predecessors, (800), 797 states have call successors, (800) [2022-07-12 16:55:32,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3171 states to 3171 states and 4347 transitions. [2022-07-12 16:55:32,616 INFO L78 Accepts]: Start accepts. Automaton has 3171 states and 4347 transitions. Word has length 113 [2022-07-12 16:55:32,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:55:32,616 INFO L495 AbstractCegarLoop]: Abstraction has 3171 states and 4347 transitions. [2022-07-12 16:55:32,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (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-12 16:55:32,616 INFO L276 IsEmpty]: Start isEmpty. Operand 3171 states and 4347 transitions. [2022-07-12 16:55:32,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-12 16:55:32,618 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:55:32,618 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:55:32,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 16:55:32,619 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-12 16:55:32,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:55:32,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1159146525, now seen corresponding path program 1 times [2022-07-12 16:55:32,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:55:32,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545510798] [2022-07-12 16:55:32,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:55:32,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:55:32,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:32,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:55:32,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:32,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 16:55:32,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:32,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 16:55:32,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:32,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 16:55:32,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:32,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 16:55:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:32,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 16:55:32,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:32,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:55:32,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:32,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:55:32,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:32,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:55:32,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:32,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:55:32,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:32,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:55:32,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:32,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 16:55:32,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:32,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 16:55:32,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:32,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 16:55:32,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:32,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 16:55:32,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:32,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 16:55:32,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:32,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 16:55:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:32,955 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:55:32,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:55:32,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545510798] [2022-07-12 16:55:32,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545510798] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:55:32,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:55:32,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:55:32,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845431664] [2022-07-12 16:55:32,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:55:32,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:55:32,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:55:32,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:55:32,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:55:32,957 INFO L87 Difference]: Start difference. First operand 3171 states and 4347 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (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-12 16:55:40,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:55:40,045 INFO L93 Difference]: Finished difference Result 3171 states and 4347 transitions. [2022-07-12 16:55:40,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:55:40,046 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (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 119 [2022-07-12 16:55:40,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:55:40,057 INFO L225 Difference]: With dead ends: 3171 [2022-07-12 16:55:40,057 INFO L226 Difference]: Without dead ends: 3169 [2022-07-12 16:55:40,059 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-12 16:55:40,060 INFO L413 NwaCegarLoop]: 3577 mSDtfsCounter, 6914 mSDsluCounter, 1870 mSDsCounter, 0 mSdLazyCounter, 4335 mSolverCounterSat, 3728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7102 SdHoareTripleChecker+Valid, 5447 SdHoareTripleChecker+Invalid, 8063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3728 IncrementalHoareTripleChecker+Valid, 4335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-07-12 16:55:40,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7102 Valid, 5447 Invalid, 8063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3728 Valid, 4335 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2022-07-12 16:55:40,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3169 states. [2022-07-12 16:55:40,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3169 to 3169. [2022-07-12 16:55:40,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3169 states, 2135 states have (on average 1.2861826697892271) internal successors, (2746), 2216 states have internal predecessors, (2746), 799 states have call successors, (799), 214 states have call predecessors, (799), 211 states have return successors, (800), 786 states have call predecessors, (800), 797 states have call successors, (800) [2022-07-12 16:55:40,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3169 states to 3169 states and 4345 transitions. [2022-07-12 16:55:40,164 INFO L78 Accepts]: Start accepts. Automaton has 3169 states and 4345 transitions. Word has length 119 [2022-07-12 16:55:40,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:55:40,165 INFO L495 AbstractCegarLoop]: Abstraction has 3169 states and 4345 transitions. [2022-07-12 16:55:40,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (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-12 16:55:40,165 INFO L276 IsEmpty]: Start isEmpty. Operand 3169 states and 4345 transitions. [2022-07-12 16:55:40,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-12 16:55:40,166 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:55:40,167 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:55:40,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 16:55:40,167 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-12 16:55:40,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:55:40,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1543506560, now seen corresponding path program 1 times [2022-07-12 16:55:40,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:55:40,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848656336] [2022-07-12 16:55:40,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:55:40,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:55:40,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:40,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:55:40,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:40,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 16:55:40,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:40,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 16:55:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:40,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 16:55:40,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:40,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 16:55:40,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:40,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 16:55:40,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:40,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:55:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:40,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:55:40,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:40,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:55:40,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:40,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:55:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:40,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:55:40,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:40,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 16:55:40,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:40,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 16:55:40,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:40,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 16:55:40,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:40,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 16:55:40,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:40,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 16:55:40,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:40,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 16:55:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:40,473 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:55:40,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:55:40,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848656336] [2022-07-12 16:55:40,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848656336] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:55:40,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:55:40,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:55:40,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297902880] [2022-07-12 16:55:40,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:55:40,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:55:40,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:55:40,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:55:40,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:55:40,474 INFO L87 Difference]: Start difference. First operand 3169 states and 4345 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 4 states have internal predecessors, (73), 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-12 16:55:45,750 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 16:55:48,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:55:48,932 INFO L93 Difference]: Finished difference Result 3169 states and 4345 transitions. [2022-07-12 16:55:48,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:55:48,932 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 4 states have internal predecessors, (73), 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 121 [2022-07-12 16:55:48,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:55:48,949 INFO L225 Difference]: With dead ends: 3169 [2022-07-12 16:55:48,949 INFO L226 Difference]: Without dead ends: 3167 [2022-07-12 16:55:48,950 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-12 16:55:48,954 INFO L413 NwaCegarLoop]: 3575 mSDtfsCounter, 6902 mSDsluCounter, 1870 mSDsCounter, 0 mSdLazyCounter, 4336 mSolverCounterSat, 3728 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7090 SdHoareTripleChecker+Valid, 5445 SdHoareTripleChecker+Invalid, 8065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3728 IncrementalHoareTripleChecker+Valid, 4336 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-07-12 16:55:48,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7090 Valid, 5445 Invalid, 8065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3728 Valid, 4336 Invalid, 1 Unknown, 0 Unchecked, 8.2s Time] [2022-07-12 16:55:48,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3167 states. [2022-07-12 16:55:49,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3167 to 3167. [2022-07-12 16:55:49,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3167 states, 2134 states have (on average 1.2858481724461106) internal successors, (2744), 2214 states have internal predecessors, (2744), 799 states have call successors, (799), 214 states have call predecessors, (799), 211 states have return successors, (800), 786 states have call predecessors, (800), 797 states have call successors, (800) [2022-07-12 16:55:49,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3167 states to 3167 states and 4343 transitions. [2022-07-12 16:55:49,060 INFO L78 Accepts]: Start accepts. Automaton has 3167 states and 4343 transitions. Word has length 121 [2022-07-12 16:55:49,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:55:49,061 INFO L495 AbstractCegarLoop]: Abstraction has 3167 states and 4343 transitions. [2022-07-12 16:55:49,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 4 states have internal predecessors, (73), 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-12 16:55:49,062 INFO L276 IsEmpty]: Start isEmpty. Operand 3167 states and 4343 transitions. [2022-07-12 16:55:49,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-12 16:55:49,063 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:55:49,063 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:55:49,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 16:55:49,064 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-12 16:55:49,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:55:49,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1479640238, now seen corresponding path program 1 times [2022-07-12 16:55:49,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:55:49,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722781676] [2022-07-12 16:55:49,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:55:49,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:55:49,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:49,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:55:49,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:49,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 16:55:49,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:49,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 16:55:49,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:49,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 16:55:49,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:49,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 16:55:49,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:49,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 16:55:49,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:49,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:55:49,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:49,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:55:49,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:49,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:55:49,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:49,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:55:49,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:49,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:55:49,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:49,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 16:55:49,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:49,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 16:55:49,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:49,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 16:55:49,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:49,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 16:55:49,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:49,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 16:55:49,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:49,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 16:55:49,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:49,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 16:55:49,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:49,382 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:55:49,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:55:49,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722781676] [2022-07-12 16:55:49,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722781676] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:55:49,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:55:49,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:55:49,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258843306] [2022-07-12 16:55:49,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:55:49,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:55:49,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:55:49,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:55:49,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:55:49,385 INFO L87 Difference]: Start difference. First operand 3167 states and 4343 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 4 states have internal predecessors, (77), 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-12 16:55:57,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:55:57,295 INFO L93 Difference]: Finished difference Result 3167 states and 4343 transitions. [2022-07-12 16:55:57,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:55:57,296 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 4 states have internal predecessors, (77), 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 127 [2022-07-12 16:55:57,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:55:57,306 INFO L225 Difference]: With dead ends: 3167 [2022-07-12 16:55:57,306 INFO L226 Difference]: Without dead ends: 3165 [2022-07-12 16:55:57,308 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-12 16:55:57,308 INFO L413 NwaCegarLoop]: 3573 mSDtfsCounter, 6898 mSDsluCounter, 1870 mSDsCounter, 0 mSdLazyCounter, 4335 mSolverCounterSat, 3728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7085 SdHoareTripleChecker+Valid, 5443 SdHoareTripleChecker+Invalid, 8063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3728 IncrementalHoareTripleChecker+Valid, 4335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-07-12 16:55:57,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7085 Valid, 5443 Invalid, 8063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3728 Valid, 4335 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2022-07-12 16:55:57,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3165 states. [2022-07-12 16:55:57,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3165 to 3165. [2022-07-12 16:55:57,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3165 states, 2133 states have (on average 1.2855133614627285) internal successors, (2742), 2212 states have internal predecessors, (2742), 799 states have call successors, (799), 214 states have call predecessors, (799), 211 states have return successors, (800), 786 states have call predecessors, (800), 797 states have call successors, (800) [2022-07-12 16:55:57,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3165 states to 3165 states and 4341 transitions. [2022-07-12 16:55:57,507 INFO L78 Accepts]: Start accepts. Automaton has 3165 states and 4341 transitions. Word has length 127 [2022-07-12 16:55:57,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:55:57,507 INFO L495 AbstractCegarLoop]: Abstraction has 3165 states and 4341 transitions. [2022-07-12 16:55:57,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 4 states have internal predecessors, (77), 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-12 16:55:57,508 INFO L276 IsEmpty]: Start isEmpty. Operand 3165 states and 4341 transitions. [2022-07-12 16:55:57,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-12 16:55:57,509 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:55:57,509 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:55:57,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 16:55:57,509 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-12 16:55:57,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:55:57,509 INFO L85 PathProgramCache]: Analyzing trace with hash -762027428, now seen corresponding path program 1 times [2022-07-12 16:55:57,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:55:57,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252243752] [2022-07-12 16:55:57,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:55:57,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:55:57,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:57,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:55:57,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:57,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 16:55:57,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:57,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 16:55:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:57,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 16:55:57,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:57,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 16:55:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:57,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:55:57,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:57,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:55:57,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:57,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:55:57,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:57,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 16:55:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:57,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:55:57,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:57,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:55:57,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:57,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:55:57,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:57,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 16:55:57,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:57,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:55:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:57,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:55:57,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:57,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:55:57,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:57,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 16:55:57,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:57,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:55:57,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:57,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:55:57,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:57,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:55:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:57,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 16:55:57,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:57,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:55:57,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:57,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:55:57,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:57,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:55:57,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:57,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 16:55:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:57,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-12 16:55:57,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:57,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 16:55:57,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:57,881 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-07-12 16:55:57,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:55:57,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252243752] [2022-07-12 16:55:57,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252243752] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:55:57,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:55:57,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:55:57,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519075274] [2022-07-12 16:55:57,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:55:57,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:55:57,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:55:57,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:55:57,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:55:57,882 INFO L87 Difference]: Start difference. First operand 3165 states and 4341 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 16:56:03,213 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 16:56:07,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:56:07,061 INFO L93 Difference]: Finished difference Result 6376 states and 8793 transitions. [2022-07-12 16:56:07,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 16:56:07,061 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 168 [2022-07-12 16:56:07,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:56:07,074 INFO L225 Difference]: With dead ends: 6376 [2022-07-12 16:56:07,074 INFO L226 Difference]: Without dead ends: 3371 [2022-07-12 16:56:07,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 55 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-12 16:56:07,084 INFO L413 NwaCegarLoop]: 3375 mSDtfsCounter, 8239 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 3167 mSolverCounterSat, 5240 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8452 SdHoareTripleChecker+Valid, 4999 SdHoareTripleChecker+Invalid, 8408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5240 IncrementalHoareTripleChecker+Valid, 3167 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2022-07-12 16:56:07,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8452 Valid, 4999 Invalid, 8408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5240 Valid, 3167 Invalid, 1 Unknown, 0 Unchecked, 8.9s Time] [2022-07-12 16:56:07,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3371 states. [2022-07-12 16:56:07,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3371 to 3170. [2022-07-12 16:56:07,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3170 states, 2135 states have (on average 1.2843091334894614) internal successors, (2742), 2214 states have internal predecessors, (2742), 800 states have call successors, (800), 214 states have call predecessors, (800), 214 states have return successors, (806), 789 states have call predecessors, (806), 798 states have call successors, (806) [2022-07-12 16:56:07,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3170 states to 3170 states and 4348 transitions. [2022-07-12 16:56:07,206 INFO L78 Accepts]: Start accepts. Automaton has 3170 states and 4348 transitions. Word has length 168 [2022-07-12 16:56:07,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:56:07,207 INFO L495 AbstractCegarLoop]: Abstraction has 3170 states and 4348 transitions. [2022-07-12 16:56:07,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 16:56:07,207 INFO L276 IsEmpty]: Start isEmpty. Operand 3170 states and 4348 transitions. [2022-07-12 16:56:07,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-12 16:56:07,208 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:56:07,208 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:56:07,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 16:56:07,208 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-12 16:56:07,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:56:07,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1769654094, now seen corresponding path program 1 times [2022-07-12 16:56:07,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:56:07,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311742284] [2022-07-12 16:56:07,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:56:07,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:56:07,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:07,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:56:07,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:07,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 16:56:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:07,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 16:56:07,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:07,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 16:56:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:07,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 16:56:07,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:07,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 16:56:07,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:07,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:56:07,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:07,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:07,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:07,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:56:07,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:07,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:56:07,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:07,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:56:07,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:07,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 16:56:07,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:07,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 16:56:07,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:07,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 16:56:07,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:07,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 16:56:07,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:07,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 16:56:07,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:07,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 16:56:07,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:07,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 16:56:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:07,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 16:56:07,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:07,547 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:56:07,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:56:07,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311742284] [2022-07-12 16:56:07,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311742284] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:56:07,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:56:07,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:56:07,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164028157] [2022-07-12 16:56:07,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:56:07,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:56:07,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:56:07,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:56:07,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:56:07,551 INFO L87 Difference]: Start difference. First operand 3170 states and 4348 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 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-12 16:56:14,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:56:14,920 INFO L93 Difference]: Finished difference Result 3170 states and 4348 transitions. [2022-07-12 16:56:14,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:56:14,921 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 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 133 [2022-07-12 16:56:14,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:56:14,930 INFO L225 Difference]: With dead ends: 3170 [2022-07-12 16:56:14,930 INFO L226 Difference]: Without dead ends: 3168 [2022-07-12 16:56:14,932 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-12 16:56:14,932 INFO L413 NwaCegarLoop]: 3566 mSDtfsCounter, 6887 mSDsluCounter, 1856 mSDsCounter, 0 mSdLazyCounter, 4332 mSolverCounterSat, 3728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7073 SdHoareTripleChecker+Valid, 5422 SdHoareTripleChecker+Invalid, 8060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3728 IncrementalHoareTripleChecker+Valid, 4332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-07-12 16:56:14,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7073 Valid, 5422 Invalid, 8060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3728 Valid, 4332 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2022-07-12 16:56:14,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3168 states. [2022-07-12 16:56:15,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3168 to 3168. [2022-07-12 16:56:15,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3168 states, 2134 states have (on average 1.2839737582005624) internal successors, (2740), 2212 states have internal predecessors, (2740), 800 states have call successors, (800), 214 states have call predecessors, (800), 214 states have return successors, (806), 789 states have call predecessors, (806), 798 states have call successors, (806) [2022-07-12 16:56:15,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3168 states to 3168 states and 4346 transitions. [2022-07-12 16:56:15,038 INFO L78 Accepts]: Start accepts. Automaton has 3168 states and 4346 transitions. Word has length 133 [2022-07-12 16:56:15,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:56:15,038 INFO L495 AbstractCegarLoop]: Abstraction has 3168 states and 4346 transitions. [2022-07-12 16:56:15,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 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-12 16:56:15,039 INFO L276 IsEmpty]: Start isEmpty. Operand 3168 states and 4346 transitions. [2022-07-12 16:56:15,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-07-12 16:56:15,040 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:56:15,040 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:56:15,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 16:56:15,040 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-12 16:56:15,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:56:15,041 INFO L85 PathProgramCache]: Analyzing trace with hash -65475925, now seen corresponding path program 1 times [2022-07-12 16:56:15,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:56:15,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698364126] [2022-07-12 16:56:15,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:56:15,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:56:15,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:15,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:56:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:15,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 16:56:15,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:15,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 16:56:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:15,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 16:56:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:15,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 16:56:15,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:15,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:15,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:15,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:56:15,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:15,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:56:15,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:15,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 16:56:15,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:15,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:15,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:56:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:15,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:56:15,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:15,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 16:56:15,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:15,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:15,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:56:15,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:15,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:56:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:15,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 16:56:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:15,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:15,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:56:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:15,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:56:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:15,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 16:56:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:15,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:15,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:56:15,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:15,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:56:15,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:15,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 16:56:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:15,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-12 16:56:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:15,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 16:56:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:15,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-12 16:56:15,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:15,514 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2022-07-12 16:56:15,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:56:15,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698364126] [2022-07-12 16:56:15,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698364126] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 16:56:15,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292424239] [2022-07-12 16:56:15,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:56:15,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 16:56:15,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 16:56:15,517 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-12 16:56:15,527 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-12 16:56:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:16,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 4430 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 16:56:16,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 16:56:16,820 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-07-12 16:56:16,820 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 16:56:16,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292424239] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:56:16,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 16:56:16,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-07-12 16:56:16,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783125034] [2022-07-12 16:56:16,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:56:16,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 16:56:16,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:56:16,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 16:56:16,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:56:16,822 INFO L87 Difference]: Start difference. First operand 3168 states and 4346 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 16:56:16,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:56:16,994 INFO L93 Difference]: Finished difference Result 6251 states and 8554 transitions. [2022-07-12 16:56:16,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 16:56:16,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 174 [2022-07-12 16:56:16,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:56:17,005 INFO L225 Difference]: With dead ends: 6251 [2022-07-12 16:56:17,005 INFO L226 Difference]: Without dead ends: 3246 [2022-07-12 16:56:17,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:56:17,015 INFO L413 NwaCegarLoop]: 4208 mSDtfsCounter, 4091 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4091 SdHoareTripleChecker+Valid, 4303 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 16:56:17,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4091 Valid, 4303 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 16:56:17,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3246 states. [2022-07-12 16:56:17,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3246 to 3243. [2022-07-12 16:56:17,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3243 states, 2179 states have (on average 1.2794860027535566) internal successors, (2788), 2260 states have internal predecessors, (2788), 820 states have call successors, (820), 225 states have call predecessors, (820), 225 states have return successors, (826), 807 states have call predecessors, (826), 818 states have call successors, (826) [2022-07-12 16:56:17,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3243 states to 3243 states and 4434 transitions. [2022-07-12 16:56:17,140 INFO L78 Accepts]: Start accepts. Automaton has 3243 states and 4434 transitions. Word has length 174 [2022-07-12 16:56:17,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:56:17,141 INFO L495 AbstractCegarLoop]: Abstraction has 3243 states and 4434 transitions. [2022-07-12 16:56:17,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 16:56:17,141 INFO L276 IsEmpty]: Start isEmpty. Operand 3243 states and 4434 transitions. [2022-07-12 16:56:17,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-12 16:56:17,143 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:56:17,143 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:56:17,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-12 16:56:17,368 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,SelfDestructingSolverStorable16 [2022-07-12 16:56:17,369 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-12 16:56:17,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:56:17,369 INFO L85 PathProgramCache]: Analyzing trace with hash 783970037, now seen corresponding path program 1 times [2022-07-12 16:56:17,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:56:17,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096753753] [2022-07-12 16:56:17,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:56:17,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:56:17,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:17,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:56:17,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:17,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 16:56:17,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:17,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 16:56:17,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:17,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 16:56:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:17,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 16:56:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:17,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 16:56:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:17,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:56:17,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:17,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:17,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:17,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:56:17,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:17,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:56:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:17,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:56:17,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:17,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 16:56:17,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:17,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 16:56:17,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:17,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 16:56:17,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:17,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 16:56:17,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:17,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 16:56:17,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:17,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 16:56:17,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:17,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 16:56:17,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:17,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 16:56:17,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:17,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 16:56:17,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:17,785 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:56:17,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:56:17,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096753753] [2022-07-12 16:56:17,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096753753] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:56:17,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:56:17,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:56:17,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152418967] [2022-07-12 16:56:17,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:56:17,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:56:17,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:56:17,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:56:17,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:56:17,787 INFO L87 Difference]: Start difference. First operand 3243 states and 4434 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 4 states have internal predecessors, (85), 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-12 16:56:22,062 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 16:56:25,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:56:25,770 INFO L93 Difference]: Finished difference Result 3243 states and 4434 transitions. [2022-07-12 16:56:25,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:56:25,771 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 4 states have internal predecessors, (85), 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 139 [2022-07-12 16:56:25,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:56:25,781 INFO L225 Difference]: With dead ends: 3243 [2022-07-12 16:56:25,782 INFO L226 Difference]: Without dead ends: 3241 [2022-07-12 16:56:25,784 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-12 16:56:25,784 INFO L413 NwaCegarLoop]: 3559 mSDtfsCounter, 6876 mSDsluCounter, 1842 mSDsCounter, 0 mSdLazyCounter, 4329 mSolverCounterSat, 3728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7061 SdHoareTripleChecker+Valid, 5401 SdHoareTripleChecker+Invalid, 8057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3728 IncrementalHoareTripleChecker+Valid, 4329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-07-12 16:56:25,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7061 Valid, 5401 Invalid, 8057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3728 Valid, 4329 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2022-07-12 16:56:25,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3241 states. [2022-07-12 16:56:25,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3241 to 3241. [2022-07-12 16:56:25,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3241 states, 2178 states have (on average 1.2791551882460974) internal successors, (2786), 2258 states have internal predecessors, (2786), 820 states have call successors, (820), 225 states have call predecessors, (820), 225 states have return successors, (826), 807 states have call predecessors, (826), 818 states have call successors, (826) [2022-07-12 16:56:25,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 4432 transitions. [2022-07-12 16:56:25,915 INFO L78 Accepts]: Start accepts. Automaton has 3241 states and 4432 transitions. Word has length 139 [2022-07-12 16:56:25,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:56:25,916 INFO L495 AbstractCegarLoop]: Abstraction has 3241 states and 4432 transitions. [2022-07-12 16:56:25,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 4 states have internal predecessors, (85), 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-12 16:56:25,917 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 4432 transitions. [2022-07-12 16:56:25,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-12 16:56:25,919 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:56:25,920 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:56:25,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 16:56:25,920 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-12 16:56:25,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:56:25,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1655545842, now seen corresponding path program 1 times [2022-07-12 16:56:25,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:56:25,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128306655] [2022-07-12 16:56:25,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:56:25,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:56:26,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:26,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:56:26,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:26,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 16:56:26,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:26,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 16:56:26,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:26,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 16:56:26,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:26,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 16:56:26,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:26,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 16:56:26,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:26,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:56:26,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:26,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:26,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:56:26,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:26,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:56:26,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:26,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:56:26,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:26,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 16:56:26,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:26,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 16:56:26,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:26,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 16:56:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:26,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 16:56:26,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:26,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 16:56:26,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:26,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 16:56:26,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:26,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 16:56:26,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:26,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 16:56:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:26,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 16:56:26,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:26,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 16:56:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:26,250 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:56:26,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:56:26,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128306655] [2022-07-12 16:56:26,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128306655] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:56:26,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:56:26,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:56:26,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269574844] [2022-07-12 16:56:26,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:56:26,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:56:26,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:56:26,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:56:26,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:56:26,254 INFO L87 Difference]: Start difference. First operand 3241 states and 4432 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 4 states have internal predecessors, (89), 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-12 16:56:31,826 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 16:56:35,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:56:35,475 INFO L93 Difference]: Finished difference Result 3241 states and 4432 transitions. [2022-07-12 16:56:35,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:56:35,482 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 4 states have internal predecessors, (89), 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 145 [2022-07-12 16:56:35,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:56:35,499 INFO L225 Difference]: With dead ends: 3241 [2022-07-12 16:56:35,500 INFO L226 Difference]: Without dead ends: 3239 [2022-07-12 16:56:35,501 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-12 16:56:35,502 INFO L413 NwaCegarLoop]: 3557 mSDtfsCounter, 6870 mSDsluCounter, 1842 mSDsCounter, 0 mSdLazyCounter, 4326 mSolverCounterSat, 3728 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7054 SdHoareTripleChecker+Valid, 5399 SdHoareTripleChecker+Invalid, 8055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3728 IncrementalHoareTripleChecker+Valid, 4326 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2022-07-12 16:56:35,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7054 Valid, 5399 Invalid, 8055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3728 Valid, 4326 Invalid, 1 Unknown, 0 Unchecked, 8.9s Time] [2022-07-12 16:56:35,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3239 states. [2022-07-12 16:56:35,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3239 to 3239. [2022-07-12 16:56:35,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3239 states, 2177 states have (on average 1.2788240698208544) internal successors, (2784), 2256 states have internal predecessors, (2784), 820 states have call successors, (820), 225 states have call predecessors, (820), 225 states have return successors, (826), 807 states have call predecessors, (826), 818 states have call successors, (826) [2022-07-12 16:56:35,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3239 states to 3239 states and 4430 transitions. [2022-07-12 16:56:35,628 INFO L78 Accepts]: Start accepts. Automaton has 3239 states and 4430 transitions. Word has length 145 [2022-07-12 16:56:35,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:56:35,628 INFO L495 AbstractCegarLoop]: Abstraction has 3239 states and 4430 transitions. [2022-07-12 16:56:35,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 4 states have internal predecessors, (89), 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-12 16:56:35,628 INFO L276 IsEmpty]: Start isEmpty. Operand 3239 states and 4430 transitions. [2022-07-12 16:56:35,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-12 16:56:35,630 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:56:35,630 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:56:35,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 16:56:35,631 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-12 16:56:35,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:56:35,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1166431932, now seen corresponding path program 1 times [2022-07-12 16:56:35,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:56:35,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250133542] [2022-07-12 16:56:35,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:56:35,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:56:35,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:35,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:56:35,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:35,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 16:56:35,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:35,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 16:56:35,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:35,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 16:56:35,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:35,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 16:56:35,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:35,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 16:56:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:35,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:56:35,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:35,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:35,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:35,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:56:35,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:35,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:56:35,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:35,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:56:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:35,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 16:56:35,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:35,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 16:56:35,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:35,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 16:56:35,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:35,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 16:56:35,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:35,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 16:56:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:35,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 16:56:35,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:35,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 16:56:35,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:35,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 16:56:35,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:35,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 16:56:35,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:35,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 16:56:35,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:35,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 16:56:35,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:35,940 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:56:35,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:56:35,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250133542] [2022-07-12 16:56:35,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250133542] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:56:35,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:56:35,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:56:35,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720649486] [2022-07-12 16:56:35,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:56:35,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:56:35,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:56:35,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:56:35,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:56:35,943 INFO L87 Difference]: Start difference. First operand 3239 states and 4430 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 4 states have internal predecessors, (93), 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-12 16:56:41,435 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 16:56:45,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:56:45,311 INFO L93 Difference]: Finished difference Result 3239 states and 4430 transitions. [2022-07-12 16:56:45,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:56:45,314 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 4 states have internal predecessors, (93), 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 151 [2022-07-12 16:56:45,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:56:45,324 INFO L225 Difference]: With dead ends: 3239 [2022-07-12 16:56:45,324 INFO L226 Difference]: Without dead ends: 3237 [2022-07-12 16:56:45,326 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-12 16:56:45,327 INFO L413 NwaCegarLoop]: 3555 mSDtfsCounter, 6864 mSDsluCounter, 1842 mSDsCounter, 0 mSdLazyCounter, 4324 mSolverCounterSat, 3728 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7047 SdHoareTripleChecker+Valid, 5397 SdHoareTripleChecker+Invalid, 8053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3728 IncrementalHoareTripleChecker+Valid, 4324 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2022-07-12 16:56:45,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7047 Valid, 5397 Invalid, 8053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3728 Valid, 4324 Invalid, 1 Unknown, 0 Unchecked, 9.0s Time] [2022-07-12 16:56:45,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3237 states. [2022-07-12 16:56:45,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3237 to 3237. [2022-07-12 16:56:45,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3237 states, 2176 states have (on average 1.2784926470588236) internal successors, (2782), 2254 states have internal predecessors, (2782), 820 states have call successors, (820), 225 states have call predecessors, (820), 225 states have return successors, (826), 807 states have call predecessors, (826), 818 states have call successors, (826) [2022-07-12 16:56:45,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3237 states to 3237 states and 4428 transitions. [2022-07-12 16:56:45,458 INFO L78 Accepts]: Start accepts. Automaton has 3237 states and 4428 transitions. Word has length 151 [2022-07-12 16:56:45,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:56:45,459 INFO L495 AbstractCegarLoop]: Abstraction has 3237 states and 4428 transitions. [2022-07-12 16:56:45,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 4 states have internal predecessors, (93), 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-12 16:56:45,459 INFO L276 IsEmpty]: Start isEmpty. Operand 3237 states and 4428 transitions. [2022-07-12 16:56:45,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-12 16:56:45,461 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:56:45,461 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:56:45,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-12 16:56:45,461 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-12 16:56:45,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:56:45,462 INFO L85 PathProgramCache]: Analyzing trace with hash 162647145, now seen corresponding path program 1 times [2022-07-12 16:56:45,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:56:45,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274286269] [2022-07-12 16:56:45,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:56:45,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:56:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:45,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:56:45,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:45,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 16:56:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:45,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 16:56:45,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:45,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 16:56:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:45,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 16:56:45,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:45,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 16:56:45,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:45,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:56:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:45,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:45,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:45,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:56:45,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:45,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:56:45,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:45,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:56:45,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:45,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 16:56:45,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:45,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 16:56:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:45,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 16:56:45,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:45,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 16:56:45,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:45,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 16:56:45,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:45,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 16:56:45,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:45,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 16:56:45,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:45,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 16:56:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:45,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 16:56:45,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:45,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 16:56:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:45,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 16:56:45,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:45,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 16:56:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:45,829 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:56:45,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:56:45,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274286269] [2022-07-12 16:56:45,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274286269] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:56:45,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:56:45,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:56:45,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747086248] [2022-07-12 16:56:45,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:56:45,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:56:45,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:56:45,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:56:45,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:56:45,834 INFO L87 Difference]: Start difference. First operand 3237 states and 4428 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 4 states have internal predecessors, (97), 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-12 16:56:51,148 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 16:56:54,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:56:54,826 INFO L93 Difference]: Finished difference Result 3237 states and 4428 transitions. [2022-07-12 16:56:54,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:56:54,827 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 4 states have internal predecessors, (97), 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 157 [2022-07-12 16:56:54,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:56:54,836 INFO L225 Difference]: With dead ends: 3237 [2022-07-12 16:56:54,836 INFO L226 Difference]: Without dead ends: 3235 [2022-07-12 16:56:54,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:56:54,838 INFO L413 NwaCegarLoop]: 3553 mSDtfsCounter, 6858 mSDsluCounter, 1842 mSDsCounter, 0 mSdLazyCounter, 4322 mSolverCounterSat, 3728 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7040 SdHoareTripleChecker+Valid, 5395 SdHoareTripleChecker+Invalid, 8051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3728 IncrementalHoareTripleChecker+Valid, 4322 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-07-12 16:56:54,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7040 Valid, 5395 Invalid, 8051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3728 Valid, 4322 Invalid, 1 Unknown, 0 Unchecked, 8.7s Time] [2022-07-12 16:56:54,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3235 states. [2022-07-12 16:56:54,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3235 to 3235. [2022-07-12 16:56:54,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3235 states, 2175 states have (on average 1.27816091954023) internal successors, (2780), 2252 states have internal predecessors, (2780), 820 states have call successors, (820), 225 states have call predecessors, (820), 225 states have return successors, (826), 807 states have call predecessors, (826), 818 states have call successors, (826) [2022-07-12 16:56:54,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3235 states to 3235 states and 4426 transitions. [2022-07-12 16:56:54,981 INFO L78 Accepts]: Start accepts. Automaton has 3235 states and 4426 transitions. Word has length 157 [2022-07-12 16:56:54,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:56:54,982 INFO L495 AbstractCegarLoop]: Abstraction has 3235 states and 4426 transitions. [2022-07-12 16:56:54,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 4 states have internal predecessors, (97), 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-12 16:56:54,982 INFO L276 IsEmpty]: Start isEmpty. Operand 3235 states and 4426 transitions. [2022-07-12 16:56:54,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-12 16:56:54,984 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:56:54,984 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:56:54,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 16:56:54,984 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-12 16:56:54,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:56:54,985 INFO L85 PathProgramCache]: Analyzing trace with hash -826661930, now seen corresponding path program 1 times [2022-07-12 16:56:54,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:56:54,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261738383] [2022-07-12 16:56:54,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:56:54,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:56:55,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:55,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:56:55,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:55,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 16:56:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:55,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 16:56:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:55,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 16:56:55,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:55,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 16:56:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:55,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 16:56:55,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:55,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:56:55,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:55,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:55,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:55,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:56:55,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:55,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:56:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:55,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:56:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:55,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 16:56:55,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:55,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 16:56:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:55,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 16:56:55,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:55,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 16:56:55,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:55,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 16:56:55,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:55,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 16:56:55,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:55,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 16:56:55,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:55,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 16:56:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:55,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 16:56:55,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:55,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 16:56:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:55,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 16:56:55,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:55,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 16:56:55,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:55,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 16:56:55,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:55,296 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:56:55,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:56:55,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261738383] [2022-07-12 16:56:55,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261738383] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:56:55,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:56:55,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 16:56:55,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042007329] [2022-07-12 16:56:55,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:56:55,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 16:56:55,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:56:55,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 16:56:55,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 16:56:55,299 INFO L87 Difference]: Start difference. First operand 3235 states and 4426 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 7 states have internal predecessors, (101), 3 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-12 16:57:05,609 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 16:57:15,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:57:15,843 INFO L93 Difference]: Finished difference Result 6654 states and 9159 transitions. [2022-07-12 16:57:15,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 16:57:15,844 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 7 states have internal predecessors, (101), 3 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 163 [2022-07-12 16:57:15,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:57:15,855 INFO L225 Difference]: With dead ends: 6654 [2022-07-12 16:57:15,855 INFO L226 Difference]: Without dead ends: 3810 [2022-07-12 16:57:15,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-07-12 16:57:15,864 INFO L413 NwaCegarLoop]: 3784 mSDtfsCounter, 6199 mSDsluCounter, 4857 mSDsCounter, 0 mSdLazyCounter, 18334 mSolverCounterSat, 3856 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6204 SdHoareTripleChecker+Valid, 8641 SdHoareTripleChecker+Invalid, 22190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3856 IncrementalHoareTripleChecker+Valid, 18334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.0s IncrementalHoareTripleChecker+Time [2022-07-12 16:57:15,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6204 Valid, 8641 Invalid, 22190 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3856 Valid, 18334 Invalid, 0 Unknown, 0 Unchecked, 20.0s Time] [2022-07-12 16:57:15,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3810 states. [2022-07-12 16:57:16,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3810 to 3374. [2022-07-12 16:57:16,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3374 states, 2278 states have (on average 1.275241439859526) internal successors, (2905), 2356 states have internal predecessors, (2905), 856 states have call successors, (856), 225 states have call predecessors, (856), 225 states have return successors, (862), 844 states have call predecessors, (862), 854 states have call successors, (862) [2022-07-12 16:57:16,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3374 states to 3374 states and 4623 transitions. [2022-07-12 16:57:16,037 INFO L78 Accepts]: Start accepts. Automaton has 3374 states and 4623 transitions. Word has length 163 [2022-07-12 16:57:16,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:57:16,037 INFO L495 AbstractCegarLoop]: Abstraction has 3374 states and 4623 transitions. [2022-07-12 16:57:16,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 7 states have internal predecessors, (101), 3 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-12 16:57:16,038 INFO L276 IsEmpty]: Start isEmpty. Operand 3374 states and 4623 transitions. [2022-07-12 16:57:16,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-12 16:57:16,040 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:57:16,040 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:57:16,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-12 16:57:16,041 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-12 16:57:16,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:57:16,042 INFO L85 PathProgramCache]: Analyzing trace with hash -400107432, now seen corresponding path program 1 times [2022-07-12 16:57:16,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:57:16,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163882697] [2022-07-12 16:57:16,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:57:16,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:57:16,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:16,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:57:16,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:16,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 16:57:16,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:16,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 16:57:16,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:16,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 16:57:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:16,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 16:57:16,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:16,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 16:57:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:16,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:57:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:16,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:16,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:16,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:57:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:16,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:57:16,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:16,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:57:16,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:16,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 16:57:16,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:16,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 16:57:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:16,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 16:57:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:16,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 16:57:16,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:16,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 16:57:16,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:16,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 16:57:16,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:16,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 16:57:16,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:16,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 16:57:16,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:16,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 16:57:16,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:16,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 16:57:16,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:16,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 16:57:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:16,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 16:57:16,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:16,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 16:57:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:16,390 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:57:16,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:57:16,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163882697] [2022-07-12 16:57:16,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163882697] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:57:16,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:57:16,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:57:16,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277059923] [2022-07-12 16:57:16,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:57:16,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:57:16,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:57:16,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:57:16,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:57:16,392 INFO L87 Difference]: Start difference. First operand 3374 states and 4623 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-12 16:57:23,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:57:23,849 INFO L93 Difference]: Finished difference Result 3374 states and 4623 transitions. [2022-07-12 16:57:23,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:57:23,850 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 163 [2022-07-12 16:57:23,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:57:23,858 INFO L225 Difference]: With dead ends: 3374 [2022-07-12 16:57:23,859 INFO L226 Difference]: Without dead ends: 3372 [2022-07-12 16:57:23,865 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-12 16:57:23,865 INFO L413 NwaCegarLoop]: 3551 mSDtfsCounter, 6852 mSDsluCounter, 1842 mSDsCounter, 0 mSdLazyCounter, 4321 mSolverCounterSat, 3728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7033 SdHoareTripleChecker+Valid, 5393 SdHoareTripleChecker+Invalid, 8049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3728 IncrementalHoareTripleChecker+Valid, 4321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-07-12 16:57:23,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7033 Valid, 5393 Invalid, 8049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3728 Valid, 4321 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2022-07-12 16:57:23,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3372 states. [2022-07-12 16:57:24,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3372 to 3372. [2022-07-12 16:57:24,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3372 states, 2277 states have (on average 1.274923144488362) internal successors, (2903), 2354 states have internal predecessors, (2903), 856 states have call successors, (856), 225 states have call predecessors, (856), 225 states have return successors, (862), 844 states have call predecessors, (862), 854 states have call successors, (862) [2022-07-12 16:57:24,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3372 states to 3372 states and 4621 transitions. [2022-07-12 16:57:24,034 INFO L78 Accepts]: Start accepts. Automaton has 3372 states and 4621 transitions. Word has length 163 [2022-07-12 16:57:24,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:57:24,035 INFO L495 AbstractCegarLoop]: Abstraction has 3372 states and 4621 transitions. [2022-07-12 16:57:24,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-12 16:57:24,035 INFO L276 IsEmpty]: Start isEmpty. Operand 3372 states and 4621 transitions. [2022-07-12 16:57:24,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-12 16:57:24,037 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:57:24,038 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:57:24,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-12 16:57:24,038 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-12 16:57:24,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:57:24,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1796644271, now seen corresponding path program 1 times [2022-07-12 16:57:24,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:57:24,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999282015] [2022-07-12 16:57:24,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:57:24,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:57:24,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:24,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:57:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:24,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 16:57:24,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:24,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 16:57:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:24,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 16:57:24,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:24,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 16:57:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:24,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 16:57:24,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:24,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:57:24,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:24,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:24,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:24,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:57:24,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:24,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:57:24,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:24,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:57:24,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:24,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 16:57:24,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:24,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 16:57:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:24,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 16:57:24,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:24,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 16:57:24,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:24,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 16:57:24,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:24,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 16:57:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:24,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 16:57:24,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:24,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 16:57:24,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:24,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 16:57:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:24,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 16:57:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:24,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 16:57:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:24,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 16:57:24,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:24,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 16:57:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:24,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 16:57:24,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:24,343 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:57:24,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:57:24,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999282015] [2022-07-12 16:57:24,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999282015] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:57:24,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:57:24,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:57:24,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295112852] [2022-07-12 16:57:24,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:57:24,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:57:24,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:57:24,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:57:24,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:57:24,345 INFO L87 Difference]: Start difference. First operand 3372 states and 4621 transitions. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-12 16:57:29,135 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 16:57:32,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:57:32,615 INFO L93 Difference]: Finished difference Result 3372 states and 4621 transitions. [2022-07-12 16:57:32,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:57:32,616 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 169 [2022-07-12 16:57:32,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:57:32,623 INFO L225 Difference]: With dead ends: 3372 [2022-07-12 16:57:32,623 INFO L226 Difference]: Without dead ends: 3370 [2022-07-12 16:57:32,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:57:32,625 INFO L413 NwaCegarLoop]: 3549 mSDtfsCounter, 6846 mSDsluCounter, 1842 mSDsCounter, 0 mSdLazyCounter, 4319 mSolverCounterSat, 3728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7026 SdHoareTripleChecker+Valid, 5391 SdHoareTripleChecker+Invalid, 8047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3728 IncrementalHoareTripleChecker+Valid, 4319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-07-12 16:57:32,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7026 Valid, 5391 Invalid, 8047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3728 Valid, 4319 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2022-07-12 16:57:32,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3370 states. [2022-07-12 16:57:32,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3370 to 3370. [2022-07-12 16:57:32,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3370 states, 2276 states have (on average 1.2746045694200352) internal successors, (2901), 2352 states have internal predecessors, (2901), 856 states have call successors, (856), 225 states have call predecessors, (856), 225 states have return successors, (862), 844 states have call predecessors, (862), 854 states have call successors, (862) [2022-07-12 16:57:32,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3370 states to 3370 states and 4619 transitions. [2022-07-12 16:57:32,786 INFO L78 Accepts]: Start accepts. Automaton has 3370 states and 4619 transitions. Word has length 169 [2022-07-12 16:57:32,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:57:32,786 INFO L495 AbstractCegarLoop]: Abstraction has 3370 states and 4619 transitions. [2022-07-12 16:57:32,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-12 16:57:32,786 INFO L276 IsEmpty]: Start isEmpty. Operand 3370 states and 4619 transitions. [2022-07-12 16:57:32,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-07-12 16:57:32,789 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:57:32,789 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:57:32,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-12 16:57:32,789 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-12 16:57:32,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:57:32,789 INFO L85 PathProgramCache]: Analyzing trace with hash -2122786566, now seen corresponding path program 1 times [2022-07-12 16:57:32,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:57:32,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719321994] [2022-07-12 16:57:32,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:57:32,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:57:32,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:32,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:57:32,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:32,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 16:57:32,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:32,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 16:57:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:32,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 16:57:32,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:32,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 16:57:32,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:32,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 16:57:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:32,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:57:32,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:32,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:32,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:57:32,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:32,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:57:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:32,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:57:32,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:33,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 16:57:33,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:33,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 16:57:33,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:33,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 16:57:33,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:33,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 16:57:33,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:33,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 16:57:33,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:33,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 16:57:33,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:33,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 16:57:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:33,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 16:57:33,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:33,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 16:57:33,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:33,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 16:57:33,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:33,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 16:57:33,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:33,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 16:57:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:33,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 16:57:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:33,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 16:57:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:33,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 16:57:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:33,140 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:57:33,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:57:33,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719321994] [2022-07-12 16:57:33,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719321994] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:57:33,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:57:33,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:57:33,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195592302] [2022-07-12 16:57:33,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:57:33,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:57:33,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:57:33,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:57:33,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:57:33,143 INFO L87 Difference]: Start difference. First operand 3370 states and 4619 transitions. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-12 16:57:40,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:57:40,742 INFO L93 Difference]: Finished difference Result 3370 states and 4619 transitions. [2022-07-12 16:57:40,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:57:40,743 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 175 [2022-07-12 16:57:40,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:57:40,749 INFO L225 Difference]: With dead ends: 3370 [2022-07-12 16:57:40,749 INFO L226 Difference]: Without dead ends: 3368 [2022-07-12 16:57:40,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:57:40,750 INFO L413 NwaCegarLoop]: 3547 mSDtfsCounter, 6840 mSDsluCounter, 1842 mSDsCounter, 0 mSdLazyCounter, 4317 mSolverCounterSat, 3728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7019 SdHoareTripleChecker+Valid, 5389 SdHoareTripleChecker+Invalid, 8045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3728 IncrementalHoareTripleChecker+Valid, 4317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-07-12 16:57:40,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7019 Valid, 5389 Invalid, 8045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3728 Valid, 4317 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2022-07-12 16:57:40,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3368 states. [2022-07-12 16:57:40,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3368 to 3368. [2022-07-12 16:57:40,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3368 states, 2275 states have (on average 1.2742857142857142) internal successors, (2899), 2350 states have internal predecessors, (2899), 856 states have call successors, (856), 225 states have call predecessors, (856), 225 states have return successors, (862), 844 states have call predecessors, (862), 854 states have call successors, (862) [2022-07-12 16:57:40,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3368 states to 3368 states and 4617 transitions. [2022-07-12 16:57:40,906 INFO L78 Accepts]: Start accepts. Automaton has 3368 states and 4617 transitions. Word has length 175 [2022-07-12 16:57:40,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:57:40,906 INFO L495 AbstractCegarLoop]: Abstraction has 3368 states and 4617 transitions. [2022-07-12 16:57:40,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-12 16:57:40,907 INFO L276 IsEmpty]: Start isEmpty. Operand 3368 states and 4617 transitions. [2022-07-12 16:57:40,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2022-07-12 16:57:40,910 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:57:40,910 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:57:40,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-12 16:57:40,910 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-12 16:57:40,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:57:40,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1667494656, now seen corresponding path program 1 times [2022-07-12 16:57:40,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:57:40,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416305244] [2022-07-12 16:57:40,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:57:40,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:57:41,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:41,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:57:41,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:41,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 16:57:41,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:41,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 16:57:41,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:41,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 16:57:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:41,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 16:57:41,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:41,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:41,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:41,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:41,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:41,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:57:41,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:41,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 16:57:41,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:41,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:41,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:41,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:57:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:41,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 16:57:41,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:41,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:41,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:41,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:57:41,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:41,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 16:57:41,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:41,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:41,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:41,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:57:41,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:41,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 16:57:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:41,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:41,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:41,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:41,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:41,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:57:41,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:41,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 16:57:41,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:41,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-12 16:57:41,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:41,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 16:57:41,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:41,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-12 16:57:41,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:41,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-12 16:57:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:41,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-12 16:57:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:41,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:41,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-12 16:57:41,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:41,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-12 16:57:41,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:41,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-12 16:57:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:41,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-07-12 16:57:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:41,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-07-12 16:57:41,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:41,399 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2022-07-12 16:57:41,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:57:41,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416305244] [2022-07-12 16:57:41,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416305244] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:57:41,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:57:41,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 16:57:41,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455904389] [2022-07-12 16:57:41,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:57:41,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 16:57:41,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:57:41,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 16:57:41,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-12 16:57:41,401 INFO L87 Difference]: Start difference. First operand 3368 states and 4617 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (28), 7 states have call predecessors, (28), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24)