./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 eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--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-?-eb692b5 [2022-07-20 03:56:13,020 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 03:56:13,021 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 03:56:13,043 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 03:56:13,044 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 03:56:13,045 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 03:56:13,045 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 03:56:13,046 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 03:56:13,048 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 03:56:13,048 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 03:56:13,049 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 03:56:13,049 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 03:56:13,050 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 03:56:13,050 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 03:56:13,051 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 03:56:13,052 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 03:56:13,052 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 03:56:13,053 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 03:56:13,054 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 03:56:13,055 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 03:56:13,056 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 03:56:13,057 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 03:56:13,057 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 03:56:13,058 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 03:56:13,058 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 03:56:13,060 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 03:56:13,060 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 03:56:13,060 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 03:56:13,061 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 03:56:13,061 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 03:56:13,062 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 03:56:13,062 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 03:56:13,063 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 03:56:13,063 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 03:56:13,064 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 03:56:13,064 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 03:56:13,064 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 03:56:13,065 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 03:56:13,065 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 03:56:13,065 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 03:56:13,066 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 03:56:13,066 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 03:56:13,067 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-20 03:56:13,091 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 03:56:13,093 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 03:56:13,093 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 03:56:13,093 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 03:56:13,094 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 03:56:13,094 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 03:56:13,094 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 03:56:13,094 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 03:56:13,094 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 03:56:13,095 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 03:56:13,095 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 03:56:13,095 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 03:56:13,096 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 03:56:13,096 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 03:56:13,096 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 03:56:13,096 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 03:56:13,096 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 03:56:13,096 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 03:56:13,097 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 03:56:13,097 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 03:56:13,098 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 03:56:13,098 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 03:56:13,098 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 03:56:13,098 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 03:56:13,098 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 03:56:13,098 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 03:56:13,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 03:56:13,099 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 03:56:13,099 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 03:56:13,099 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 03:56:13,099 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-20 03:56:13,289 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 03:56:13,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 03:56:13,317 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 03:56:13,318 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 03:56:13,318 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 03:56:13,319 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-20 03:56:13,364 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cfa3596a/0ab1d842371347519b77d46a16636cf8/FLAG44a40f581 [2022-07-20 03:56:14,103 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 03:56:14,104 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-20 03:56:14,148 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cfa3596a/0ab1d842371347519b77d46a16636cf8/FLAG44a40f581 [2022-07-20 03:56:14,388 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cfa3596a/0ab1d842371347519b77d46a16636cf8 [2022-07-20 03:56:14,390 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 03:56:14,391 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 03:56:14,392 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 03:56:14,392 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 03:56:14,394 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 03:56:14,395 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 03:56:14" (1/1) ... [2022-07-20 03:56:14,395 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f1aa4a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:56:14, skipping insertion in model container [2022-07-20 03:56:14,395 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 03:56:14" (1/1) ... [2022-07-20 03:56:14,400 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 03:56:14,517 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 03:56:18,398 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[497733,497746] [2022-07-20 03:56:18,401 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[497878,497891] [2022-07-20 03:56:18,402 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[498024,498037] [2022-07-20 03:56:18,403 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[498189,498202] [2022-07-20 03:56:18,403 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[498347,498360] [2022-07-20 03:56:18,405 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[498505,498518] [2022-07-20 03:56:18,405 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[498663,498676] [2022-07-20 03:56:18,405 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[498823,498836] [2022-07-20 03:56:18,406 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[498982,498995] [2022-07-20 03:56:18,406 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[499121,499134] [2022-07-20 03:56:18,406 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[499263,499276] [2022-07-20 03:56:18,407 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[499412,499425] [2022-07-20 03:56:18,407 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[499551,499564] [2022-07-20 03:56:18,408 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[499706,499719] [2022-07-20 03:56:18,408 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[499866,499879] [2022-07-20 03:56:18,411 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 03:56:18,415 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[500168,500181] [2022-07-20 03:56:18,416 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[500320,500333] [2022-07-20 03:56:18,418 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[500469,500482] [2022-07-20 03:56:18,419 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[500617,500630] [2022-07-20 03:56:18,419 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[500774,500787] [2022-07-20 03:56:18,420 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[500923,500936] [2022-07-20 03:56:18,420 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[501079,501092] [2022-07-20 03:56:18,421 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[501232,501245] [2022-07-20 03:56:18,430 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[501378,501391] [2022-07-20 03:56:18,431 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 03:56:18,431 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 03:56:18,432 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 03:56:18,432 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 03:56:18,432 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 03:56:18,433 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 03:56:18,434 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[502424,502437] [2022-07-20 03:56:18,435 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[502576,502589] [2022-07-20 03:56:18,438 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[502731,502744] [2022-07-20 03:56:18,439 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[502895,502908] [2022-07-20 03:56:18,439 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[503051,503064] [2022-07-20 03:56:18,439 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[503215,503228] [2022-07-20 03:56:18,439 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[503357,503370] [2022-07-20 03:56:18,440 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 03:56:18,440 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 03:56:18,440 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 03:56:18,441 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[504000,504013] [2022-07-20 03:56:18,441 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[504149,504162] [2022-07-20 03:56:18,441 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[504296,504309] [2022-07-20 03:56:18,442 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[504435,504448] [2022-07-20 03:56:18,442 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[504598,504611] [2022-07-20 03:56:18,442 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[504764,504777] [2022-07-20 03:56:18,443 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 03:56:18,443 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 03:56:18,444 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 03:56:18,444 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 03:56:18,444 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 03:56:18,445 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[505756,505769] [2022-07-20 03:56:18,445 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[505916,505929] [2022-07-20 03:56:18,445 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[506078,506091] [2022-07-20 03:56:18,446 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[506237,506250] [2022-07-20 03:56:18,447 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[506383,506396] [2022-07-20 03:56:18,447 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[506526,506539] [2022-07-20 03:56:18,447 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[506670,506683] [2022-07-20 03:56:18,447 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[506813,506826] [2022-07-20 03:56:18,448 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 03:56:18,448 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 03:56:18,449 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 03:56:18,449 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 03:56:18,449 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 03:56:18,449 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 03:56:18,450 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[507858,507871] [2022-07-20 03:56:18,450 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[508010,508023] [2022-07-20 03:56:18,450 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[508161,508174] [2022-07-20 03:56:18,451 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 03:56:18,451 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 03:56:18,451 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 03:56:18,451 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 03:56:18,452 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 03:56:18,452 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 03:56:18,452 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 03:56:18,452 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 03:56:18,453 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[509513,509526] [2022-07-20 03:56:18,453 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[509661,509674] [2022-07-20 03:56:18,454 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[509827,509840] [2022-07-20 03:56:18,454 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[509996,510009] [2022-07-20 03:56:18,455 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 03:56:18,455 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 03:56:18,455 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 03:56:18,455 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 03:56:18,456 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 03:56:18,456 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 03:56:18,457 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 03:56:18,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 03:56:18,531 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 03:56:18,887 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 03:56:18,889 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[497878,497891] [2022-07-20 03:56:18,889 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[498024,498037] [2022-07-20 03:56:18,889 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[498189,498202] [2022-07-20 03:56:18,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[498347,498360] [2022-07-20 03:56:18,891 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[498505,498518] [2022-07-20 03:56:18,891 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[498663,498676] [2022-07-20 03:56:18,891 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[498823,498836] [2022-07-20 03:56:18,892 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[498982,498995] [2022-07-20 03:56:18,892 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[499121,499134] [2022-07-20 03:56:18,892 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[499263,499276] [2022-07-20 03:56:18,893 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[499412,499425] [2022-07-20 03:56:18,893 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[499551,499564] [2022-07-20 03:56:18,893 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[499706,499719] [2022-07-20 03:56:18,894 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[499866,499879] [2022-07-20 03:56:18,894 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[500017,500030] [2022-07-20 03:56:18,894 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[500168,500181] [2022-07-20 03:56:18,894 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[500320,500333] [2022-07-20 03:56:18,895 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[500469,500482] [2022-07-20 03:56:18,896 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[500617,500630] [2022-07-20 03:56:18,896 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[500774,500787] [2022-07-20 03:56:18,896 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[500923,500936] [2022-07-20 03:56:18,897 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[501079,501092] [2022-07-20 03:56:18,897 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[501232,501245] [2022-07-20 03:56:18,898 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[501378,501391] [2022-07-20 03:56:18,898 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[501521,501534] [2022-07-20 03:56:18,898 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[501673,501686] [2022-07-20 03:56:18,898 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[501819,501832] [2022-07-20 03:56:18,899 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[501964,501977] [2022-07-20 03:56:18,899 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[502118,502131] [2022-07-20 03:56:18,899 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[502269,502282] [2022-07-20 03:56:18,899 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[502424,502437] [2022-07-20 03:56:18,900 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[502576,502589] [2022-07-20 03:56:18,901 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[502731,502744] [2022-07-20 03:56:18,901 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[502895,502908] [2022-07-20 03:56:18,901 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[503051,503064] [2022-07-20 03:56:18,901 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[503215,503228] [2022-07-20 03:56:18,902 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[503357,503370] [2022-07-20 03:56:18,902 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[503515,503528] [2022-07-20 03:56:18,903 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[503682,503695] [2022-07-20 03:56:18,903 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[503841,503854] [2022-07-20 03:56:18,904 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[504000,504013] [2022-07-20 03:56:18,904 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[504149,504162] [2022-07-20 03:56:18,905 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[504296,504309] [2022-07-20 03:56:18,905 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[504435,504448] [2022-07-20 03:56:18,905 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[504598,504611] [2022-07-20 03:56:18,906 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[504764,504777] [2022-07-20 03:56:18,906 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[504928,504941] [2022-07-20 03:56:18,906 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[505093,505106] [2022-07-20 03:56:18,907 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[505258,505271] [2022-07-20 03:56:18,907 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[505424,505437] [2022-07-20 03:56:18,908 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[505589,505602] [2022-07-20 03:56:18,908 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[505756,505769] [2022-07-20 03:56:18,908 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[505916,505929] [2022-07-20 03:56:18,908 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[506078,506091] [2022-07-20 03:56:18,909 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[506237,506250] [2022-07-20 03:56:18,909 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[506383,506396] [2022-07-20 03:56:18,909 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[506526,506539] [2022-07-20 03:56:18,910 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[506670,506683] [2022-07-20 03:56:18,910 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[506813,506826] [2022-07-20 03:56:18,910 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[506957,506970] [2022-07-20 03:56:18,911 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[507098,507111] [2022-07-20 03:56:18,912 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[507236,507249] [2022-07-20 03:56:18,920 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[507394,507407] [2022-07-20 03:56:18,921 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[507553,507566] [2022-07-20 03:56:18,921 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[507709,507722] [2022-07-20 03:56:18,921 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[507858,507871] [2022-07-20 03:56:18,922 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[508010,508023] [2022-07-20 03:56:18,922 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[508161,508174] [2022-07-20 03:56:18,922 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[508310,508323] [2022-07-20 03:56:18,923 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 03:56:18,923 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 03:56:18,927 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[508763,508776] [2022-07-20 03:56:18,927 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[508914,508927] [2022-07-20 03:56:18,928 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[509064,509077] [2022-07-20 03:56:18,928 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[509211,509224] [2022-07-20 03:56:18,928 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[509362,509375] [2022-07-20 03:56:18,928 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[509513,509526] [2022-07-20 03:56:18,929 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[509661,509674] [2022-07-20 03:56:18,930 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[509827,509840] [2022-07-20 03:56:18,930 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[509996,510009] [2022-07-20 03:56:18,930 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[510163,510176] [2022-07-20 03:56:18,931 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[510331,510344] [2022-07-20 03:56:18,931 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[510481,510494] [2022-07-20 03:56:18,931 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[510628,510641] [2022-07-20 03:56:18,931 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[510789,510802] [2022-07-20 03:56:18,932 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[510959,510972] [2022-07-20 03:56:18,932 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[511121,511134] [2022-07-20 03:56:18,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 03:56:19,120 INFO L208 MainTranslator]: Completed translation [2022-07-20 03:56:19,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:56:19 WrapperNode [2022-07-20 03:56:19,120 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 03:56:19,121 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 03:56:19,121 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 03:56:19,121 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 03:56:19,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:56:19" (1/1) ... [2022-07-20 03:56:19,210 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:56:19" (1/1) ... [2022-07-20 03:56:19,391 INFO L137 Inliner]: procedures = 791, calls = 4679, calls flagged for inlining = 346, calls inlined = 247, statements flattened = 8171 [2022-07-20 03:56:19,392 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 03:56:19,393 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 03:56:19,394 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 03:56:19,394 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 03:56:19,400 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:56:19" (1/1) ... [2022-07-20 03:56:19,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:56:19" (1/1) ... [2022-07-20 03:56:19,485 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:56:19" (1/1) ... [2022-07-20 03:56:19,486 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:56:19" (1/1) ... [2022-07-20 03:56:19,595 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:56:19" (1/1) ... [2022-07-20 03:56:19,618 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:56:19" (1/1) ... [2022-07-20 03:56:19,707 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:56:19" (1/1) ... [2022-07-20 03:56:19,742 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 03:56:19,743 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 03:56:19,743 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 03:56:19,743 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 03:56:19,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:56:19" (1/1) ... [2022-07-20 03:56:19,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 03:56:19,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 03:56:19,833 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-20 03:56:19,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-20 03:56:19,922 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2022-07-20 03:56:19,922 INFO L130 BoogieDeclarations]: Found specification of procedure pidff_request_effect_upload [2022-07-20 03:56:19,922 INFO L138 BoogieDeclarations]: Found implementation of procedure pidff_request_effect_upload [2022-07-20 03:56:19,922 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_int [2022-07-20 03:56:19,922 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_int [2022-07-20 03:56:19,923 INFO L130 BoogieDeclarations]: Found specification of procedure pidff_find_special_field [2022-07-20 03:56:19,923 INFO L138 BoogieDeclarations]: Found implementation of procedure pidff_find_special_field [2022-07-20 03:56:19,923 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_usbhid_device [2022-07-20 03:56:19,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_usbhid_device [2022-07-20 03:56:19,923 INFO L130 BoogieDeclarations]: Found specification of procedure pidff_check_usage [2022-07-20 03:56:19,923 INFO L138 BoogieDeclarations]: Found implementation of procedure pidff_check_usage [2022-07-20 03:56:19,923 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-20 03:56:19,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-20 03:56:19,924 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_get_interface [2022-07-20 03:56:19,924 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_get_interface [2022-07-20 03:56:19,924 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-20 03:56:19,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-20 03:56:19,924 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_in [2022-07-20 03:56:19,925 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_in [2022-07-20 03:56:19,925 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-20 03:56:19,925 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-20 03:56:19,926 INFO L130 BoogieDeclarations]: Found specification of procedure hid_suspend [2022-07-20 03:56:19,926 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_suspend [2022-07-20 03:56:19,926 INFO L130 BoogieDeclarations]: Found specification of procedure pidff_erase_pid [2022-07-20 03:56:19,926 INFO L138 BoogieDeclarations]: Found implementation of procedure pidff_erase_pid [2022-07-20 03:56:19,926 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-20 03:56:19,926 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-07-20 03:56:19,926 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-07-20 03:56:19,926 INFO L130 BoogieDeclarations]: Found specification of procedure hid_submit_out [2022-07-20 03:56:19,926 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_submit_out [2022-07-20 03:56:19,927 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_108 [2022-07-20 03:56:19,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_108 [2022-07-20 03:56:19,927 INFO L130 BoogieDeclarations]: Found specification of procedure hid_output_report [2022-07-20 03:56:19,927 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_output_report [2022-07-20 03:56:19,927 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-20 03:56:19,927 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-20 03:56:19,927 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-20 03:56:19,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-20 03:56:19,928 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_existancelock_of_hiddev [2022-07-20 03:56:19,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_existancelock_of_hiddev [2022-07-20 03:56:19,928 INFO L130 BoogieDeclarations]: Found specification of procedure hid_find_max_report [2022-07-20 03:56:19,928 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_find_max_report [2022-07-20 03:56:19,928 INFO L130 BoogieDeclarations]: Found specification of procedure pidff_autocenter [2022-07-20 03:56:19,928 INFO L138 BoogieDeclarations]: Found implementation of procedure pidff_autocenter [2022-07-20 03:56:19,928 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-20 03:56:19,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-20 03:56:19,928 INFO L130 BoogieDeclarations]: Found specification of procedure hiddev_ioctl [2022-07-20 03:56:19,929 INFO L138 BoogieDeclarations]: Found implementation of procedure hiddev_ioctl [2022-07-20 03:56:19,929 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-20 03:56:19,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-20 03:56:19,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 03:56:19,929 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-20 03:56:19,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-20 03:56:19,929 INFO L130 BoogieDeclarations]: Found specification of procedure hid_submit_ctrl [2022-07-20 03:56:19,930 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_submit_ctrl [2022-07-20 03:56:19,930 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irq_120 [2022-07-20 03:56:19,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irq_120 [2022-07-20 03:56:19,930 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2022-07-20 03:56:19,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2022-07-20 03:56:19,930 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~pm_message_t~0~TO~int [2022-07-20 03:56:19,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~pm_message_t~0~TO~int [2022-07-20 03:56:19,930 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_restart_out_queue [2022-07-20 03:56:19,931 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_restart_out_queue [2022-07-20 03:56:19,931 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2022-07-20 03:56:19,931 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2022-07-20 03:56:19,931 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-20 03:56:19,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-20 03:56:19,931 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_stop [2022-07-20 03:56:19,931 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_stop [2022-07-20 03:56:19,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 03:56:19,931 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mod_timer [2022-07-20 03:56:19,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mod_timer [2022-07-20 03:56:19,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 03:56:19,934 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-20 03:56:19,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-20 03:56:19,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 03:56:19,935 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-20 03:56:19,935 INFO L130 BoogieDeclarations]: Found specification of procedure hid_cease_io [2022-07-20 03:56:19,935 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_cease_io [2022-07-20 03:56:19,943 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2022-07-20 03:56:19,943 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2022-07-20 03:56:19,944 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_irq [2022-07-20 03:56:19,945 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_irq [2022-07-20 03:56:19,945 INFO L130 BoogieDeclarations]: Found specification of procedure usb_control_msg [2022-07-20 03:56:19,945 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_control_msg [2022-07-20 03:56:19,945 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-20 03:56:19,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-20 03:56:19,945 INFO L130 BoogieDeclarations]: Found specification of procedure hid_hw_wait [2022-07-20 03:56:19,945 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_hw_wait [2022-07-20 03:56:19,945 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-20 03:56:19,945 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-20 03:56:19,946 INFO L130 BoogieDeclarations]: Found specification of procedure hid_start_in [2022-07-20 03:56:19,946 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_start_in [2022-07-20 03:56:19,946 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2022-07-20 03:56:19,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2022-07-20 03:56:19,946 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-20 03:56:19,946 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-20 03:56:19,946 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_hid_open_mut [2022-07-20 03:56:19,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_hid_open_mut [2022-07-20 03:56:19,946 INFO L130 BoogieDeclarations]: Found specification of procedure hid_io_error [2022-07-20 03:56:19,947 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_io_error [2022-07-20 03:56:19,947 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2022-07-20 03:56:19,947 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2022-07-20 03:56:19,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 03:56:19,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 03:56:19,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-20 03:56:19,947 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-07-20 03:56:19,947 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-07-20 03:56:19,947 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_process_context [2022-07-20 03:56:19,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_process_context [2022-07-20 03:56:19,948 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2022-07-20 03:56:19,948 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2022-07-20 03:56:19,948 INFO L130 BoogieDeclarations]: Found specification of procedure hid_cancel_delayed_stuff [2022-07-20 03:56:19,948 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_cancel_delayed_stuff [2022-07-20 03:56:19,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-20 03:56:19,948 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-20 03:56:19,948 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_usbhid_device [2022-07-20 03:56:19,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_usbhid_device [2022-07-20 03:56:19,949 INFO L130 BoogieDeclarations]: Found specification of procedure hiddev_lookup_report [2022-07-20 03:56:19,949 INFO L138 BoogieDeclarations]: Found implementation of procedure hiddev_lookup_report [2022-07-20 03:56:19,949 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-20 03:56:19,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-20 03:56:19,949 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_free_urb [2022-07-20 03:56:19,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_free_urb [2022-07-20 03:56:19,950 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-20 03:56:19,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-20 03:56:19,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 03:56:19,950 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-07-20 03:56:19,950 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-07-20 03:56:19,950 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-20 03:56:19,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-20 03:56:19,950 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_submit_report [2022-07-20 03:56:19,951 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_submit_report [2022-07-20 03:56:19,951 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_mark_busy [2022-07-20 03:56:19,951 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_mark_busy [2022-07-20 03:56:19,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 03:56:19,951 INFO L130 BoogieDeclarations]: Found specification of procedure hid_set_idle [2022-07-20 03:56:19,951 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_set_idle [2022-07-20 03:56:19,951 INFO L130 BoogieDeclarations]: Found specification of procedure pidff_set [2022-07-20 03:56:19,951 INFO L138 BoogieDeclarations]: Found implementation of procedure pidff_set [2022-07-20 03:56:19,951 INFO L130 BoogieDeclarations]: Found specification of procedure hid_reset_resume [2022-07-20 03:56:19,952 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_reset_resume [2022-07-20 03:56:19,952 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2022-07-20 03:56:19,952 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2022-07-20 03:56:19,952 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-20 03:56:19,952 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-20 03:56:19,952 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-20 03:56:19,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-20 03:56:19,952 INFO L130 BoogieDeclarations]: Found specification of procedure hid_alloc_report_buf [2022-07-20 03:56:19,952 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_alloc_report_buf [2022-07-20 03:56:19,953 INFO L130 BoogieDeclarations]: Found specification of procedure pidff_find_reports [2022-07-20 03:56:19,953 INFO L138 BoogieDeclarations]: Found implementation of procedure pidff_find_reports [2022-07-20 03:56:19,953 INFO L130 BoogieDeclarations]: Found specification of procedure list_empty [2022-07-20 03:56:19,953 INFO L138 BoogieDeclarations]: Found implementation of procedure list_empty [2022-07-20 03:56:19,953 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_alloc_urb [2022-07-20 03:56:19,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_alloc_urb [2022-07-20 03:56:19,953 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-20 03:56:19,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-20 03:56:19,953 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-20 03:56:19,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-20 03:56:19,954 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2022-07-20 03:56:19,954 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2022-07-20 03:56:19,954 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-20 03:56:19,954 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-20 03:56:19,954 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-20 03:56:19,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-20 03:56:19,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 03:56:19,954 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irq [2022-07-20 03:56:19,955 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irq [2022-07-20 03:56:19,955 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-20 03:56:19,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-20 03:56:19,955 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_restart_ctrl_queue [2022-07-20 03:56:19,955 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_restart_ctrl_queue [2022-07-20 03:56:19,955 INFO L130 BoogieDeclarations]: Found specification of procedure pidff_reset [2022-07-20 03:56:19,955 INFO L138 BoogieDeclarations]: Found implementation of procedure pidff_reset [2022-07-20 03:56:19,955 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_thread_lock_of_hiddev_list [2022-07-20 03:56:19,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_thread_lock_of_hiddev_list [2022-07-20 03:56:19,956 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2022-07-20 03:56:19,956 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2022-07-20 03:56:19,956 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_lookup_quirk [2022-07-20 03:56:19,956 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_lookup_quirk [2022-07-20 03:56:19,956 INFO L130 BoogieDeclarations]: Found specification of procedure usb_string [2022-07-20 03:56:19,956 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_string [2022-07-20 03:56:19,956 INFO L130 BoogieDeclarations]: Found specification of procedure hid_resume [2022-07-20 03:56:19,956 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_resume [2022-07-20 03:56:19,956 INFO L130 BoogieDeclarations]: Found specification of procedure hid_get_class_descriptor [2022-07-20 03:56:19,957 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_get_class_descriptor [2022-07-20 03:56:19,957 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_107 [2022-07-20 03:56:19,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_107 [2022-07-20 03:56:19,957 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_96 [2022-07-20 03:56:19,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_96 [2022-07-20 03:56:19,957 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_97 [2022-07-20 03:56:19,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_97 [2022-07-20 03:56:19,957 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-20 03:56:19,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-20 03:56:19,958 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_thread_lock_of_hiddev_list [2022-07-20 03:56:19,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_thread_lock_of_hiddev_list [2022-07-20 03:56:19,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-20 03:56:19,958 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-20 03:56:19,958 INFO L130 BoogieDeclarations]: Found specification of procedure pidff_playback_pid [2022-07-20 03:56:19,958 INFO L138 BoogieDeclarations]: Found implementation of procedure pidff_playback_pid [2022-07-20 03:56:19,958 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-20 03:56:19,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-20 03:56:19,958 INFO L130 BoogieDeclarations]: Found specification of procedure usb_block_urb [2022-07-20 03:56:19,959 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_block_urb [2022-07-20 03:56:19,959 INFO L130 BoogieDeclarations]: Found specification of procedure hid_retry_timeout [2022-07-20 03:56:19,959 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_retry_timeout [2022-07-20 03:56:19,959 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_timer_timer_instance_3 [2022-07-20 03:56:19,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_timer_timer_instance_3 [2022-07-20 03:56:19,959 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_usb_alloc_coherent [2022-07-20 03:56:19,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_usb_alloc_coherent [2022-07-20 03:56:19,959 INFO L130 BoogieDeclarations]: Found specification of procedure __usb_get_extra_descriptor [2022-07-20 03:56:19,959 INFO L138 BoogieDeclarations]: Found implementation of procedure __usb_get_extra_descriptor [2022-07-20 03:56:19,960 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_init_reports [2022-07-20 03:56:19,960 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_init_reports [2022-07-20 03:56:19,960 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_hid_open_mut [2022-07-20 03:56:19,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_hid_open_mut [2022-07-20 03:56:19,960 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-20 03:56:19,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-20 03:56:19,960 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-20 03:56:19,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-20 03:56:19,960 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-20 03:56:19,961 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-20 03:56:19,961 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unpoison_urb [2022-07-20 03:56:19,961 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unpoison_urb [2022-07-20 03:56:19,961 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-20 03:56:19,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-20 03:56:19,961 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-20 03:56:19,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-20 03:56:19,961 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-20 03:56:19,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-20 03:56:19,962 INFO L130 BoogieDeclarations]: Found specification of procedure hid_resume_common [2022-07-20 03:56:19,962 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_resume_common [2022-07-20 03:56:19,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 03:56:19,962 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_del_timer_sync [2022-07-20 03:56:19,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_del_timer_sync [2022-07-20 03:56:19,962 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2022-07-20 03:56:19,962 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2022-07-20 03:56:19,962 INFO L130 BoogieDeclarations]: Found specification of procedure hid_free_buffers [2022-07-20 03:56:19,962 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_free_buffers [2022-07-20 03:56:19,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-20 03:56:19,963 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-07-20 03:56:19,963 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-07-20 03:56:19,963 INFO L130 BoogieDeclarations]: Found specification of procedure hid_pidff_init [2022-07-20 03:56:19,963 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_pidff_init [2022-07-20 03:56:19,963 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-20 03:56:19,963 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-20 03:56:19,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-20 03:56:19,963 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-20 03:56:19,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-20 03:56:19,964 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_put_interface [2022-07-20 03:56:19,964 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_put_interface [2022-07-20 03:56:19,964 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2022-07-20 03:56:19,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2022-07-20 03:56:19,964 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_existancelock_of_hiddev [2022-07-20 03:56:19,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_existancelock_of_hiddev [2022-07-20 03:56:19,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-20 03:56:19,964 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-20 03:56:19,965 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-20 03:56:19,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-20 03:56:19,965 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_interrupt_context [2022-07-20 03:56:19,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_interrupt_context [2022-07-20 03:56:19,965 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-20 03:56:19,965 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-20 03:56:19,965 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-20 03:56:19,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-20 03:56:19,965 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_timer_instance_callback_3_2 [2022-07-20 03:56:19,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_timer_instance_callback_3_2 [2022-07-20 03:56:19,966 INFO L130 BoogieDeclarations]: Found specification of procedure vfree [2022-07-20 03:56:19,966 INFO L138 BoogieDeclarations]: Found implementation of procedure vfree [2022-07-20 03:56:19,966 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2022-07-20 03:56:19,966 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2022-07-20 03:56:19,966 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-20 03:56:19,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-20 03:56:19,966 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_parse [2022-07-20 03:56:19,966 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_parse [2022-07-20 03:56:19,967 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_put_interface_async [2022-07-20 03:56:19,967 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_put_interface_async [2022-07-20 03:56:19,967 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_wait_io [2022-07-20 03:56:19,967 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_wait_io [2022-07-20 03:56:19,967 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_put_power [2022-07-20 03:56:19,967 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_put_power [2022-07-20 03:56:19,967 INFO L130 BoogieDeclarations]: Found specification of procedure pidff_check_autocenter [2022-07-20 03:56:19,967 INFO L138 BoogieDeclarations]: Found implementation of procedure pidff_check_autocenter [2022-07-20 03:56:19,967 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-20 03:56:19,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-20 03:56:19,968 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mod_timer_99 [2022-07-20 03:56:19,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mod_timer_99 [2022-07-20 03:56:19,968 INFO L130 BoogieDeclarations]: Found specification of procedure pidff_find_special_keys [2022-07-20 03:56:19,968 INFO L138 BoogieDeclarations]: Found implementation of procedure pidff_find_special_keys [2022-07-20 03:56:19,968 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-20 03:56:19,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-20 03:56:19,968 INFO L130 BoogieDeclarations]: Found specification of procedure down_write [2022-07-20 03:56:19,968 INFO L138 BoogieDeclarations]: Found implementation of procedure down_write [2022-07-20 03:56:19,968 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2022-07-20 03:56:19,969 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2022-07-20 03:56:19,969 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2022-07-20 03:56:19,969 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2022-07-20 03:56:19,969 INFO L130 BoogieDeclarations]: Found specification of procedure hid_hw_request [2022-07-20 03:56:19,969 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_hw_request [2022-07-20 03:56:19,969 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2022-07-20 03:56:19,969 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2022-07-20 03:56:19,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-20 03:56:19,969 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-20 03:56:19,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-20 03:56:19,970 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-20 03:56:19,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-20 03:56:19,970 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_put_interface_no_suspend [2022-07-20 03:56:19,970 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_put_interface_no_suspend [2022-07-20 03:56:19,970 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_get_interface_no_resume [2022-07-20 03:56:19,970 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_get_interface_no_resume [2022-07-20 03:56:19,970 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_disconnect [2022-07-20 03:56:19,970 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_disconnect [2022-07-20 03:56:19,971 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unlink_urb [2022-07-20 03:56:19,971 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unlink_urb [2022-07-20 03:56:19,971 INFO L130 BoogieDeclarations]: Found specification of procedure hid_destroy_device [2022-07-20 03:56:19,971 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_destroy_device [2022-07-20 03:56:19,971 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_usb_free_coherent [2022-07-20 03:56:19,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_usb_free_coherent [2022-07-20 03:56:19,971 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_open [2022-07-20 03:56:19,971 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_open [2022-07-20 03:56:19,971 INFO L130 BoogieDeclarations]: Found specification of procedure up_write [2022-07-20 03:56:19,972 INFO L138 BoogieDeclarations]: Found implementation of procedure up_write [2022-07-20 03:56:19,972 INFO L130 BoogieDeclarations]: Found specification of procedure pidff_rescale [2022-07-20 03:56:19,972 INFO L138 BoogieDeclarations]: Found implementation of procedure pidff_rescale [2022-07-20 03:56:19,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-20 03:56:19,972 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-20 03:56:19,972 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-20 03:56:19,972 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-20 03:56:19,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-20 03:56:19,972 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_close [2022-07-20 03:56:19,973 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_close [2022-07-20 03:56:19,973 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-20 03:56:19,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-20 03:56:19,973 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dispatch_instance_register_7_2 [2022-07-20 03:56:19,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dispatch_instance_register_7_2 [2022-07-20 03:56:19,973 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-20 03:56:19,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-20 03:56:19,973 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_get_interface_async [2022-07-20 03:56:19,973 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_get_interface_async [2022-07-20 03:56:19,974 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-20 03:56:19,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-20 03:56:19,974 INFO L130 BoogieDeclarations]: Found specification of procedure pidff_find_fields [2022-07-20 03:56:19,974 INFO L138 BoogieDeclarations]: Found implementation of procedure pidff_find_fields [2022-07-20 03:56:19,974 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-20 03:56:19,974 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-20 03:56:19,974 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_quirks_exit [2022-07-20 03:56:19,974 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_quirks_exit [2022-07-20 03:56:19,974 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-20 03:56:19,975 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-20 03:56:19,975 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_restart_queues [2022-07-20 03:56:19,975 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_restart_queues [2022-07-20 03:56:19,975 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-20 03:56:19,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-20 03:56:19,975 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_int_urb [2022-07-20 03:56:19,975 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_int_urb [2022-07-20 03:56:19,975 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-20 03:56:19,975 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-20 03:56:19,976 INFO L130 BoogieDeclarations]: Found specification of procedure hid_device_io_stop [2022-07-20 03:56:19,976 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_device_io_stop [2022-07-20 03:56:19,976 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-20 03:56:19,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-20 03:56:19,976 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_start [2022-07-20 03:56:19,976 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_start [2022-07-20 03:56:19,976 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-20 03:56:19,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-20 03:56:19,976 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2022-07-20 03:56:19,977 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2022-07-20 03:56:19,977 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2022-07-20 03:56:19,977 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2022-07-20 03:56:19,977 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_list_lock_of_hiddev [2022-07-20 03:56:19,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_list_lock_of_hiddev [2022-07-20 03:56:19,977 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-20 03:56:19,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-20 03:56:19,977 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_work [2022-07-20 03:56:19,977 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_work [2022-07-20 03:56:19,978 INFO L130 BoogieDeclarations]: Found specification of procedure hid_pre_reset [2022-07-20 03:56:19,978 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_pre_reset [2022-07-20 03:56:19,978 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-20 03:56:19,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-20 03:56:19,978 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_list_lock_of_hiddev [2022-07-20 03:56:19,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_list_lock_of_hiddev [2022-07-20 03:56:19,978 INFO L130 BoogieDeclarations]: Found specification of procedure msecs_to_jiffies [2022-07-20 03:56:19,978 INFO L138 BoogieDeclarations]: Found implementation of procedure msecs_to_jiffies [2022-07-20 03:56:19,978 INFO L130 BoogieDeclarations]: Found specification of procedure hid_post_reset [2022-07-20 03:56:19,979 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_post_reset [2022-07-20 03:56:19,979 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_get_power [2022-07-20 03:56:19,979 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_get_power [2022-07-20 03:56:19,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 03:56:19,979 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_irq_119 [2022-07-20 03:56:19,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_irq_119 [2022-07-20 03:56:20,882 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 03:56:20,886 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 03:56:21,111 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-20 03:56:33,393 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 03:56:33,414 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 03:56:33,415 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-20 03:56:33,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 03:56:33 BoogieIcfgContainer [2022-07-20 03:56:33,419 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 03:56:33,420 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 03:56:33,421 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 03:56:33,423 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 03:56:33,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 03:56:14" (1/3) ... [2022-07-20 03:56:33,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f55a19f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 03:56:33, skipping insertion in model container [2022-07-20 03:56:33,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:56:19" (2/3) ... [2022-07-20 03:56:33,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f55a19f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 03:56:33, skipping insertion in model container [2022-07-20 03:56:33,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 03:56:33" (3/3) ... [2022-07-20 03:56:33,425 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i [2022-07-20 03:56:33,435 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 03:56:33,435 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 33 error locations. [2022-07-20 03:56:33,503 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 03:56:33,507 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@59f2081a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@ab62292 [2022-07-20 03:56:33,507 INFO L358 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2022-07-20 03:56:33,517 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-20 03:56:33,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-20 03:56:33,523 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:56:33,524 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-20 03:56:33,524 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-20 03:56:33,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:56:33,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1407426503, now seen corresponding path program 1 times [2022-07-20 03:56:33,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:56:33,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168759715] [2022-07-20 03:56:33,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:56:33,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:56:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:34,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:56:34,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:34,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-20 03:56:34,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:34,156 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-20 03:56:34,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:56:34,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168759715] [2022-07-20 03:56:34,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168759715] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:56:34,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:56:34,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:56:34,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76048714] [2022-07-20 03:56:34,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:56:34,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:56:34,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:56:34,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:56:34,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:56:34,192 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-20 03:56:36,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:56:36,792 INFO L93 Difference]: Finished difference Result 6251 states and 8986 transitions. [2022-07-20 03:56:36,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:56:36,794 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-20 03:56:36,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:56:36,834 INFO L225 Difference]: With dead ends: 6251 [2022-07-20 03:56:36,834 INFO L226 Difference]: Without dead ends: 3209 [2022-07-20 03:56:36,860 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-20 03:56:36,867 INFO L413 NwaCegarLoop]: 4226 mSDtfsCounter, 4134 mSDsluCounter, 11398 mSDsCounter, 0 mSdLazyCounter, 1542 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4143 SdHoareTripleChecker+Valid, 15624 SdHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-20 03:56:36,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4143 Valid, 15624 Invalid, 1544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1542 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-20 03:56:36,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3209 states. [2022-07-20 03:56:37,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3209 to 3189. [2022-07-20 03:56:37,026 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-20 03:56:37,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3189 states to 3189 states and 4370 transitions. [2022-07-20 03:56:37,047 INFO L78 Accepts]: Start accepts. Automaton has 3189 states and 4370 transitions. Word has length 30 [2022-07-20 03:56:37,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:56:37,047 INFO L495 AbstractCegarLoop]: Abstraction has 3189 states and 4370 transitions. [2022-07-20 03:56:37,047 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-20 03:56:37,048 INFO L276 IsEmpty]: Start isEmpty. Operand 3189 states and 4370 transitions. [2022-07-20 03:56:37,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-20 03:56:37,049 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:56:37,049 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-20 03:56:37,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 03:56:37,050 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-20 03:56:37,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:56:37,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1407486085, now seen corresponding path program 1 times [2022-07-20 03:56:37,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:56:37,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684557774] [2022-07-20 03:56:37,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:56:37,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:56:37,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:37,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:56:37,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:37,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-20 03:56:37,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:37,309 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-20 03:56:37,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:56:37,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684557774] [2022-07-20 03:56:37,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684557774] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:56:37,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:56:37,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 03:56:37,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821182994] [2022-07-20 03:56:37,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:56:37,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 03:56:37,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:56:37,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 03:56:37,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 03:56:37,312 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-20 03:56:37,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:56:37,399 INFO L93 Difference]: Finished difference Result 3196 states and 4377 transitions. [2022-07-20 03:56:37,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 03:56:37,399 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-20 03:56:37,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:56:37,416 INFO L225 Difference]: With dead ends: 3196 [2022-07-20 03:56:37,416 INFO L226 Difference]: Without dead ends: 3194 [2022-07-20 03:56:37,419 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-20 03:56:37,420 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-20 03:56:37,420 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-20 03:56:37,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3194 states. [2022-07-20 03:56:37,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3194 to 3191. [2022-07-20 03:56:37,497 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-20 03:56:37,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3191 states to 3191 states and 4371 transitions. [2022-07-20 03:56:37,514 INFO L78 Accepts]: Start accepts. Automaton has 3191 states and 4371 transitions. Word has length 30 [2022-07-20 03:56:37,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:56:37,514 INFO L495 AbstractCegarLoop]: Abstraction has 3191 states and 4371 transitions. [2022-07-20 03:56:37,515 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-20 03:56:37,515 INFO L276 IsEmpty]: Start isEmpty. Operand 3191 states and 4371 transitions. [2022-07-20 03:56:37,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-20 03:56:37,516 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:56:37,516 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-20 03:56:37,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 03:56:37,516 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-20 03:56:37,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:56:37,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1476967390, now seen corresponding path program 1 times [2022-07-20 03:56:37,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:56:37,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202270270] [2022-07-20 03:56:37,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:56:37,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:56:37,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:37,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:56:37,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:37,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-20 03:56:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:37,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:56:37,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:37,720 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-20 03:56:37,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:56:37,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202270270] [2022-07-20 03:56:37,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202270270] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:56:37,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:56:37,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 03:56:37,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387614583] [2022-07-20 03:56:37,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:56:37,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 03:56:37,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:56:37,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 03:56:37,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 03:56:37,722 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-20 03:56:37,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:56:37,819 INFO L93 Difference]: Finished difference Result 6371 states and 8827 transitions. [2022-07-20 03:56:37,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 03:56:37,820 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-20 03:56:37,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:56:37,837 INFO L225 Difference]: With dead ends: 6371 [2022-07-20 03:56:37,837 INFO L226 Difference]: Without dead ends: 3185 [2022-07-20 03:56:37,852 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-20 03:56:37,852 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-20 03:56:37,853 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-20 03:56:37,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3185 states. [2022-07-20 03:56:37,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3185 to 3185. [2022-07-20 03:56:37,934 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-20 03:56:37,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3185 states to 3185 states and 4362 transitions. [2022-07-20 03:56:37,949 INFO L78 Accepts]: Start accepts. Automaton has 3185 states and 4362 transitions. Word has length 37 [2022-07-20 03:56:37,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:56:37,949 INFO L495 AbstractCegarLoop]: Abstraction has 3185 states and 4362 transitions. [2022-07-20 03:56:37,949 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-20 03:56:37,950 INFO L276 IsEmpty]: Start isEmpty. Operand 3185 states and 4362 transitions. [2022-07-20 03:56:37,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-20 03:56:37,951 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:56:37,951 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-20 03:56:37,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 03:56:37,952 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-20 03:56:37,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:56:37,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1976461436, now seen corresponding path program 1 times [2022-07-20 03:56:37,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:56:37,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223140870] [2022-07-20 03:56:37,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:56:37,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:56:38,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:38,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:56:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:38,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 03:56:38,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:38,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-20 03:56:38,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:38,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 03:56:38,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:38,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:56:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:38,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 03:56:38,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:38,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-20 03:56:38,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:38,269 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-20 03:56:38,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:56:38,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223140870] [2022-07-20 03:56:38,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223140870] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:56:38,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:56:38,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:56:38,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072756426] [2022-07-20 03:56:38,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:56:38,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:56:38,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:56:38,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:56:38,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:56:38,272 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-20 03:56:45,689 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:56:50,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:56:50,790 INFO L93 Difference]: Finished difference Result 6479 states and 8906 transitions. [2022-07-20 03:56:50,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:56:50,791 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-20 03:56:50,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:56:50,808 INFO L225 Difference]: With dead ends: 6479 [2022-07-20 03:56:50,808 INFO L226 Difference]: Without dead ends: 3619 [2022-07-20 03:56:50,820 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-20 03:56:50,822 INFO L413 NwaCegarLoop]: 3823 mSDtfsCounter, 5469 mSDsluCounter, 2111 mSDsCounter, 0 mSdLazyCounter, 7804 mSolverCounterSat, 3285 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5619 SdHoareTripleChecker+Valid, 5934 SdHoareTripleChecker+Invalid, 11090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3285 IncrementalHoareTripleChecker+Valid, 7804 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2022-07-20 03:56:50,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5619 Valid, 5934 Invalid, 11090 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3285 Valid, 7804 Invalid, 1 Unknown, 0 Unchecked, 12.1s Time] [2022-07-20 03:56:50,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3619 states. [2022-07-20 03:56:50,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3619 to 3185. [2022-07-20 03:56:50,938 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-20 03:56:50,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3185 states to 3185 states and 4361 transitions. [2022-07-20 03:56:50,950 INFO L78 Accepts]: Start accepts. Automaton has 3185 states and 4361 transitions. Word has length 55 [2022-07-20 03:56:50,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:56:50,951 INFO L495 AbstractCegarLoop]: Abstraction has 3185 states and 4361 transitions. [2022-07-20 03:56:50,952 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-20 03:56:50,952 INFO L276 IsEmpty]: Start isEmpty. Operand 3185 states and 4361 transitions. [2022-07-20 03:56:50,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-20 03:56:50,957 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:56:50,958 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-20 03:56:50,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 03:56:50,958 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-20 03:56:50,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:56:50,959 INFO L85 PathProgramCache]: Analyzing trace with hash 162297118, now seen corresponding path program 1 times [2022-07-20 03:56:50,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:56:50,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465767019] [2022-07-20 03:56:50,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:56:50,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:56:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:51,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:56:51,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:51,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-20 03:56:51,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:51,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 03:56:51,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:51,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-20 03:56:51,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:51,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 03:56:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:51,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-20 03:56:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:51,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:56:51,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:51,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:56:51,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:51,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 03:56:51,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:51,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 03:56:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:51,308 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-20 03:56:51,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:56:51,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465767019] [2022-07-20 03:56:51,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465767019] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:56:51,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:56:51,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:56:51,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277402726] [2022-07-20 03:56:51,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:56:51,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:56:51,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:56:51,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:56:51,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:56:51,311 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-20 03:56:56,457 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-20 03:56:59,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:56:59,843 INFO L93 Difference]: Finished difference Result 3185 states and 4361 transitions. [2022-07-20 03:56:59,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:56:59,843 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-20 03:56:59,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:56:59,859 INFO L225 Difference]: With dead ends: 3185 [2022-07-20 03:56:59,859 INFO L226 Difference]: Without dead ends: 3183 [2022-07-20 03:56:59,862 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-20 03:56:59,862 INFO L413 NwaCegarLoop]: 3591 mSDtfsCounter, 6952 mSDsluCounter, 1870 mSDsCounter, 0 mSdLazyCounter, 4352 mSolverCounterSat, 3728 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7147 SdHoareTripleChecker+Valid, 5461 SdHoareTripleChecker+Invalid, 8081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3728 IncrementalHoareTripleChecker+Valid, 4352 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-07-20 03:56:59,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7147 Valid, 5461 Invalid, 8081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3728 Valid, 4352 Invalid, 1 Unknown, 0 Unchecked, 8.3s Time] [2022-07-20 03:56:59,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3183 states. [2022-07-20 03:56:59,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3183 to 3183. [2022-07-20 03:56:59,953 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-20 03:56:59,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 3183 states and 4359 transitions. [2022-07-20 03:56:59,963 INFO L78 Accepts]: Start accepts. Automaton has 3183 states and 4359 transitions. Word has length 77 [2022-07-20 03:56:59,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:56:59,964 INFO L495 AbstractCegarLoop]: Abstraction has 3183 states and 4359 transitions. [2022-07-20 03:56:59,964 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-20 03:56:59,964 INFO L276 IsEmpty]: Start isEmpty. Operand 3183 states and 4359 transitions. [2022-07-20 03:56:59,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-20 03:56:59,966 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:56:59,966 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-20 03:56:59,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 03:56:59,966 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-20 03:56:59,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:56:59,967 INFO L85 PathProgramCache]: Analyzing trace with hash -2088716267, now seen corresponding path program 1 times [2022-07-20 03:56:59,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:56:59,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884140258] [2022-07-20 03:56:59,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:56:59,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:57:00,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:00,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:57:00,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:00,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-20 03:57:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:00,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 03:57:00,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:00,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-20 03:57:00,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:00,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 03:57:00,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:00,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-20 03:57:00,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:00,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:57:00,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:00,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:57:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:00,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 03:57:00,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:00,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 03:57:00,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:00,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 03:57:00,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:00,276 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-20 03:57:00,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:57:00,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884140258] [2022-07-20 03:57:00,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884140258] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:57:00,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:57:00,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:57:00,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511280300] [2022-07-20 03:57:00,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:57:00,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:57:00,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:57:00,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:57:00,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:57:00,279 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-20 03:57:08,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:57:08,087 INFO L93 Difference]: Finished difference Result 3183 states and 4359 transitions. [2022-07-20 03:57:08,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:57:08,088 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-20 03:57:08,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:57:08,103 INFO L225 Difference]: With dead ends: 3183 [2022-07-20 03:57:08,103 INFO L226 Difference]: Without dead ends: 3181 [2022-07-20 03:57:08,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 03:57:08,106 INFO L413 NwaCegarLoop]: 3589 mSDtfsCounter, 6946 mSDsluCounter, 1870 mSDsCounter, 0 mSdLazyCounter, 4351 mSolverCounterSat, 3728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.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, 4351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-07-20 03:57:08,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7140 Valid, 5459 Invalid, 8079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3728 Valid, 4351 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2022-07-20 03:57:08,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3181 states. [2022-07-20 03:57:08,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3181 to 3181. [2022-07-20 03:57:08,196 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-20 03:57:08,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 4357 transitions. [2022-07-20 03:57:08,207 INFO L78 Accepts]: Start accepts. Automaton has 3181 states and 4357 transitions. Word has length 83 [2022-07-20 03:57:08,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:57:08,207 INFO L495 AbstractCegarLoop]: Abstraction has 3181 states and 4357 transitions. [2022-07-20 03:57:08,207 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-20 03:57:08,208 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 4357 transitions. [2022-07-20 03:57:08,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-20 03:57:08,208 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:57:08,209 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-20 03:57:08,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 03:57:08,209 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-20 03:57:08,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:57:08,209 INFO L85 PathProgramCache]: Analyzing trace with hash 257795529, now seen corresponding path program 1 times [2022-07-20 03:57:08,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:57:08,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634439422] [2022-07-20 03:57:08,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:57:08,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:57:08,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:08,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:57:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:08,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-20 03:57:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:08,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 03:57:08,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:08,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-20 03:57:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:08,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 03:57:08,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:08,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-20 03:57:08,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:08,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:57:08,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:08,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:57:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:08,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 03:57:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:08,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 03:57:08,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:08,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 03:57:08,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:08,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 03:57:08,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:08,573 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-20 03:57:08,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:57:08,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634439422] [2022-07-20 03:57:08,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634439422] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:57:08,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:57:08,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:57:08,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533607706] [2022-07-20 03:57:08,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:57:08,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:57:08,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:57:08,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:57:08,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:57:08,575 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-20 03:57:15,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:57:15,998 INFO L93 Difference]: Finished difference Result 3181 states and 4357 transitions. [2022-07-20 03:57:15,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:57:15,999 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-20 03:57:15,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:57:16,015 INFO L225 Difference]: With dead ends: 3181 [2022-07-20 03:57:16,015 INFO L226 Difference]: Without dead ends: 3179 [2022-07-20 03:57:16,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 03:57:16,019 INFO L413 NwaCegarLoop]: 3587 mSDtfsCounter, 6940 mSDsluCounter, 1870 mSDsCounter, 0 mSdLazyCounter, 4349 mSolverCounterSat, 3728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s 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.1s IncrementalHoareTripleChecker+Time [2022-07-20 03:57:16,019 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.1s Time] [2022-07-20 03:57:16,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3179 states. [2022-07-20 03:57:16,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3179 to 3179. [2022-07-20 03:57:16,120 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-20 03:57:16,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3179 states to 3179 states and 4355 transitions. [2022-07-20 03:57:16,132 INFO L78 Accepts]: Start accepts. Automaton has 3179 states and 4355 transitions. Word has length 89 [2022-07-20 03:57:16,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:57:16,133 INFO L495 AbstractCegarLoop]: Abstraction has 3179 states and 4355 transitions. [2022-07-20 03:57:16,133 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-20 03:57:16,133 INFO L276 IsEmpty]: Start isEmpty. Operand 3179 states and 4355 transitions. [2022-07-20 03:57:16,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-20 03:57:16,136 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:57:16,136 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-20 03:57:16,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 03:57:16,137 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-20 03:57:16,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:57:16,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1869749641, now seen corresponding path program 1 times [2022-07-20 03:57:16,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:57:16,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472416361] [2022-07-20 03:57:16,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:57:16,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:57:16,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:16,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:57:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:16,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-20 03:57:16,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:16,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 03:57:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:16,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-20 03:57:16,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:16,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 03:57:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:16,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-20 03:57:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:16,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:57:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:16,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:57:16,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:16,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 03:57:16,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:16,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 03:57:16,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:16,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 03:57:16,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:16,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 03:57:16,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:16,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 03:57:16,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:16,477 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-20 03:57:16,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:57:16,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472416361] [2022-07-20 03:57:16,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472416361] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:57:16,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:57:16,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:57:16,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530406802] [2022-07-20 03:57:16,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:57:16,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:57:16,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:57:16,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:57:16,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:57:16,480 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-20 03:57:24,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:57:24,731 INFO L93 Difference]: Finished difference Result 3179 states and 4355 transitions. [2022-07-20 03:57:24,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:57:24,732 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-20 03:57:24,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:57:24,746 INFO L225 Difference]: With dead ends: 3179 [2022-07-20 03:57:24,746 INFO L226 Difference]: Without dead ends: 3177 [2022-07-20 03:57:24,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 03:57:24,749 INFO L413 NwaCegarLoop]: 3585 mSDtfsCounter, 6934 mSDsluCounter, 1870 mSDsCounter, 0 mSdLazyCounter, 4347 mSolverCounterSat, 3728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7126 SdHoareTripleChecker+Valid, 5455 SdHoareTripleChecker+Invalid, 8075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3728 IncrementalHoareTripleChecker+Valid, 4347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-07-20 03:57:24,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7126 Valid, 5455 Invalid, 8075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3728 Valid, 4347 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2022-07-20 03:57:24,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3177 states. [2022-07-20 03:57:24,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3177 to 3177. [2022-07-20 03:57:24,871 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-20 03:57:24,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3177 states to 3177 states and 4353 transitions. [2022-07-20 03:57:24,881 INFO L78 Accepts]: Start accepts. Automaton has 3177 states and 4353 transitions. Word has length 95 [2022-07-20 03:57:24,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:57:24,881 INFO L495 AbstractCegarLoop]: Abstraction has 3177 states and 4353 transitions. [2022-07-20 03:57:24,882 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-20 03:57:24,882 INFO L276 IsEmpty]: Start isEmpty. Operand 3177 states and 4353 transitions. [2022-07-20 03:57:24,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-20 03:57:24,883 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:57:24,883 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-20 03:57:24,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 03:57:24,883 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-20 03:57:24,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:57:24,884 INFO L85 PathProgramCache]: Analyzing trace with hash 500393985, now seen corresponding path program 1 times [2022-07-20 03:57:24,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:57:24,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478335151] [2022-07-20 03:57:24,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:57:24,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:57:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:25,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:57:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:25,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-20 03:57:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:25,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 03:57:25,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:25,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-20 03:57:25,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:25,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 03:57:25,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:25,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-20 03:57:25,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:25,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:57:25,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:25,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:57:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:25,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 03:57:25,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:25,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 03:57:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:25,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 03:57:25,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:25,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 03:57:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:25,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 03:57:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:25,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 03:57:25,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:25,246 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-20 03:57:25,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:57:25,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478335151] [2022-07-20 03:57:25,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478335151] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:57:25,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:57:25,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:57:25,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692406116] [2022-07-20 03:57:25,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:57:25,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:57:25,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:57:25,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:57:25,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:57:25,249 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-20 03:57:30,011 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:57:34,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:57:34,244 INFO L93 Difference]: Finished difference Result 3177 states and 4353 transitions. [2022-07-20 03:57:34,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:57:34,245 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-20 03:57:34,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:57:34,258 INFO L225 Difference]: With dead ends: 3177 [2022-07-20 03:57:34,258 INFO L226 Difference]: Without dead ends: 3175 [2022-07-20 03:57:34,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 03:57:34,261 INFO L413 NwaCegarLoop]: 3583 mSDtfsCounter, 6928 mSDsluCounter, 1870 mSDsCounter, 0 mSdLazyCounter, 4345 mSolverCounterSat, 3728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s 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, 8.7s IncrementalHoareTripleChecker+Time [2022-07-20 03:57:34,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7119 Valid, 5453 Invalid, 8073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3728 Valid, 4345 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2022-07-20 03:57:34,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3175 states. [2022-07-20 03:57:34,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3175 to 3175. [2022-07-20 03:57:34,358 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-20 03:57:34,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3175 states to 3175 states and 4351 transitions. [2022-07-20 03:57:34,367 INFO L78 Accepts]: Start accepts. Automaton has 3175 states and 4351 transitions. Word has length 101 [2022-07-20 03:57:34,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:57:34,368 INFO L495 AbstractCegarLoop]: Abstraction has 3175 states and 4351 transitions. [2022-07-20 03:57:34,368 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-20 03:57:34,368 INFO L276 IsEmpty]: Start isEmpty. Operand 3175 states and 4351 transitions. [2022-07-20 03:57:34,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-20 03:57:34,369 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:57:34,369 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-20 03:57:34,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 03:57:34,370 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-20 03:57:34,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:57:34,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1002834405, now seen corresponding path program 1 times [2022-07-20 03:57:34,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:57:34,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6000130] [2022-07-20 03:57:34,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:57:34,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:57:34,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:34,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:57:34,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:34,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-20 03:57:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:34,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 03:57:34,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:34,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-20 03:57:34,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:34,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 03:57:34,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:34,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-20 03:57:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:34,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:57:34,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:34,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:57:34,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:34,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 03:57:34,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:34,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 03:57:34,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:34,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 03:57:34,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:34,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 03:57:34,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:34,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 03:57:34,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:34,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 03:57:34,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:34,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 03:57:34,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:34,705 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-20 03:57:34,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:57:34,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6000130] [2022-07-20 03:57:34,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6000130] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:57:34,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:57:34,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:57:34,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111003016] [2022-07-20 03:57:34,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:57:34,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:57:34,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:57:34,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:57:34,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:57:34,708 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-20 03:57:42,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:57:42,941 INFO L93 Difference]: Finished difference Result 3175 states and 4351 transitions. [2022-07-20 03:57:42,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:57:42,942 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-20 03:57:42,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:57:42,955 INFO L225 Difference]: With dead ends: 3175 [2022-07-20 03:57:42,955 INFO L226 Difference]: Without dead ends: 3173 [2022-07-20 03:57:42,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 03:57:42,958 INFO L413 NwaCegarLoop]: 3581 mSDtfsCounter, 6922 mSDsluCounter, 1870 mSDsCounter, 0 mSdLazyCounter, 4343 mSolverCounterSat, 3728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s 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, 7.9s IncrementalHoareTripleChecker+Time [2022-07-20 03:57:42,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7112 Valid, 5451 Invalid, 8071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3728 Valid, 4343 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2022-07-20 03:57:42,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3173 states. [2022-07-20 03:57:43,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3173 to 3173. [2022-07-20 03:57:43,064 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-20 03:57:43,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3173 states to 3173 states and 4349 transitions. [2022-07-20 03:57:43,075 INFO L78 Accepts]: Start accepts. Automaton has 3173 states and 4349 transitions. Word has length 107 [2022-07-20 03:57:43,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:57:43,075 INFO L495 AbstractCegarLoop]: Abstraction has 3173 states and 4349 transitions. [2022-07-20 03:57:43,075 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-20 03:57:43,075 INFO L276 IsEmpty]: Start isEmpty. Operand 3173 states and 4349 transitions. [2022-07-20 03:57:43,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-20 03:57:43,079 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:57:43,079 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-20 03:57:43,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 03:57:43,080 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-20 03:57:43,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:57:43,080 INFO L85 PathProgramCache]: Analyzing trace with hash -379953983, now seen corresponding path program 1 times [2022-07-20 03:57:43,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:57:43,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979549231] [2022-07-20 03:57:43,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:57:43,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:57:43,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:43,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:57:43,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:43,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-20 03:57:43,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:43,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 03:57:43,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:43,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-20 03:57:43,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:43,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 03:57:43,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:43,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-20 03:57:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:43,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:57:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:43,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:57:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:43,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 03:57:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:43,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 03:57:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:43,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 03:57:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:43,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 03:57:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:43,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 03:57:43,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:43,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 03:57:43,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:43,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 03:57:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:43,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 03:57:43,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:43,532 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-20 03:57:43,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:57:43,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979549231] [2022-07-20 03:57:43,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979549231] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:57:43,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:57:43,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:57:43,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564465469] [2022-07-20 03:57:43,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:57:43,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:57:43,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:57:43,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:57:43,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:57:43,535 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-20 03:57:49,016 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-20 03:57:53,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:57:53,137 INFO L93 Difference]: Finished difference Result 3173 states and 4349 transitions. [2022-07-20 03:57:53,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:57:53,138 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-20 03:57:53,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:57:53,148 INFO L225 Difference]: With dead ends: 3173 [2022-07-20 03:57:53,148 INFO L226 Difference]: Without dead ends: 3171 [2022-07-20 03:57:53,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 03:57:53,151 INFO L413 NwaCegarLoop]: 3579 mSDtfsCounter, 6916 mSDsluCounter, 1870 mSDsCounter, 0 mSdLazyCounter, 4340 mSolverCounterSat, 3728 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7105 SdHoareTripleChecker+Valid, 5449 SdHoareTripleChecker+Invalid, 8069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3728 IncrementalHoareTripleChecker+Valid, 4340 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2022-07-20 03:57:53,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7105 Valid, 5449 Invalid, 8069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3728 Valid, 4340 Invalid, 1 Unknown, 0 Unchecked, 9.3s Time] [2022-07-20 03:57:53,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3171 states. [2022-07-20 03:57:53,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3171 to 3171. [2022-07-20 03:57:53,266 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-20 03:57:53,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3171 states to 3171 states and 4347 transitions. [2022-07-20 03:57:53,277 INFO L78 Accepts]: Start accepts. Automaton has 3171 states and 4347 transitions. Word has length 113 [2022-07-20 03:57:53,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:57:53,277 INFO L495 AbstractCegarLoop]: Abstraction has 3171 states and 4347 transitions. [2022-07-20 03:57:53,278 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-20 03:57:53,278 INFO L276 IsEmpty]: Start isEmpty. Operand 3171 states and 4347 transitions. [2022-07-20 03:57:53,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-20 03:57:53,280 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:57:53,280 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-20 03:57:53,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 03:57:53,281 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-20 03:57:53,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:57:53,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1159146525, now seen corresponding path program 1 times [2022-07-20 03:57:53,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:57:53,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650586287] [2022-07-20 03:57:53,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:57:53,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:57:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:53,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:57:53,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:53,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-20 03:57:53,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:53,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 03:57:53,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:53,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-20 03:57:53,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:53,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 03:57:53,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:53,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-20 03:57:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:53,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:57:53,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:53,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:57:53,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:53,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 03:57:53,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:53,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 03:57:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:53,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 03:57:53,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:53,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 03:57:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:53,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 03:57:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:53,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 03:57:53,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:53,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 03:57:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:53,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 03:57:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:53,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 03:57:53,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:53,654 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-20 03:57:53,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:57:53,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650586287] [2022-07-20 03:57:53,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650586287] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:57:53,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:57:53,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:57:53,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218172507] [2022-07-20 03:57:53,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:57:53,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:57:53,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:57:53,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:57:53,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:57:53,657 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-20 03:58:01,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:58:01,944 INFO L93 Difference]: Finished difference Result 3171 states and 4347 transitions. [2022-07-20 03:58:01,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:58:01,945 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-20 03:58:01,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:58:01,956 INFO L225 Difference]: With dead ends: 3171 [2022-07-20 03:58:01,956 INFO L226 Difference]: Without dead ends: 3169 [2022-07-20 03:58:01,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 03:58:01,959 INFO L413 NwaCegarLoop]: 3577 mSDtfsCounter, 6914 mSDsluCounter, 1870 mSDsCounter, 0 mSdLazyCounter, 4335 mSolverCounterSat, 3728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s 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, 8.0s IncrementalHoareTripleChecker+Time [2022-07-20 03:58:01,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7102 Valid, 5447 Invalid, 8063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3728 Valid, 4335 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2022-07-20 03:58:01,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3169 states. [2022-07-20 03:58:02,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3169 to 3169. [2022-07-20 03:58:02,131 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-20 03:58:02,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3169 states to 3169 states and 4345 transitions. [2022-07-20 03:58:02,140 INFO L78 Accepts]: Start accepts. Automaton has 3169 states and 4345 transitions. Word has length 119 [2022-07-20 03:58:02,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:58:02,141 INFO L495 AbstractCegarLoop]: Abstraction has 3169 states and 4345 transitions. [2022-07-20 03:58:02,141 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-20 03:58:02,141 INFO L276 IsEmpty]: Start isEmpty. Operand 3169 states and 4345 transitions. [2022-07-20 03:58:02,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-20 03:58:02,142 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:58:02,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] [2022-07-20 03:58:02,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-20 03:58:02,143 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-20 03:58:02,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:58:02,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1543506560, now seen corresponding path program 1 times [2022-07-20 03:58:02,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:58:02,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325943787] [2022-07-20 03:58:02,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:58:02,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:58:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:02,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:58:02,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:02,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-20 03:58:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:02,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 03:58:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:02,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-20 03:58:02,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:02,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 03:58:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:02,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-20 03:58:02,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:02,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:58:02,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:02,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:58:02,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:02,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 03:58:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:02,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 03:58:02,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:02,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 03:58:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:02,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 03:58:02,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:02,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 03:58:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:02,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 03:58:02,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:02,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 03:58:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:02,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 03:58:02,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:02,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 03:58:02,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:02,458 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-20 03:58:02,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:58:02,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325943787] [2022-07-20 03:58:02,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325943787] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:58:02,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:58:02,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:58:02,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608741356] [2022-07-20 03:58:02,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:58:02,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:58:02,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:58:02,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:58:02,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:58:02,461 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-20 03:58:07,229 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:58:10,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:58:10,838 INFO L93 Difference]: Finished difference Result 3169 states and 4345 transitions. [2022-07-20 03:58:10,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:58:10,839 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-20 03:58:10,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:58:10,849 INFO L225 Difference]: With dead ends: 3169 [2022-07-20 03:58:10,850 INFO L226 Difference]: Without dead ends: 3167 [2022-07-20 03:58:10,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 03:58:10,852 INFO L413 NwaCegarLoop]: 3575 mSDtfsCounter, 6902 mSDsluCounter, 1870 mSDsCounter, 0 mSdLazyCounter, 4337 mSolverCounterSat, 3728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7090 SdHoareTripleChecker+Valid, 5445 SdHoareTripleChecker+Invalid, 8065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3728 IncrementalHoareTripleChecker+Valid, 4337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-07-20 03:58:10,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7090 Valid, 5445 Invalid, 8065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3728 Valid, 4337 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2022-07-20 03:58:10,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3167 states. [2022-07-20 03:58:10,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3167 to 3167. [2022-07-20 03:58:10,955 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-20 03:58:10,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3167 states to 3167 states and 4343 transitions. [2022-07-20 03:58:10,965 INFO L78 Accepts]: Start accepts. Automaton has 3167 states and 4343 transitions. Word has length 121 [2022-07-20 03:58:10,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:58:10,965 INFO L495 AbstractCegarLoop]: Abstraction has 3167 states and 4343 transitions. [2022-07-20 03:58:10,965 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-20 03:58:10,965 INFO L276 IsEmpty]: Start isEmpty. Operand 3167 states and 4343 transitions. [2022-07-20 03:58:10,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-20 03:58:10,967 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:58:10,967 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-20 03:58:10,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-20 03:58:10,967 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-20 03:58:10,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:58:10,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1479640238, now seen corresponding path program 1 times [2022-07-20 03:58:10,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:58:10,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731084459] [2022-07-20 03:58:10,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:58:10,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:58:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:11,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:58:11,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:11,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-20 03:58:11,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:11,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 03:58:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:11,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-20 03:58:11,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:11,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 03:58:11,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:11,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-20 03:58:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:11,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:58:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:11,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:58:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:11,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 03:58:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:11,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 03:58:11,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:11,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 03:58:11,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:11,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 03:58:11,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:11,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 03:58:11,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:11,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 03:58:11,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:11,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 03:58:11,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:11,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 03:58:11,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:11,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 03:58:11,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:11,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-20 03:58:11,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:11,298 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-20 03:58:11,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:58:11,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731084459] [2022-07-20 03:58:11,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731084459] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:58:11,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:58:11,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:58:11,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635998339] [2022-07-20 03:58:11,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:58:11,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:58:11,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:58:11,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:58:11,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:58:11,301 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-20 03:58:19,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:58:19,108 INFO L93 Difference]: Finished difference Result 3167 states and 4343 transitions. [2022-07-20 03:58:19,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:58:19,109 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-20 03:58:19,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:58:19,119 INFO L225 Difference]: With dead ends: 3167 [2022-07-20 03:58:19,119 INFO L226 Difference]: Without dead ends: 3165 [2022-07-20 03:58:19,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 03:58:19,121 INFO L413 NwaCegarLoop]: 3573 mSDtfsCounter, 6898 mSDsluCounter, 1870 mSDsCounter, 0 mSdLazyCounter, 4335 mSolverCounterSat, 3728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s 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.5s IncrementalHoareTripleChecker+Time [2022-07-20 03:58:19,121 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.5s Time] [2022-07-20 03:58:19,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3165 states. [2022-07-20 03:58:19,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3165 to 3165. [2022-07-20 03:58:19,219 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-20 03:58:19,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3165 states to 3165 states and 4341 transitions. [2022-07-20 03:58:19,229 INFO L78 Accepts]: Start accepts. Automaton has 3165 states and 4341 transitions. Word has length 127 [2022-07-20 03:58:19,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:58:19,229 INFO L495 AbstractCegarLoop]: Abstraction has 3165 states and 4341 transitions. [2022-07-20 03:58:19,230 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-20 03:58:19,230 INFO L276 IsEmpty]: Start isEmpty. Operand 3165 states and 4341 transitions. [2022-07-20 03:58:19,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-20 03:58:19,231 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:58:19,232 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-20 03:58:19,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-20 03:58:19,232 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-20 03:58:19,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:58:19,232 INFO L85 PathProgramCache]: Analyzing trace with hash -762027428, now seen corresponding path program 1 times [2022-07-20 03:58:19,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:58:19,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203794448] [2022-07-20 03:58:19,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:58:19,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:58:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:19,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:58:19,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:19,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-20 03:58:19,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:19,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 03:58:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:19,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-20 03:58:19,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:19,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 03:58:19,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:19,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:58:19,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:19,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:58:19,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:19,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:58:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:19,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-20 03:58:19,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:19,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:58:19,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:19,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:58:19,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:19,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:58:19,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:19,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 03:58:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:19,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:58:19,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:19,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:58:19,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:19,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:58:19,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:19,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-20 03:58:19,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:19,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:58:19,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:19,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:58:19,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:19,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:58:19,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:19,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-20 03:58:19,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:19,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:58:19,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:19,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:58:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:19,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:58:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:19,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-20 03:58:19,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:19,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-20 03:58:19,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:19,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-20 03:58:19,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:19,705 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-20 03:58:19,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:58:19,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203794448] [2022-07-20 03:58:19,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203794448] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:58:19,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:58:19,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:58:19,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651093648] [2022-07-20 03:58:19,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:58:19,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:58:19,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:58:19,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:58:19,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:58:19,707 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-20 03:58:24,641 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:58:28,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:58:28,614 INFO L93 Difference]: Finished difference Result 6376 states and 8793 transitions. [2022-07-20 03:58:28,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 03:58:28,614 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-20 03:58:28,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:58:28,628 INFO L225 Difference]: With dead ends: 6376 [2022-07-20 03:58:28,628 INFO L226 Difference]: Without dead ends: 3371 [2022-07-20 03:58:28,639 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-20 03:58:28,640 INFO L413 NwaCegarLoop]: 3348 mSDtfsCounter, 8308 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 3161 mSolverCounterSat, 5262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8522 SdHoareTripleChecker+Valid, 4972 SdHoareTripleChecker+Invalid, 8423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5262 IncrementalHoareTripleChecker+Valid, 3161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2022-07-20 03:58:28,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8522 Valid, 4972 Invalid, 8423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5262 Valid, 3161 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2022-07-20 03:58:28,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3371 states. [2022-07-20 03:58:28,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3371 to 3170. [2022-07-20 03:58:28,758 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-20 03:58:28,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3170 states to 3170 states and 4348 transitions. [2022-07-20 03:58:28,769 INFO L78 Accepts]: Start accepts. Automaton has 3170 states and 4348 transitions. Word has length 168 [2022-07-20 03:58:28,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:58:28,770 INFO L495 AbstractCegarLoop]: Abstraction has 3170 states and 4348 transitions. [2022-07-20 03:58:28,770 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-20 03:58:28,770 INFO L276 IsEmpty]: Start isEmpty. Operand 3170 states and 4348 transitions. [2022-07-20 03:58:28,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-20 03:58:28,772 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:58:28,772 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-20 03:58:28,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-20 03:58:28,772 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-20 03:58:28,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:58:28,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1769654094, now seen corresponding path program 1 times [2022-07-20 03:58:28,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:58:28,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550962188] [2022-07-20 03:58:28,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:58:28,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:58:28,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:28,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:58:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:28,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-20 03:58:28,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:28,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 03:58:28,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:28,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-20 03:58:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:29,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 03:58:29,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:29,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-20 03:58:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:29,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:58:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:29,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:58:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:29,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 03:58:29,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:29,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 03:58:29,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:29,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 03:58:29,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:29,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 03:58:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:29,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 03:58:29,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:29,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 03:58:29,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:29,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 03:58:29,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:29,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 03:58:29,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:29,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 03:58:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:29,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-20 03:58:29,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:29,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 03:58:29,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:29,154 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-20 03:58:29,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:58:29,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550962188] [2022-07-20 03:58:29,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550962188] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:58:29,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:58:29,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:58:29,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701642239] [2022-07-20 03:58:29,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:58:29,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:58:29,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:58:29,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:58:29,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:58:29,157 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-20 03:58:37,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:58:37,322 INFO L93 Difference]: Finished difference Result 3170 states and 4348 transitions. [2022-07-20 03:58:37,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:58:37,323 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-20 03:58:37,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:58:37,332 INFO L225 Difference]: With dead ends: 3170 [2022-07-20 03:58:37,333 INFO L226 Difference]: Without dead ends: 3168 [2022-07-20 03:58:37,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 03:58:37,335 INFO L413 NwaCegarLoop]: 3566 mSDtfsCounter, 6887 mSDsluCounter, 1856 mSDsCounter, 0 mSdLazyCounter, 4332 mSolverCounterSat, 3728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s 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.9s IncrementalHoareTripleChecker+Time [2022-07-20 03:58:37,335 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.9s Time] [2022-07-20 03:58:37,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3168 states. [2022-07-20 03:58:37,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3168 to 3168. [2022-07-20 03:58:37,450 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-20 03:58:37,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3168 states to 3168 states and 4346 transitions. [2022-07-20 03:58:37,460 INFO L78 Accepts]: Start accepts. Automaton has 3168 states and 4346 transitions. Word has length 133 [2022-07-20 03:58:37,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:58:37,460 INFO L495 AbstractCegarLoop]: Abstraction has 3168 states and 4346 transitions. [2022-07-20 03:58:37,460 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-20 03:58:37,460 INFO L276 IsEmpty]: Start isEmpty. Operand 3168 states and 4346 transitions. [2022-07-20 03:58:37,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-07-20 03:58:37,462 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:58:37,462 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-20 03:58:37,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-20 03:58:37,462 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-20 03:58:37,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:58:37,463 INFO L85 PathProgramCache]: Analyzing trace with hash -65475925, now seen corresponding path program 1 times [2022-07-20 03:58:37,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:58:37,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120924959] [2022-07-20 03:58:37,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:58:37,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:58:37,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:37,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:58:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:37,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-20 03:58:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:37,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 03:58:37,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:37,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-20 03:58:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:37,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 03:58:37,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:37,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:58:37,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:37,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:58:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:37,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:58:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:37,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-20 03:58:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:37,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:58:37,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:37,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:58:37,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:37,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:58:37,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:37,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 03:58:37,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:37,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:58:37,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:37,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:58:37,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:37,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:58:37,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:37,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-20 03:58:37,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:37,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:58:37,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:37,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:58:37,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:37,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:58:37,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:37,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-20 03:58:37,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:37,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:58:37,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:37,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:58:37,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:37,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:58:37,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:37,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-20 03:58:37,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:37,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-20 03:58:37,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:37,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-20 03:58:37,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:37,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-20 03:58:37,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:37,959 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-20 03:58:37,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:58:37,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120924959] [2022-07-20 03:58:37,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120924959] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 03:58:37,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279789436] [2022-07-20 03:58:37,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:58:37,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 03:58:37,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 03:58:37,971 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 03:58:37,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-20 03:58:39,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:39,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 4430 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 03:58:39,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 03:58:39,326 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-20 03:58:39,327 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 03:58:39,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279789436] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:58:39,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 03:58:39,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-07-20 03:58:39,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090981372] [2022-07-20 03:58:39,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:58:39,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 03:58:39,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:58:39,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 03:58:39,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-20 03:58:39,329 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-20 03:58:39,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:58:39,507 INFO L93 Difference]: Finished difference Result 6251 states and 8554 transitions. [2022-07-20 03:58:39,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 03:58:39,508 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-20 03:58:39,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:58:39,517 INFO L225 Difference]: With dead ends: 6251 [2022-07-20 03:58:39,518 INFO L226 Difference]: Without dead ends: 3246 [2022-07-20 03:58:39,527 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-20 03:58:39,528 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-20 03:58:39,528 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-20 03:58:39,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3246 states. [2022-07-20 03:58:39,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3246 to 3243. [2022-07-20 03:58:39,649 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-20 03:58:39,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3243 states to 3243 states and 4434 transitions. [2022-07-20 03:58:39,659 INFO L78 Accepts]: Start accepts. Automaton has 3243 states and 4434 transitions. Word has length 174 [2022-07-20 03:58:39,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:58:39,660 INFO L495 AbstractCegarLoop]: Abstraction has 3243 states and 4434 transitions. [2022-07-20 03:58:39,660 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-20 03:58:39,660 INFO L276 IsEmpty]: Start isEmpty. Operand 3243 states and 4434 transitions. [2022-07-20 03:58:39,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-20 03:58:39,662 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:58:39,662 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-20 03:58:39,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-20 03:58:39,879 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-20 03:58:39,879 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-20 03:58:39,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:58:39,880 INFO L85 PathProgramCache]: Analyzing trace with hash 783970037, now seen corresponding path program 1 times [2022-07-20 03:58:39,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:58:39,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039669168] [2022-07-20 03:58:39,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:58:39,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:58:39,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:40,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:58:40,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:40,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-20 03:58:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:40,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 03:58:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:40,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-20 03:58:40,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:40,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 03:58:40,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:40,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-20 03:58:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:40,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:58:40,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:40,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:58:40,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:40,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 03:58:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:40,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 03:58:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:40,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 03:58:40,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:40,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 03:58:40,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:40,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 03:58:40,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:40,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 03:58:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:40,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 03:58:40,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:40,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 03:58:40,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:40,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 03:58:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:40,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-20 03:58:40,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:40,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 03:58:40,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:40,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 03:58:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:40,272 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-20 03:58:40,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:58:40,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039669168] [2022-07-20 03:58:40,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039669168] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:58:40,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:58:40,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:58:40,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242492136] [2022-07-20 03:58:40,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:58:40,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:58:40,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:58:40,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:58:40,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:58:40,274 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-20 03:58:45,993 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-20 03:58:49,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:58:49,406 INFO L93 Difference]: Finished difference Result 3243 states and 4434 transitions. [2022-07-20 03:58:49,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:58:49,407 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-20 03:58:49,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:58:49,416 INFO L225 Difference]: With dead ends: 3243 [2022-07-20 03:58:49,416 INFO L226 Difference]: Without dead ends: 3241 [2022-07-20 03:58:49,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 03:58:49,418 INFO L413 NwaCegarLoop]: 3559 mSDtfsCounter, 6876 mSDsluCounter, 1842 mSDsCounter, 0 mSdLazyCounter, 4328 mSolverCounterSat, 3728 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.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, 4328 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2022-07-20 03:58:49,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7061 Valid, 5401 Invalid, 8057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3728 Valid, 4328 Invalid, 1 Unknown, 0 Unchecked, 8.8s Time] [2022-07-20 03:58:49,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3241 states. [2022-07-20 03:58:49,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3241 to 3241. [2022-07-20 03:58:49,538 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-20 03:58:49,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 4432 transitions. [2022-07-20 03:58:49,547 INFO L78 Accepts]: Start accepts. Automaton has 3241 states and 4432 transitions. Word has length 139 [2022-07-20 03:58:49,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:58:49,547 INFO L495 AbstractCegarLoop]: Abstraction has 3241 states and 4432 transitions. [2022-07-20 03:58:49,548 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-20 03:58:49,548 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 4432 transitions. [2022-07-20 03:58:49,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-20 03:58:49,550 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:58:49,550 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-20 03:58:49,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-20 03:58:49,550 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-20 03:58:49,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:58:49,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1655545842, now seen corresponding path program 1 times [2022-07-20 03:58:49,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:58:49,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703658717] [2022-07-20 03:58:49,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:58:49,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:58:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:49,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:58:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:49,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-20 03:58:49,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:49,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 03:58:49,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:49,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-20 03:58:49,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:49,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 03:58:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:49,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-20 03:58:49,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:49,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:58:49,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:49,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:58:49,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:49,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 03:58:49,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:49,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 03:58:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:49,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 03:58:49,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:49,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 03:58:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:49,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 03:58:49,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:49,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 03:58:49,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:49,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 03:58:49,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:49,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 03:58:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:49,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 03:58:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:49,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-20 03:58:49,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:49,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 03:58:49,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:49,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 03:58:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:49,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 03:58:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:49,874 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-20 03:58:49,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:58:49,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703658717] [2022-07-20 03:58:49,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703658717] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:58:49,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:58:49,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:58:49,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010630732] [2022-07-20 03:58:49,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:58:49,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:58:49,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:58:49,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:58:49,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:58:49,878 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-20 03:58:58,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:58:58,611 INFO L93 Difference]: Finished difference Result 3241 states and 4432 transitions. [2022-07-20 03:58:58,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:58:58,612 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-20 03:58:58,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:58:58,621 INFO L225 Difference]: With dead ends: 3241 [2022-07-20 03:58:58,621 INFO L226 Difference]: Without dead ends: 3239 [2022-07-20 03:58:58,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 03:58:58,623 INFO L413 NwaCegarLoop]: 3557 mSDtfsCounter, 6870 mSDsluCounter, 1842 mSDsCounter, 0 mSdLazyCounter, 4327 mSolverCounterSat, 3728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7054 SdHoareTripleChecker+Valid, 5399 SdHoareTripleChecker+Invalid, 8055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3728 IncrementalHoareTripleChecker+Valid, 4327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-07-20 03:58:58,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7054 Valid, 5399 Invalid, 8055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3728 Valid, 4327 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2022-07-20 03:58:58,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3239 states. [2022-07-20 03:58:58,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3239 to 3239. [2022-07-20 03:58:58,753 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-20 03:58:58,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3239 states to 3239 states and 4430 transitions. [2022-07-20 03:58:58,763 INFO L78 Accepts]: Start accepts. Automaton has 3239 states and 4430 transitions. Word has length 145 [2022-07-20 03:58:58,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:58:58,763 INFO L495 AbstractCegarLoop]: Abstraction has 3239 states and 4430 transitions. [2022-07-20 03:58:58,764 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-20 03:58:58,764 INFO L276 IsEmpty]: Start isEmpty. Operand 3239 states and 4430 transitions. [2022-07-20 03:58:58,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-20 03:58:58,766 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:58:58,766 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-20 03:58:58,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-20 03:58:58,766 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-20 03:58:58,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:58:58,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1166431932, now seen corresponding path program 1 times [2022-07-20 03:58:58,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:58:58,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573936973] [2022-07-20 03:58:58,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:58:58,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:58:58,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:59,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:58:59,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:59,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-20 03:58:59,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:59,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 03:58:59,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:59,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-20 03:58:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:59,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 03:58:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:59,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-20 03:58:59,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:59,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:58:59,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:59,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:58:59,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:59,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 03:58:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:59,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 03:58:59,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:59,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 03:58:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:59,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 03:58:59,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:59,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 03:58:59,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:59,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 03:58:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:59,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 03:58:59,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:59,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 03:58:59,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:59,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 03:58:59,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:59,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-20 03:58:59,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:59,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 03:58:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:59,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 03:58:59,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:59,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 03:58:59,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:59,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 03:58:59,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:59,194 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-20 03:58:59,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:58:59,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573936973] [2022-07-20 03:58:59,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573936973] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:58:59,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:58:59,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:58:59,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425045688] [2022-07-20 03:58:59,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:58:59,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:58:59,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:58:59,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:58:59,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:58:59,200 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-20 03:59:04,614 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-20 03:59:08,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:59:08,587 INFO L93 Difference]: Finished difference Result 3239 states and 4430 transitions. [2022-07-20 03:59:08,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:59:08,588 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-20 03:59:08,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:59:08,598 INFO L225 Difference]: With dead ends: 3239 [2022-07-20 03:59:08,598 INFO L226 Difference]: Without dead ends: 3237 [2022-07-20 03:59:08,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 03:59:08,601 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-20 03:59:08,601 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-20 03:59:08,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3237 states. [2022-07-20 03:59:08,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3237 to 3237. [2022-07-20 03:59:08,736 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-20 03:59:08,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3237 states to 3237 states and 4428 transitions. [2022-07-20 03:59:08,745 INFO L78 Accepts]: Start accepts. Automaton has 3237 states and 4428 transitions. Word has length 151 [2022-07-20 03:59:08,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:59:08,746 INFO L495 AbstractCegarLoop]: Abstraction has 3237 states and 4428 transitions. [2022-07-20 03:59:08,746 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-20 03:59:08,746 INFO L276 IsEmpty]: Start isEmpty. Operand 3237 states and 4428 transitions. [2022-07-20 03:59:08,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-20 03:59:08,748 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:59:08,749 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-20 03:59:08,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-20 03:59:08,749 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-20 03:59:08,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:59:08,749 INFO L85 PathProgramCache]: Analyzing trace with hash 162647145, now seen corresponding path program 1 times [2022-07-20 03:59:08,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:59:08,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270034473] [2022-07-20 03:59:08,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:59:08,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:59:08,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:08,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:59:08,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:08,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-20 03:59:08,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:08,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 03:59:08,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:08,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-20 03:59:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:08,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 03:59:08,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:08,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-20 03:59:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:08,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:59:08,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:08,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:59:08,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:09,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 03:59:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:09,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 03:59:09,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:09,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 03:59:09,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:09,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 03:59:09,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:09,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 03:59:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:09,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 03:59:09,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:09,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 03:59:09,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:09,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 03:59:09,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:09,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 03:59:09,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:09,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-20 03:59:09,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:09,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 03:59:09,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:09,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 03:59:09,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:09,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 03:59:09,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:09,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 03:59:09,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:09,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-20 03:59:09,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:09,121 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-20 03:59:09,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:59:09,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270034473] [2022-07-20 03:59:09,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270034473] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:59:09,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:59:09,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:59:09,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310104157] [2022-07-20 03:59:09,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:59:09,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:59:09,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:59:09,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:59:09,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:59:09,126 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-20 03:59:18,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:59:18,054 INFO L93 Difference]: Finished difference Result 3237 states and 4428 transitions. [2022-07-20 03:59:18,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:59:18,054 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-20 03:59:18,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:59:18,062 INFO L225 Difference]: With dead ends: 3237 [2022-07-20 03:59:18,062 INFO L226 Difference]: Without dead ends: 3235 [2022-07-20 03:59:18,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 03:59:18,063 INFO L413 NwaCegarLoop]: 3553 mSDtfsCounter, 6858 mSDsluCounter, 1842 mSDsCounter, 0 mSdLazyCounter, 4323 mSolverCounterSat, 3728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7040 SdHoareTripleChecker+Valid, 5395 SdHoareTripleChecker+Invalid, 8051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3728 IncrementalHoareTripleChecker+Valid, 4323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-07-20 03:59:18,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7040 Valid, 5395 Invalid, 8051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3728 Valid, 4323 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2022-07-20 03:59:18,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3235 states. [2022-07-20 03:59:18,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3235 to 3235. [2022-07-20 03:59:18,193 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-20 03:59:18,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3235 states to 3235 states and 4426 transitions. [2022-07-20 03:59:18,201 INFO L78 Accepts]: Start accepts. Automaton has 3235 states and 4426 transitions. Word has length 157 [2022-07-20 03:59:18,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:59:18,201 INFO L495 AbstractCegarLoop]: Abstraction has 3235 states and 4426 transitions. [2022-07-20 03:59:18,202 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-20 03:59:18,202 INFO L276 IsEmpty]: Start isEmpty. Operand 3235 states and 4426 transitions. [2022-07-20 03:59:18,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-20 03:59:18,204 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:59:18,204 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-20 03:59:18,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-20 03:59:18,204 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-20 03:59:18,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:59:18,205 INFO L85 PathProgramCache]: Analyzing trace with hash -826661930, now seen corresponding path program 1 times [2022-07-20 03:59:18,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:59:18,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007466715] [2022-07-20 03:59:18,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:59:18,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:59:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:18,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:59:18,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:18,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-20 03:59:18,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:18,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 03:59:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:18,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-20 03:59:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:18,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 03:59:18,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:18,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-20 03:59:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:18,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:59:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:18,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:59:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:18,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 03:59:18,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:18,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 03:59:18,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:18,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 03:59:18,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:18,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 03:59:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:18,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 03:59:18,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:18,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 03:59:18,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:18,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 03:59:18,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:18,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 03:59:18,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:18,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 03:59:18,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:18,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-20 03:59:18,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:18,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 03:59:18,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:18,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 03:59:18,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:18,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 03:59:18,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:18,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 03:59:18,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:18,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-20 03:59:18,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:18,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-20 03:59:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:18,537 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-20 03:59:18,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:59:18,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007466715] [2022-07-20 03:59:18,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007466715] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:59:18,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:59:18,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 03:59:18,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583174830] [2022-07-20 03:59:18,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:59:18,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 03:59:18,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:59:18,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 03:59:18,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-20 03:59:18,541 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-20 03:59:29,855 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:59:40,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:59:40,747 INFO L93 Difference]: Finished difference Result 6654 states and 9159 transitions. [2022-07-20 03:59:40,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 03:59:40,749 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-20 03:59:40,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:59:40,827 INFO L225 Difference]: With dead ends: 6654 [2022-07-20 03:59:40,827 INFO L226 Difference]: Without dead ends: 3810 [2022-07-20 03:59:40,835 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-20 03:59:40,836 INFO L413 NwaCegarLoop]: 3784 mSDtfsCounter, 6199 mSDsluCounter, 4857 mSDsCounter, 0 mSdLazyCounter, 18334 mSolverCounterSat, 3856 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.2s 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, 21.5s IncrementalHoareTripleChecker+Time [2022-07-20 03:59:40,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6204 Valid, 8641 Invalid, 22190 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3856 Valid, 18334 Invalid, 0 Unknown, 0 Unchecked, 21.5s Time] [2022-07-20 03:59:40,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3810 states. [2022-07-20 03:59:41,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3810 to 3374. [2022-07-20 03:59:41,003 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-20 03:59:41,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3374 states to 3374 states and 4623 transitions. [2022-07-20 03:59:41,013 INFO L78 Accepts]: Start accepts. Automaton has 3374 states and 4623 transitions. Word has length 163 [2022-07-20 03:59:41,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:59:41,013 INFO L495 AbstractCegarLoop]: Abstraction has 3374 states and 4623 transitions. [2022-07-20 03:59:41,014 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-20 03:59:41,014 INFO L276 IsEmpty]: Start isEmpty. Operand 3374 states and 4623 transitions. [2022-07-20 03:59:41,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-20 03:59:41,016 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:59:41,016 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-20 03:59:41,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-20 03:59:41,016 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-20 03:59:41,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:59:41,017 INFO L85 PathProgramCache]: Analyzing trace with hash -400107432, now seen corresponding path program 1 times [2022-07-20 03:59:41,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:59:41,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202730801] [2022-07-20 03:59:41,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:59:41,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:59:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:41,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:59:41,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:41,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-20 03:59:41,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:41,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 03:59:41,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:41,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-20 03:59:41,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:41,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 03:59:41,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:41,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-20 03:59:41,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:41,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:59:41,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:41,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:59:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:41,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 03:59:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:41,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 03:59:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:41,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 03:59:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:41,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 03:59:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:41,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 03:59:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:41,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 03:59:41,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:41,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 03:59:41,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:41,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 03:59:41,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:41,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 03:59:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:41,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-20 03:59:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:41,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 03:59:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:41,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 03:59:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:41,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 03:59:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:41,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 03:59:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:41,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-20 03:59:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:41,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-20 03:59:41,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:41,363 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-20 03:59:41,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:59:41,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202730801] [2022-07-20 03:59:41,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202730801] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:59:41,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:59:41,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:59:41,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513652606] [2022-07-20 03:59:41,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:59:41,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:59:41,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:59:41,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:59:41,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:59:41,366 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-20 03:59:49,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:59:49,260 INFO L93 Difference]: Finished difference Result 3374 states and 4623 transitions. [2022-07-20 03:59:49,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:59:49,261 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-20 03:59:49,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:59:49,271 INFO L225 Difference]: With dead ends: 3374 [2022-07-20 03:59:49,272 INFO L226 Difference]: Without dead ends: 3372 [2022-07-20 03:59:49,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 03:59:49,274 INFO L413 NwaCegarLoop]: 3551 mSDtfsCounter, 6852 mSDsluCounter, 1842 mSDsCounter, 0 mSdLazyCounter, 4321 mSolverCounterSat, 3728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s 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.5s IncrementalHoareTripleChecker+Time [2022-07-20 03:59:49,274 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.5s Time] [2022-07-20 03:59:49,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3372 states. [2022-07-20 03:59:49,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3372 to 3372. [2022-07-20 03:59:49,446 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-20 03:59:49,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3372 states to 3372 states and 4621 transitions. [2022-07-20 03:59:49,456 INFO L78 Accepts]: Start accepts. Automaton has 3372 states and 4621 transitions. Word has length 163 [2022-07-20 03:59:49,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:59:49,456 INFO L495 AbstractCegarLoop]: Abstraction has 3372 states and 4621 transitions. [2022-07-20 03:59:49,456 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-20 03:59:49,456 INFO L276 IsEmpty]: Start isEmpty. Operand 3372 states and 4621 transitions. [2022-07-20 03:59:49,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-20 03:59:49,459 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:59:49,459 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-20 03:59:49,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-20 03:59:49,459 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-20 03:59:49,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:59:49,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1796644271, now seen corresponding path program 1 times [2022-07-20 03:59:49,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:59:49,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253254963] [2022-07-20 03:59:49,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:59:49,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:59:49,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:49,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:59:49,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:49,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-20 03:59:49,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:49,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 03:59:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:49,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-20 03:59:49,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:49,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 03:59:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:49,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-20 03:59:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:49,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:59:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:49,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:59:49,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:49,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 03:59:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:49,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 03:59:49,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:49,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 03:59:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:49,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 03:59:49,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:49,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 03:59:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:49,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 03:59:49,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:49,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 03:59:49,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:49,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 03:59:49,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:49,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 03:59:49,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:49,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-20 03:59:49,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:49,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 03:59:49,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:49,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 03:59:49,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:49,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 03:59:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:49,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 03:59:49,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:49,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-20 03:59:49,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:49,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-20 03:59:49,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:49,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-20 03:59:49,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:49,791 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-20 03:59:49,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:59:49,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253254963] [2022-07-20 03:59:49,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253254963] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:59:49,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:59:49,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:59:49,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171931250] [2022-07-20 03:59:49,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:59:49,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:59:49,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:59:49,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:59:49,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:59:49,794 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-20 03:59:58,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:59:58,053 INFO L93 Difference]: Finished difference Result 3372 states and 4621 transitions. [2022-07-20 03:59:58,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:59:58,053 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-20 03:59:58,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:59:58,062 INFO L225 Difference]: With dead ends: 3372 [2022-07-20 03:59:58,062 INFO L226 Difference]: Without dead ends: 3370 [2022-07-20 03:59:58,063 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-20 03:59:58,064 INFO L413 NwaCegarLoop]: 3549 mSDtfsCounter, 6846 mSDsluCounter, 1842 mSDsCounter, 0 mSdLazyCounter, 4319 mSolverCounterSat, 3728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s 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.8s IncrementalHoareTripleChecker+Time [2022-07-20 03:59:58,064 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.8s Time] [2022-07-20 03:59:58,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3370 states. [2022-07-20 03:59:58,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3370 to 3370. [2022-07-20 03:59:58,226 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-20 03:59:58,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3370 states to 3370 states and 4619 transitions. [2022-07-20 03:59:58,235 INFO L78 Accepts]: Start accepts. Automaton has 3370 states and 4619 transitions. Word has length 169 [2022-07-20 03:59:58,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:59:58,235 INFO L495 AbstractCegarLoop]: Abstraction has 3370 states and 4619 transitions. [2022-07-20 03:59:58,236 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-20 03:59:58,236 INFO L276 IsEmpty]: Start isEmpty. Operand 3370 states and 4619 transitions. [2022-07-20 03:59:58,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-07-20 03:59:58,238 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:59:58,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 03:59:58,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-20 03:59:58,239 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-20 03:59:58,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:59:58,239 INFO L85 PathProgramCache]: Analyzing trace with hash -2122786566, now seen corresponding path program 1 times [2022-07-20 03:59:58,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:59:58,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035534145] [2022-07-20 03:59:58,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:59:58,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:59:58,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:58,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:59:58,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:58,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-20 03:59:58,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:58,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 03:59:58,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:58,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-20 03:59:58,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:58,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 03:59:58,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:58,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-20 03:59:58,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:58,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:59:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:58,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:59:58,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:58,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 03:59:58,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:58,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 03:59:58,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:58,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 03:59:58,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:58,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 03:59:58,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:58,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 03:59:58,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:58,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 03:59:58,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:58,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 03:59:58,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:58,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 03:59:58,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:58,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 03:59:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:58,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-20 03:59:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:58,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 03:59:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:58,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 03:59:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:58,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 03:59:58,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:58,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 03:59:58,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:58,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-20 03:59:58,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:58,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-20 03:59:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:58,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-20 03:59:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:58,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-20 03:59:58,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:58,549 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-20 03:59:58,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:59:58,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035534145] [2022-07-20 03:59:58,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035534145] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:59:58,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:59:58,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:59:58,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193714221] [2022-07-20 03:59:58,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:59:58,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:59:58,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:59:58,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:59:58,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:59:58,551 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)