./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 f4b24e32 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-?-f4b24e3 [2022-07-14 04:35:55,047 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 04:35:55,053 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 04:35:55,072 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 04:35:55,072 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 04:35:55,073 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 04:35:55,074 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 04:35:55,079 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 04:35:55,082 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 04:35:55,083 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 04:35:55,084 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 04:35:55,085 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 04:35:55,086 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 04:35:55,087 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 04:35:55,089 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 04:35:55,090 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 04:35:55,092 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 04:35:55,096 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 04:35:55,097 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 04:35:55,099 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 04:35:55,102 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 04:35:55,104 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 04:35:55,104 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 04:35:55,105 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 04:35:55,105 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 04:35:55,108 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 04:35:55,109 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 04:35:55,110 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 04:35:55,110 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 04:35:55,111 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 04:35:55,112 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 04:35:55,112 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 04:35:55,113 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 04:35:55,114 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 04:35:55,114 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 04:35:55,115 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 04:35:55,115 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 04:35:55,116 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 04:35:55,116 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 04:35:55,116 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 04:35:55,116 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 04:35:55,117 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 04:35:55,118 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-14 04:35:55,138 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 04:35:55,139 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 04:35:55,139 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 04:35:55,139 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 04:35:55,140 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 04:35:55,140 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 04:35:55,140 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 04:35:55,140 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 04:35:55,141 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 04:35:55,141 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 04:35:55,141 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 04:35:55,142 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 04:35:55,142 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 04:35:55,142 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 04:35:55,142 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 04:35:55,142 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 04:35:55,142 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 04:35:55,143 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 04:35:55,143 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 04:35:55,143 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 04:35:55,143 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 04:35:55,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 04:35:55,144 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 04:35:55,145 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 04:35:55,145 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 04:35:55,145 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 04:35:55,145 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 04:35:55,145 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-14 04:35:55,145 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-14 04:35:55,145 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 04:35:55,146 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-14 04:35:55,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 04:35:55,349 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 04:35:55,351 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 04:35:55,353 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 04:35:55,353 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 04:35:55,354 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-14 04:35:55,398 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ba2f3841/93766a4697f64659b3fe4dd5c09beced/FLAG6d04ce9cf [2022-07-14 04:35:56,096 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 04:35:56,097 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-14 04:35:56,144 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ba2f3841/93766a4697f64659b3fe4dd5c09beced/FLAG6d04ce9cf [2022-07-14 04:35:56,435 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ba2f3841/93766a4697f64659b3fe4dd5c09beced [2022-07-14 04:35:56,437 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 04:35:56,438 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 04:35:56,439 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 04:35:56,439 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 04:35:56,441 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 04:35:56,442 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:35:56" (1/1) ... [2022-07-14 04:35:56,443 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2491637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:35:56, skipping insertion in model container [2022-07-14 04:35:56,443 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:35:56" (1/1) ... [2022-07-14 04:35:56,447 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 04:35:56,551 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 04:36:00,024 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,027 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,028 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,032 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,032 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,033 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,033 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,033 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,034 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,034 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,034 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,035 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,035 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,036 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,036 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,037 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,040 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,041 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,041 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,042 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,043 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,043 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,043 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,044 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,045 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,045 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,046 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,046 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,047 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,048 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,048 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,049 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,049 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,049 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,050 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,050 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,051 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,051 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,051 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,052 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,052 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,052 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,053 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,053 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,053 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,054 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,054 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,055 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,055 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,056 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,056 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,056 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,056 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,057 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,057 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,057 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,058 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,058 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,058 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,059 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,059 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,060 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,060 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,060 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,061 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,061 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,062 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,062 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,062 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,063 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,063 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,063 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,064 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,064 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,064 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,064 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,065 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,065 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,066 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,066 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,066 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,067 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,067 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,068 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,068 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,068 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,069 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,069 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 04:36:00,125 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 04:36:00,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[497733,497746] [2022-07-14 04:36:00,409 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[497878,497891] [2022-07-14 04:36:00,409 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[498024,498037] [2022-07-14 04:36:00,410 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,410 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,410 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,410 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:36:00,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[498823,498836] [2022-07-14 04:36:00,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[498982,498995] [2022-07-14 04:36:00,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[499121,499134] [2022-07-14 04:36:00,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[499263,499276] [2022-07-14 04:36:00,412 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[499412,499425] [2022-07-14 04:36:00,412 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[499551,499564] [2022-07-14 04:36:00,412 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[499706,499719] [2022-07-14 04:36:00,412 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[499866,499879] [2022-07-14 04:36:00,413 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[500017,500030] [2022-07-14 04:36:00,413 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[500168,500181] [2022-07-14 04:36:00,413 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[500320,500333] [2022-07-14 04:36:00,413 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[500469,500482] [2022-07-14 04:36:00,414 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[500617,500630] [2022-07-14 04:36:00,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[500774,500787] [2022-07-14 04:36:00,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[500923,500936] [2022-07-14 04:36:00,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[501079,501092] [2022-07-14 04:36:00,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[501232,501245] [2022-07-14 04:36:00,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[501378,501391] [2022-07-14 04:36:00,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[501521,501534] [2022-07-14 04:36:00,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[501673,501686] [2022-07-14 04:36:00,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[501819,501832] [2022-07-14 04:36:00,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[501964,501977] [2022-07-14 04:36:00,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[502118,502131] [2022-07-14 04:36:00,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[502269,502282] [2022-07-14 04:36:00,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[502424,502437] [2022-07-14 04:36:00,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[502576,502589] [2022-07-14 04:36:00,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[502731,502744] [2022-07-14 04:36:00,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[502895,502908] [2022-07-14 04:36:00,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[503051,503064] [2022-07-14 04:36:00,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[503215,503228] [2022-07-14 04:36:00,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[503357,503370] [2022-07-14 04:36:00,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[503515,503528] [2022-07-14 04:36:00,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[503682,503695] [2022-07-14 04:36:00,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[503841,503854] [2022-07-14 04:36:00,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[504000,504013] [2022-07-14 04:36:00,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[504149,504162] [2022-07-14 04:36:00,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[504296,504309] [2022-07-14 04:36:00,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[504435,504448] [2022-07-14 04:36:00,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[504598,504611] [2022-07-14 04:36:00,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[504764,504777] [2022-07-14 04:36:00,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[504928,504941] [2022-07-14 04:36:00,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[505093,505106] [2022-07-14 04:36:00,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[505258,505271] [2022-07-14 04:36:00,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[505424,505437] [2022-07-14 04:36:00,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[505589,505602] [2022-07-14 04:36:00,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[505756,505769] [2022-07-14 04:36:00,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[505916,505929] [2022-07-14 04:36:00,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[506078,506091] [2022-07-14 04:36:00,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[506237,506250] [2022-07-14 04:36:00,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[506383,506396] [2022-07-14 04:36:00,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[506526,506539] [2022-07-14 04:36:00,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[506670,506683] [2022-07-14 04:36:00,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[506813,506826] [2022-07-14 04:36:00,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[506957,506970] [2022-07-14 04:36:00,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[507098,507111] [2022-07-14 04:36:00,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[507236,507249] [2022-07-14 04:36:00,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[507394,507407] [2022-07-14 04:36:00,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[507553,507566] [2022-07-14 04:36:00,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[507709,507722] [2022-07-14 04:36:00,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[507858,507871] [2022-07-14 04:36:00,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[508010,508023] [2022-07-14 04:36:00,458 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[508161,508174] [2022-07-14 04:36:00,458 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[508310,508323] [2022-07-14 04:36:00,458 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[508462,508475] [2022-07-14 04:36:00,458 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[508610,508623] [2022-07-14 04:36:00,459 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[508763,508776] [2022-07-14 04:36:00,459 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[508914,508927] [2022-07-14 04:36:00,459 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[509064,509077] [2022-07-14 04:36:00,459 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[509211,509224] [2022-07-14 04:36:00,460 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[509362,509375] [2022-07-14 04:36:00,460 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[509513,509526] [2022-07-14 04:36:00,460 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[509661,509674] [2022-07-14 04:36:00,460 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[509827,509840] [2022-07-14 04:36:00,461 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[509996,510009] [2022-07-14 04:36:00,461 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[510163,510176] [2022-07-14 04:36:00,461 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[510331,510344] [2022-07-14 04:36:00,461 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[510481,510494] [2022-07-14 04:36:00,462 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[510628,510641] [2022-07-14 04:36:00,462 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[510789,510802] [2022-07-14 04:36:00,462 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[510959,510972] [2022-07-14 04:36:00,462 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i[511121,511134] [2022-07-14 04:36:00,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 04:36:00,621 INFO L208 MainTranslator]: Completed translation [2022-07-14 04:36:00,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:36:00 WrapperNode [2022-07-14 04:36:00,622 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 04:36:00,623 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 04:36:00,623 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 04:36:00,623 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 04:36:00,627 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:36:00" (1/1) ... [2022-07-14 04:36:00,710 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:36:00" (1/1) ... [2022-07-14 04:36:00,876 INFO L137 Inliner]: procedures = 791, calls = 4679, calls flagged for inlining = 346, calls inlined = 247, statements flattened = 8171 [2022-07-14 04:36:00,876 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 04:36:00,877 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 04:36:00,877 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 04:36:00,877 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 04:36:00,883 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:36:00" (1/1) ... [2022-07-14 04:36:00,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:36:00" (1/1) ... [2022-07-14 04:36:00,910 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:36:00" (1/1) ... [2022-07-14 04:36:00,910 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:36:00" (1/1) ... [2022-07-14 04:36:01,030 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:36:00" (1/1) ... [2022-07-14 04:36:01,054 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:36:00" (1/1) ... [2022-07-14 04:36:01,094 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:36:00" (1/1) ... [2022-07-14 04:36:01,212 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 04:36:01,214 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 04:36:01,214 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 04:36:01,214 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 04:36:01,215 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:36:00" (1/1) ... [2022-07-14 04:36:01,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 04:36:01,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:36:01,243 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-14 04:36:01,262 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-14 04:36:01,272 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2022-07-14 04:36:01,273 INFO L130 BoogieDeclarations]: Found specification of procedure pidff_request_effect_upload [2022-07-14 04:36:01,273 INFO L138 BoogieDeclarations]: Found implementation of procedure pidff_request_effect_upload [2022-07-14 04:36:01,273 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_int [2022-07-14 04:36:01,273 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_int [2022-07-14 04:36:01,273 INFO L130 BoogieDeclarations]: Found specification of procedure pidff_find_special_field [2022-07-14 04:36:01,273 INFO L138 BoogieDeclarations]: Found implementation of procedure pidff_find_special_field [2022-07-14 04:36:01,273 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_usbhid_device [2022-07-14 04:36:01,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_usbhid_device [2022-07-14 04:36:01,274 INFO L130 BoogieDeclarations]: Found specification of procedure pidff_check_usage [2022-07-14 04:36:01,274 INFO L138 BoogieDeclarations]: Found implementation of procedure pidff_check_usage [2022-07-14 04:36:01,274 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-14 04:36:01,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-14 04:36:01,274 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_get_interface [2022-07-14 04:36:01,274 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_get_interface [2022-07-14 04:36:01,274 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-14 04:36:01,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-14 04:36:01,274 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_in [2022-07-14 04:36:01,275 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_in [2022-07-14 04:36:01,275 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-14 04:36:01,275 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-14 04:36:01,275 INFO L130 BoogieDeclarations]: Found specification of procedure hid_suspend [2022-07-14 04:36:01,275 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_suspend [2022-07-14 04:36:01,275 INFO L130 BoogieDeclarations]: Found specification of procedure pidff_erase_pid [2022-07-14 04:36:01,275 INFO L138 BoogieDeclarations]: Found implementation of procedure pidff_erase_pid [2022-07-14 04:36:01,275 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-14 04:36:01,275 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-07-14 04:36:01,275 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-07-14 04:36:01,276 INFO L130 BoogieDeclarations]: Found specification of procedure hid_submit_out [2022-07-14 04:36:01,276 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_submit_out [2022-07-14 04:36:01,276 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_108 [2022-07-14 04:36:01,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_108 [2022-07-14 04:36:01,276 INFO L130 BoogieDeclarations]: Found specification of procedure hid_output_report [2022-07-14 04:36:01,276 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_output_report [2022-07-14 04:36:01,276 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-14 04:36:01,276 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-14 04:36:01,276 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-14 04:36:01,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-14 04:36:01,277 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_existancelock_of_hiddev [2022-07-14 04:36:01,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_existancelock_of_hiddev [2022-07-14 04:36:01,277 INFO L130 BoogieDeclarations]: Found specification of procedure hid_find_max_report [2022-07-14 04:36:01,277 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_find_max_report [2022-07-14 04:36:01,277 INFO L130 BoogieDeclarations]: Found specification of procedure pidff_autocenter [2022-07-14 04:36:01,277 INFO L138 BoogieDeclarations]: Found implementation of procedure pidff_autocenter [2022-07-14 04:36:01,277 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-14 04:36:01,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-14 04:36:01,277 INFO L130 BoogieDeclarations]: Found specification of procedure hiddev_ioctl [2022-07-14 04:36:01,278 INFO L138 BoogieDeclarations]: Found implementation of procedure hiddev_ioctl [2022-07-14 04:36:01,278 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-14 04:36:01,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-14 04:36:01,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 04:36:01,278 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-14 04:36:01,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-14 04:36:01,278 INFO L130 BoogieDeclarations]: Found specification of procedure hid_submit_ctrl [2022-07-14 04:36:01,278 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_submit_ctrl [2022-07-14 04:36:01,279 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irq_120 [2022-07-14 04:36:01,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irq_120 [2022-07-14 04:36:01,279 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2022-07-14 04:36:01,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2022-07-14 04:36:01,279 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~pm_message_t~0~TO~int [2022-07-14 04:36:01,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~pm_message_t~0~TO~int [2022-07-14 04:36:01,279 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_restart_out_queue [2022-07-14 04:36:01,279 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_restart_out_queue [2022-07-14 04:36:01,280 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2022-07-14 04:36:01,280 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2022-07-14 04:36:01,280 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-14 04:36:01,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-14 04:36:01,280 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_stop [2022-07-14 04:36:01,280 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_stop [2022-07-14 04:36:01,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 04:36:01,280 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mod_timer [2022-07-14 04:36:01,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mod_timer [2022-07-14 04:36:01,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 04:36:01,283 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-14 04:36:01,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-14 04:36:01,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 04:36:01,283 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-14 04:36:01,283 INFO L130 BoogieDeclarations]: Found specification of procedure hid_cease_io [2022-07-14 04:36:01,283 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_cease_io [2022-07-14 04:36:01,283 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2022-07-14 04:36:01,284 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2022-07-14 04:36:01,284 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_irq [2022-07-14 04:36:01,287 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_irq [2022-07-14 04:36:01,287 INFO L130 BoogieDeclarations]: Found specification of procedure usb_control_msg [2022-07-14 04:36:01,288 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_control_msg [2022-07-14 04:36:01,288 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-14 04:36:01,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-14 04:36:01,288 INFO L130 BoogieDeclarations]: Found specification of procedure hid_hw_wait [2022-07-14 04:36:01,288 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_hw_wait [2022-07-14 04:36:01,288 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-14 04:36:01,288 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-14 04:36:01,288 INFO L130 BoogieDeclarations]: Found specification of procedure hid_start_in [2022-07-14 04:36:01,288 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_start_in [2022-07-14 04:36:01,288 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2022-07-14 04:36:01,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2022-07-14 04:36:01,289 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-14 04:36:01,289 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-14 04:36:01,289 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_hid_open_mut [2022-07-14 04:36:01,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_hid_open_mut [2022-07-14 04:36:01,289 INFO L130 BoogieDeclarations]: Found specification of procedure hid_io_error [2022-07-14 04:36:01,289 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_io_error [2022-07-14 04:36:01,289 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2022-07-14 04:36:01,290 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2022-07-14 04:36:01,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 04:36:01,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 04:36:01,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-14 04:36:01,290 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-07-14 04:36:01,290 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-07-14 04:36:01,290 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_process_context [2022-07-14 04:36:01,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_process_context [2022-07-14 04:36:01,290 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2022-07-14 04:36:01,290 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2022-07-14 04:36:01,291 INFO L130 BoogieDeclarations]: Found specification of procedure hid_cancel_delayed_stuff [2022-07-14 04:36:01,291 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_cancel_delayed_stuff [2022-07-14 04:36:01,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-14 04:36:01,291 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-14 04:36:01,291 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_usbhid_device [2022-07-14 04:36:01,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_usbhid_device [2022-07-14 04:36:01,291 INFO L130 BoogieDeclarations]: Found specification of procedure hiddev_lookup_report [2022-07-14 04:36:01,292 INFO L138 BoogieDeclarations]: Found implementation of procedure hiddev_lookup_report [2022-07-14 04:36:01,292 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-14 04:36:01,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-14 04:36:01,292 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_free_urb [2022-07-14 04:36:01,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_free_urb [2022-07-14 04:36:01,292 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-14 04:36:01,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-14 04:36:01,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 04:36:01,293 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-07-14 04:36:01,293 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-07-14 04:36:01,293 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-14 04:36:01,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-14 04:36:01,293 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_submit_report [2022-07-14 04:36:01,293 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_submit_report [2022-07-14 04:36:01,293 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_mark_busy [2022-07-14 04:36:01,293 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_mark_busy [2022-07-14 04:36:01,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 04:36:01,294 INFO L130 BoogieDeclarations]: Found specification of procedure hid_set_idle [2022-07-14 04:36:01,294 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_set_idle [2022-07-14 04:36:01,294 INFO L130 BoogieDeclarations]: Found specification of procedure pidff_set [2022-07-14 04:36:01,294 INFO L138 BoogieDeclarations]: Found implementation of procedure pidff_set [2022-07-14 04:36:01,294 INFO L130 BoogieDeclarations]: Found specification of procedure hid_reset_resume [2022-07-14 04:36:01,294 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_reset_resume [2022-07-14 04:36:01,294 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2022-07-14 04:36:01,294 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2022-07-14 04:36:01,294 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-14 04:36:01,294 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-14 04:36:01,294 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-14 04:36:01,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-14 04:36:01,295 INFO L130 BoogieDeclarations]: Found specification of procedure hid_alloc_report_buf [2022-07-14 04:36:01,295 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_alloc_report_buf [2022-07-14 04:36:01,295 INFO L130 BoogieDeclarations]: Found specification of procedure pidff_find_reports [2022-07-14 04:36:01,295 INFO L138 BoogieDeclarations]: Found implementation of procedure pidff_find_reports [2022-07-14 04:36:01,295 INFO L130 BoogieDeclarations]: Found specification of procedure list_empty [2022-07-14 04:36:01,295 INFO L138 BoogieDeclarations]: Found implementation of procedure list_empty [2022-07-14 04:36:01,295 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_alloc_urb [2022-07-14 04:36:01,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_alloc_urb [2022-07-14 04:36:01,295 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-14 04:36:01,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-14 04:36:01,296 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-14 04:36:01,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-14 04:36:01,296 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2022-07-14 04:36:01,296 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2022-07-14 04:36:01,296 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-14 04:36:01,296 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-14 04:36:01,296 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-14 04:36:01,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-14 04:36:01,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 04:36:01,297 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irq [2022-07-14 04:36:01,297 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irq [2022-07-14 04:36:01,297 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-14 04:36:01,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-14 04:36:01,297 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_restart_ctrl_queue [2022-07-14 04:36:01,297 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_restart_ctrl_queue [2022-07-14 04:36:01,297 INFO L130 BoogieDeclarations]: Found specification of procedure pidff_reset [2022-07-14 04:36:01,297 INFO L138 BoogieDeclarations]: Found implementation of procedure pidff_reset [2022-07-14 04:36:01,297 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_thread_lock_of_hiddev_list [2022-07-14 04:36:01,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_thread_lock_of_hiddev_list [2022-07-14 04:36:01,298 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2022-07-14 04:36:01,298 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2022-07-14 04:36:01,298 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_lookup_quirk [2022-07-14 04:36:01,298 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_lookup_quirk [2022-07-14 04:36:01,298 INFO L130 BoogieDeclarations]: Found specification of procedure usb_string [2022-07-14 04:36:01,298 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_string [2022-07-14 04:36:01,298 INFO L130 BoogieDeclarations]: Found specification of procedure hid_resume [2022-07-14 04:36:01,298 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_resume [2022-07-14 04:36:01,298 INFO L130 BoogieDeclarations]: Found specification of procedure hid_get_class_descriptor [2022-07-14 04:36:01,298 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_get_class_descriptor [2022-07-14 04:36:01,299 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_107 [2022-07-14 04:36:01,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_107 [2022-07-14 04:36:01,299 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_96 [2022-07-14 04:36:01,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_96 [2022-07-14 04:36:01,299 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_97 [2022-07-14 04:36:01,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_97 [2022-07-14 04:36:01,299 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-14 04:36:01,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-14 04:36:01,299 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_thread_lock_of_hiddev_list [2022-07-14 04:36:01,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_thread_lock_of_hiddev_list [2022-07-14 04:36:01,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-14 04:36:01,300 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-14 04:36:01,300 INFO L130 BoogieDeclarations]: Found specification of procedure pidff_playback_pid [2022-07-14 04:36:01,312 INFO L138 BoogieDeclarations]: Found implementation of procedure pidff_playback_pid [2022-07-14 04:36:01,312 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-14 04:36:01,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-14 04:36:01,312 INFO L130 BoogieDeclarations]: Found specification of procedure usb_block_urb [2022-07-14 04:36:01,312 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_block_urb [2022-07-14 04:36:01,312 INFO L130 BoogieDeclarations]: Found specification of procedure hid_retry_timeout [2022-07-14 04:36:01,312 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_retry_timeout [2022-07-14 04:36:01,312 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_timer_timer_instance_3 [2022-07-14 04:36:01,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_timer_timer_instance_3 [2022-07-14 04:36:01,314 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_usb_alloc_coherent [2022-07-14 04:36:01,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_usb_alloc_coherent [2022-07-14 04:36:01,314 INFO L130 BoogieDeclarations]: Found specification of procedure __usb_get_extra_descriptor [2022-07-14 04:36:01,314 INFO L138 BoogieDeclarations]: Found implementation of procedure __usb_get_extra_descriptor [2022-07-14 04:36:01,314 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_init_reports [2022-07-14 04:36:01,314 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_init_reports [2022-07-14 04:36:01,314 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_hid_open_mut [2022-07-14 04:36:01,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_hid_open_mut [2022-07-14 04:36:01,314 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-14 04:36:01,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-14 04:36:01,314 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-14 04:36:01,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-14 04:36:01,315 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-14 04:36:01,315 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-14 04:36:01,315 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unpoison_urb [2022-07-14 04:36:01,315 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unpoison_urb [2022-07-14 04:36:01,315 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-14 04:36:01,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-14 04:36:01,315 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-14 04:36:01,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-14 04:36:01,315 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-14 04:36:01,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-14 04:36:01,316 INFO L130 BoogieDeclarations]: Found specification of procedure hid_resume_common [2022-07-14 04:36:01,316 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_resume_common [2022-07-14 04:36:01,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 04:36:01,316 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_del_timer_sync [2022-07-14 04:36:01,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_del_timer_sync [2022-07-14 04:36:01,316 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2022-07-14 04:36:01,318 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2022-07-14 04:36:01,318 INFO L130 BoogieDeclarations]: Found specification of procedure hid_free_buffers [2022-07-14 04:36:01,318 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_free_buffers [2022-07-14 04:36:01,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-14 04:36:01,319 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-07-14 04:36:01,319 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-07-14 04:36:01,319 INFO L130 BoogieDeclarations]: Found specification of procedure hid_pidff_init [2022-07-14 04:36:01,319 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_pidff_init [2022-07-14 04:36:01,319 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-14 04:36:01,319 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-14 04:36:01,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-14 04:36:01,319 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-14 04:36:01,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-14 04:36:01,319 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_put_interface [2022-07-14 04:36:01,319 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_put_interface [2022-07-14 04:36:01,320 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2022-07-14 04:36:01,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2022-07-14 04:36:01,320 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_existancelock_of_hiddev [2022-07-14 04:36:01,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_existancelock_of_hiddev [2022-07-14 04:36:01,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-14 04:36:01,320 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-14 04:36:01,320 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-14 04:36:01,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-14 04:36:01,320 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_interrupt_context [2022-07-14 04:36:01,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_interrupt_context [2022-07-14 04:36:01,321 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-14 04:36:01,321 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-14 04:36:01,321 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-14 04:36:01,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-14 04:36:01,321 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_timer_instance_callback_3_2 [2022-07-14 04:36:01,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_timer_instance_callback_3_2 [2022-07-14 04:36:01,321 INFO L130 BoogieDeclarations]: Found specification of procedure vfree [2022-07-14 04:36:01,321 INFO L138 BoogieDeclarations]: Found implementation of procedure vfree [2022-07-14 04:36:01,321 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2022-07-14 04:36:01,321 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2022-07-14 04:36:01,321 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-14 04:36:01,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-14 04:36:01,322 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_parse [2022-07-14 04:36:01,322 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_parse [2022-07-14 04:36:01,322 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_put_interface_async [2022-07-14 04:36:01,322 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_put_interface_async [2022-07-14 04:36:01,322 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_wait_io [2022-07-14 04:36:01,322 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_wait_io [2022-07-14 04:36:01,322 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_put_power [2022-07-14 04:36:01,322 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_put_power [2022-07-14 04:36:01,322 INFO L130 BoogieDeclarations]: Found specification of procedure pidff_check_autocenter [2022-07-14 04:36:01,322 INFO L138 BoogieDeclarations]: Found implementation of procedure pidff_check_autocenter [2022-07-14 04:36:01,323 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-14 04:36:01,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-14 04:36:01,323 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mod_timer_99 [2022-07-14 04:36:01,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mod_timer_99 [2022-07-14 04:36:01,323 INFO L130 BoogieDeclarations]: Found specification of procedure pidff_find_special_keys [2022-07-14 04:36:01,323 INFO L138 BoogieDeclarations]: Found implementation of procedure pidff_find_special_keys [2022-07-14 04:36:01,323 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-14 04:36:01,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-14 04:36:01,323 INFO L130 BoogieDeclarations]: Found specification of procedure down_write [2022-07-14 04:36:01,323 INFO L138 BoogieDeclarations]: Found implementation of procedure down_write [2022-07-14 04:36:01,324 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2022-07-14 04:36:01,324 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2022-07-14 04:36:01,324 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2022-07-14 04:36:01,324 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2022-07-14 04:36:01,324 INFO L130 BoogieDeclarations]: Found specification of procedure hid_hw_request [2022-07-14 04:36:01,324 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_hw_request [2022-07-14 04:36:01,324 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2022-07-14 04:36:01,324 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2022-07-14 04:36:01,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-14 04:36:01,324 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-14 04:36:01,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-14 04:36:01,325 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-14 04:36:01,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-14 04:36:01,325 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_put_interface_no_suspend [2022-07-14 04:36:01,325 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_put_interface_no_suspend [2022-07-14 04:36:01,325 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_get_interface_no_resume [2022-07-14 04:36:01,325 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_get_interface_no_resume [2022-07-14 04:36:01,325 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_disconnect [2022-07-14 04:36:01,325 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_disconnect [2022-07-14 04:36:01,325 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unlink_urb [2022-07-14 04:36:01,325 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unlink_urb [2022-07-14 04:36:01,326 INFO L130 BoogieDeclarations]: Found specification of procedure hid_destroy_device [2022-07-14 04:36:01,326 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_destroy_device [2022-07-14 04:36:01,326 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_usb_free_coherent [2022-07-14 04:36:01,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_usb_free_coherent [2022-07-14 04:36:01,326 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_open [2022-07-14 04:36:01,326 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_open [2022-07-14 04:36:01,326 INFO L130 BoogieDeclarations]: Found specification of procedure up_write [2022-07-14 04:36:01,326 INFO L138 BoogieDeclarations]: Found implementation of procedure up_write [2022-07-14 04:36:01,326 INFO L130 BoogieDeclarations]: Found specification of procedure pidff_rescale [2022-07-14 04:36:01,326 INFO L138 BoogieDeclarations]: Found implementation of procedure pidff_rescale [2022-07-14 04:36:01,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 04:36:01,327 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-14 04:36:01,327 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-14 04:36:01,327 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-14 04:36:01,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-14 04:36:01,327 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_close [2022-07-14 04:36:01,327 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_close [2022-07-14 04:36:01,327 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-14 04:36:01,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-14 04:36:01,327 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dispatch_instance_register_7_2 [2022-07-14 04:36:01,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dispatch_instance_register_7_2 [2022-07-14 04:36:01,328 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-14 04:36:01,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-14 04:36:01,328 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_get_interface_async [2022-07-14 04:36:01,328 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_get_interface_async [2022-07-14 04:36:01,328 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-14 04:36:01,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-14 04:36:01,328 INFO L130 BoogieDeclarations]: Found specification of procedure pidff_find_fields [2022-07-14 04:36:01,328 INFO L138 BoogieDeclarations]: Found implementation of procedure pidff_find_fields [2022-07-14 04:36:01,328 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-14 04:36:01,328 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-14 04:36:01,329 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_quirks_exit [2022-07-14 04:36:01,329 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_quirks_exit [2022-07-14 04:36:01,329 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-14 04:36:01,329 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-14 04:36:01,329 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_restart_queues [2022-07-14 04:36:01,329 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_restart_queues [2022-07-14 04:36:01,329 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-14 04:36:01,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-14 04:36:01,329 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_int_urb [2022-07-14 04:36:01,329 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_int_urb [2022-07-14 04:36:01,329 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-14 04:36:01,330 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-14 04:36:01,330 INFO L130 BoogieDeclarations]: Found specification of procedure hid_device_io_stop [2022-07-14 04:36:01,330 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_device_io_stop [2022-07-14 04:36:01,330 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-14 04:36:01,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-14 04:36:01,330 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_start [2022-07-14 04:36:01,330 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_start [2022-07-14 04:36:01,330 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-14 04:36:01,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-14 04:36:01,330 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2022-07-14 04:36:01,331 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2022-07-14 04:36:01,331 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2022-07-14 04:36:01,331 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2022-07-14 04:36:01,331 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_list_lock_of_hiddev [2022-07-14 04:36:01,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_list_lock_of_hiddev [2022-07-14 04:36:01,331 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-14 04:36:01,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-14 04:36:01,331 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_work [2022-07-14 04:36:01,331 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_work [2022-07-14 04:36:01,331 INFO L130 BoogieDeclarations]: Found specification of procedure hid_pre_reset [2022-07-14 04:36:01,331 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_pre_reset [2022-07-14 04:36:01,332 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-14 04:36:01,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-14 04:36:01,332 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_list_lock_of_hiddev [2022-07-14 04:36:01,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_list_lock_of_hiddev [2022-07-14 04:36:01,332 INFO L130 BoogieDeclarations]: Found specification of procedure msecs_to_jiffies [2022-07-14 04:36:01,332 INFO L138 BoogieDeclarations]: Found implementation of procedure msecs_to_jiffies [2022-07-14 04:36:01,332 INFO L130 BoogieDeclarations]: Found specification of procedure hid_post_reset [2022-07-14 04:36:01,332 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_post_reset [2022-07-14 04:36:01,332 INFO L130 BoogieDeclarations]: Found specification of procedure usbhid_get_power [2022-07-14 04:36:01,332 INFO L138 BoogieDeclarations]: Found implementation of procedure usbhid_get_power [2022-07-14 04:36:01,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 04:36:01,333 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_irq_119 [2022-07-14 04:36:01,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_irq_119 [2022-07-14 04:36:02,214 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 04:36:02,218 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 04:36:02,507 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-14 04:36:14,684 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 04:36:14,707 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 04:36:14,707 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-14 04:36:14,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:36:14 BoogieIcfgContainer [2022-07-14 04:36:14,712 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 04:36:14,713 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 04:36:14,713 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 04:36:14,716 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 04:36:14,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 04:35:56" (1/3) ... [2022-07-14 04:36:14,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25f3e346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 04:36:14, skipping insertion in model container [2022-07-14 04:36:14,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:36:00" (2/3) ... [2022-07-14 04:36:14,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25f3e346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 04:36:14, skipping insertion in model container [2022-07-14 04:36:14,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:36:14" (3/3) ... [2022-07-14 04:36:14,719 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--hid--usbhid--usbhid.ko.cil.i [2022-07-14 04:36:14,728 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 04:36:14,729 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 33 error locations. [2022-07-14 04:36:14,811 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 04:36:14,819 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@1c0bee1c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1d2282ef [2022-07-14 04:36:14,819 INFO L358 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2022-07-14 04:36:14,829 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-14 04:36:14,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-14 04:36:14,835 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:36:14,836 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-14 04:36:14,836 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-14 04:36:14,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:36:14,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1407426503, now seen corresponding path program 1 times [2022-07-14 04:36:14,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:36:14,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726798297] [2022-07-14 04:36:14,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:36:14,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:36:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:15,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:36:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:15,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 04:36:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:15,459 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-14 04:36:15,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:36:15,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726798297] [2022-07-14 04:36:15,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726798297] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:36:15,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:36:15,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:36:15,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745803515] [2022-07-14 04:36:15,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:36:15,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:36:15,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:36:15,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:36:15,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:36:15,509 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-14 04:36:18,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:36:18,013 INFO L93 Difference]: Finished difference Result 6251 states and 8986 transitions. [2022-07-14 04:36:18,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:36:18,015 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-14 04:36:18,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:36:18,038 INFO L225 Difference]: With dead ends: 6251 [2022-07-14 04:36:18,038 INFO L226 Difference]: Without dead ends: 3209 [2022-07-14 04:36:18,053 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-14 04:36:18,055 INFO L413 NwaCegarLoop]: 4226 mSDtfsCounter, 4134 mSDsluCounter, 11398 mSDsCounter, 0 mSdLazyCounter, 1542 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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.2s IncrementalHoareTripleChecker+Time [2022-07-14 04:36:18,056 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.2s Time] [2022-07-14 04:36:18,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3209 states. [2022-07-14 04:36:18,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3209 to 3189. [2022-07-14 04:36:18,191 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-14 04:36:18,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3189 states to 3189 states and 4370 transitions. [2022-07-14 04:36:18,211 INFO L78 Accepts]: Start accepts. Automaton has 3189 states and 4370 transitions. Word has length 30 [2022-07-14 04:36:18,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:36:18,212 INFO L495 AbstractCegarLoop]: Abstraction has 3189 states and 4370 transitions. [2022-07-14 04:36:18,212 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-14 04:36:18,212 INFO L276 IsEmpty]: Start isEmpty. Operand 3189 states and 4370 transitions. [2022-07-14 04:36:18,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-14 04:36:18,214 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:36:18,214 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-14 04:36:18,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 04:36:18,215 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-14 04:36:18,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:36:18,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1407486085, now seen corresponding path program 1 times [2022-07-14 04:36:18,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:36:18,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692797729] [2022-07-14 04:36:18,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:36:18,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:36:18,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:18,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:36:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:18,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 04:36:18,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:18,494 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-14 04:36:18,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:36:18,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692797729] [2022-07-14 04:36:18,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692797729] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:36:18,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:36:18,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 04:36:18,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591283024] [2022-07-14 04:36:18,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:36:18,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 04:36:18,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:36:18,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 04:36:18,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 04:36:18,496 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-14 04:36:18,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:36:18,584 INFO L93 Difference]: Finished difference Result 3196 states and 4377 transitions. [2022-07-14 04:36:18,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 04:36:18,585 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-14 04:36:18,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:36:18,599 INFO L225 Difference]: With dead ends: 3196 [2022-07-14 04:36:18,600 INFO L226 Difference]: Without dead ends: 3194 [2022-07-14 04:36:18,602 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-14 04:36:18,602 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-14 04:36:18,603 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-14 04:36:18,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3194 states. [2022-07-14 04:36:18,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3194 to 3191. [2022-07-14 04:36:18,683 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-14 04:36:18,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3191 states to 3191 states and 4371 transitions. [2022-07-14 04:36:18,700 INFO L78 Accepts]: Start accepts. Automaton has 3191 states and 4371 transitions. Word has length 30 [2022-07-14 04:36:18,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:36:18,701 INFO L495 AbstractCegarLoop]: Abstraction has 3191 states and 4371 transitions. [2022-07-14 04:36:18,701 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-14 04:36:18,701 INFO L276 IsEmpty]: Start isEmpty. Operand 3191 states and 4371 transitions. [2022-07-14 04:36:18,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-14 04:36:18,702 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:36:18,702 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-14 04:36:18,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 04:36:18,703 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-14 04:36:18,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:36:18,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1476967390, now seen corresponding path program 1 times [2022-07-14 04:36:18,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:36:18,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82814108] [2022-07-14 04:36:18,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:36:18,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:36:18,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:18,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:36:18,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:18,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-14 04:36:18,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:18,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:36:18,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:18,929 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-14 04:36:18,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:36:18,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82814108] [2022-07-14 04:36:18,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82814108] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:36:18,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:36:18,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 04:36:18,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618109446] [2022-07-14 04:36:18,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:36:18,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 04:36:18,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:36:18,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 04:36:18,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 04:36:18,932 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-14 04:36:19,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:36:19,037 INFO L93 Difference]: Finished difference Result 6371 states and 8827 transitions. [2022-07-14 04:36:19,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 04:36:19,038 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-14 04:36:19,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:36:19,055 INFO L225 Difference]: With dead ends: 6371 [2022-07-14 04:36:19,055 INFO L226 Difference]: Without dead ends: 3185 [2022-07-14 04:36:19,070 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-14 04:36:19,072 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-14 04:36:19,073 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-14 04:36:19,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3185 states. [2022-07-14 04:36:19,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3185 to 3185. [2022-07-14 04:36:19,160 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-14 04:36:19,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3185 states to 3185 states and 4362 transitions. [2022-07-14 04:36:19,175 INFO L78 Accepts]: Start accepts. Automaton has 3185 states and 4362 transitions. Word has length 37 [2022-07-14 04:36:19,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:36:19,176 INFO L495 AbstractCegarLoop]: Abstraction has 3185 states and 4362 transitions. [2022-07-14 04:36:19,176 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-14 04:36:19,176 INFO L276 IsEmpty]: Start isEmpty. Operand 3185 states and 4362 transitions. [2022-07-14 04:36:19,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-14 04:36:19,182 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:36:19,182 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-14 04:36:19,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 04:36:19,183 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-14 04:36:19,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:36:19,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1976461436, now seen corresponding path program 1 times [2022-07-14 04:36:19,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:36:19,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162245564] [2022-07-14 04:36:19,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:36:19,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:36:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:19,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:36:19,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:19,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:36:19,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:19,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 04:36:19,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:19,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:36:19,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:19,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:36:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:19,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:36:19,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:19,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:36:19,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:19,489 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-14 04:36:19,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:36:19,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162245564] [2022-07-14 04:36:19,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162245564] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:36:19,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:36:19,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:36:19,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110516983] [2022-07-14 04:36:19,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:36:19,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:36:19,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:36:19,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:36:19,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:36:19,492 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-14 04:36:30,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:36:30,176 INFO L93 Difference]: Finished difference Result 6479 states and 8906 transitions. [2022-07-14 04:36:30,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:36:30,176 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-14 04:36:30,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:36:30,196 INFO L225 Difference]: With dead ends: 6479 [2022-07-14 04:36:30,196 INFO L226 Difference]: Without dead ends: 3619 [2022-07-14 04:36:30,207 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-14 04:36:30,208 INFO L413 NwaCegarLoop]: 3823 mSDtfsCounter, 5469 mSDsluCounter, 2111 mSDsCounter, 0 mSdLazyCounter, 7805 mSolverCounterSat, 3285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5619 SdHoareTripleChecker+Valid, 5934 SdHoareTripleChecker+Invalid, 11090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3285 IncrementalHoareTripleChecker+Valid, 7805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2022-07-14 04:36:30,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5619 Valid, 5934 Invalid, 11090 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3285 Valid, 7805 Invalid, 0 Unknown, 0 Unchecked, 10.3s Time] [2022-07-14 04:36:30,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3619 states. [2022-07-14 04:36:30,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3619 to 3185. [2022-07-14 04:36:30,330 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-14 04:36:30,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3185 states to 3185 states and 4361 transitions. [2022-07-14 04:36:30,344 INFO L78 Accepts]: Start accepts. Automaton has 3185 states and 4361 transitions. Word has length 55 [2022-07-14 04:36:30,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:36:30,346 INFO L495 AbstractCegarLoop]: Abstraction has 3185 states and 4361 transitions. [2022-07-14 04:36:30,346 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-14 04:36:30,346 INFO L276 IsEmpty]: Start isEmpty. Operand 3185 states and 4361 transitions. [2022-07-14 04:36:30,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-14 04:36:30,348 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:36:30,348 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-14 04:36:30,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 04:36:30,349 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-14 04:36:30,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:36:30,350 INFO L85 PathProgramCache]: Analyzing trace with hash 162297118, now seen corresponding path program 1 times [2022-07-14 04:36:30,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:36:30,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104631108] [2022-07-14 04:36:30,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:36:30,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:36:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:30,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:36:30,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:30,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:36:30,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:30,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:36:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:30,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 04:36:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:30,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:36:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:30,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-14 04:36:30,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:30,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:36:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:30,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:36:30,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:30,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:36:30,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:30,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:36:30,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:30,726 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-14 04:36:30,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:36:30,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104631108] [2022-07-14 04:36:30,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104631108] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:36:30,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:36:30,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:36:30,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096737799] [2022-07-14 04:36:30,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:36:30,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:36:30,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:36:30,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:36:30,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:36:30,729 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-14 04:36:35,971 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-14 04:36:39,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:36:39,929 INFO L93 Difference]: Finished difference Result 3185 states and 4361 transitions. [2022-07-14 04:36:39,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:36:39,931 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-14 04:36:39,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:36:39,945 INFO L225 Difference]: With dead ends: 3185 [2022-07-14 04:36:39,946 INFO L226 Difference]: Without dead ends: 3183 [2022-07-14 04:36:39,948 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-14 04:36:39,949 INFO L413 NwaCegarLoop]: 3591 mSDtfsCounter, 6952 mSDsluCounter, 1870 mSDsCounter, 0 mSdLazyCounter, 4352 mSolverCounterSat, 3728 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s 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.9s IncrementalHoareTripleChecker+Time [2022-07-14 04:36:39,949 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.9s Time] [2022-07-14 04:36:39,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3183 states. [2022-07-14 04:36:40,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3183 to 3183. [2022-07-14 04:36:40,033 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-14 04:36:40,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 3183 states and 4359 transitions. [2022-07-14 04:36:40,043 INFO L78 Accepts]: Start accepts. Automaton has 3183 states and 4359 transitions. Word has length 77 [2022-07-14 04:36:40,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:36:40,043 INFO L495 AbstractCegarLoop]: Abstraction has 3183 states and 4359 transitions. [2022-07-14 04:36:40,044 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-14 04:36:40,044 INFO L276 IsEmpty]: Start isEmpty. Operand 3183 states and 4359 transitions. [2022-07-14 04:36:40,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-14 04:36:40,045 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:36:40,046 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-14 04:36:40,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 04:36:40,046 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-14 04:36:40,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:36:40,046 INFO L85 PathProgramCache]: Analyzing trace with hash -2088716267, now seen corresponding path program 1 times [2022-07-14 04:36:40,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:36:40,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076685471] [2022-07-14 04:36:40,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:36:40,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:36:40,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:40,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:36:40,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:40,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:36:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:40,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:36:40,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:40,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 04:36:40,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:40,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:36:40,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:40,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-14 04:36:40,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:40,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:36:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:40,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:36:40,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:40,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:36:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:40,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:36:40,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:40,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:36:40,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:40,360 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-14 04:36:40,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:36:40,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076685471] [2022-07-14 04:36:40,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076685471] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:36:40,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:36:40,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:36:40,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690056754] [2022-07-14 04:36:40,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:36:40,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:36:40,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:36:40,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:36:40,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:36:40,363 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-14 04:36:45,556 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:36:48,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:36:48,601 INFO L93 Difference]: Finished difference Result 3183 states and 4359 transitions. [2022-07-14 04:36:48,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:36:48,602 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-14 04:36:48,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:36:48,615 INFO L225 Difference]: With dead ends: 3183 [2022-07-14 04:36:48,616 INFO L226 Difference]: Without dead ends: 3181 [2022-07-14 04:36:48,617 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-14 04:36:48,618 INFO L413 NwaCegarLoop]: 3589 mSDtfsCounter, 6946 mSDsluCounter, 1870 mSDsCounter, 0 mSdLazyCounter, 4351 mSolverCounterSat, 3728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s 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.9s IncrementalHoareTripleChecker+Time [2022-07-14 04:36:48,618 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.9s Time] [2022-07-14 04:36:48,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3181 states. [2022-07-14 04:36:48,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3181 to 3181. [2022-07-14 04:36:48,706 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-14 04:36:48,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 4357 transitions. [2022-07-14 04:36:48,716 INFO L78 Accepts]: Start accepts. Automaton has 3181 states and 4357 transitions. Word has length 83 [2022-07-14 04:36:48,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:36:48,716 INFO L495 AbstractCegarLoop]: Abstraction has 3181 states and 4357 transitions. [2022-07-14 04:36:48,717 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-14 04:36:48,717 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 4357 transitions. [2022-07-14 04:36:48,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-14 04:36:48,718 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:36:48,718 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-14 04:36:48,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 04:36:48,718 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-14 04:36:48,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:36:48,719 INFO L85 PathProgramCache]: Analyzing trace with hash 257795529, now seen corresponding path program 1 times [2022-07-14 04:36:48,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:36:48,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856847129] [2022-07-14 04:36:48,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:36:48,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:36:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:48,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:36:48,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:48,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:36:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:48,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:36:48,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:48,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 04:36:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:48,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:36:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:48,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-14 04:36:48,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:49,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:36:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:49,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:36:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:49,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:36:49,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:49,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:36:49,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:49,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:36:49,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:49,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:36:49,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:49,074 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-14 04:36:49,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:36:49,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856847129] [2022-07-14 04:36:49,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856847129] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:36:49,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:36:49,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:36:49,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495044833] [2022-07-14 04:36:49,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:36:49,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:36:49,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:36:49,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:36:49,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:36:49,077 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-14 04:36:56,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:36:56,617 INFO L93 Difference]: Finished difference Result 3181 states and 4357 transitions. [2022-07-14 04:36:56,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:36:56,618 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-14 04:36:56,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:36:56,631 INFO L225 Difference]: With dead ends: 3181 [2022-07-14 04:36:56,632 INFO L226 Difference]: Without dead ends: 3179 [2022-07-14 04:36:56,633 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-14 04:36:56,634 INFO L413 NwaCegarLoop]: 3587 mSDtfsCounter, 6940 mSDsluCounter, 1870 mSDsCounter, 0 mSdLazyCounter, 4349 mSolverCounterSat, 3728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s 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.3s IncrementalHoareTripleChecker+Time [2022-07-14 04:36:56,634 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.3s Time] [2022-07-14 04:36:56,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3179 states. [2022-07-14 04:36:56,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3179 to 3179. [2022-07-14 04:36:56,787 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-14 04:36:56,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3179 states to 3179 states and 4355 transitions. [2022-07-14 04:36:56,796 INFO L78 Accepts]: Start accepts. Automaton has 3179 states and 4355 transitions. Word has length 89 [2022-07-14 04:36:56,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:36:56,797 INFO L495 AbstractCegarLoop]: Abstraction has 3179 states and 4355 transitions. [2022-07-14 04:36:56,797 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-14 04:36:56,797 INFO L276 IsEmpty]: Start isEmpty. Operand 3179 states and 4355 transitions. [2022-07-14 04:36:56,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-14 04:36:56,802 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:36:56,802 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-14 04:36:56,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 04:36:56,803 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-14 04:36:56,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:36:56,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1869749641, now seen corresponding path program 1 times [2022-07-14 04:36:56,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:36:56,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307446326] [2022-07-14 04:36:56,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:36:56,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:36:56,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:57,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:36:57,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:57,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:36:57,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:57,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:36:57,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:57,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 04:36:57,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:57,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:36:57,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:57,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-14 04:36:57,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:57,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:36:57,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:57,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:36:57,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:57,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:36:57,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:57,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:36:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:57,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:36:57,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:57,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:36:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:57,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 04:36:57,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:57,143 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-14 04:36:57,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:36:57,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307446326] [2022-07-14 04:36:57,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307446326] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:36:57,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:36:57,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:36:57,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668821205] [2022-07-14 04:36:57,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:36:57,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:36:57,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:36:57,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:36:57,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:36:57,146 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-14 04:37:04,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:37:04,539 INFO L93 Difference]: Finished difference Result 3179 states and 4355 transitions. [2022-07-14 04:37:04,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:37:04,540 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-14 04:37:04,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:37:04,557 INFO L225 Difference]: With dead ends: 3179 [2022-07-14 04:37:04,558 INFO L226 Difference]: Without dead ends: 3177 [2022-07-14 04:37:04,560 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-14 04:37:04,560 INFO L413 NwaCegarLoop]: 3585 mSDtfsCounter, 6934 mSDsluCounter, 1870 mSDsCounter, 0 mSdLazyCounter, 4347 mSolverCounterSat, 3728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s 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.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:37:04,561 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.1s Time] [2022-07-14 04:37:04,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3177 states. [2022-07-14 04:37:04,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3177 to 3177. [2022-07-14 04:37:04,680 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-14 04:37:04,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3177 states to 3177 states and 4353 transitions. [2022-07-14 04:37:04,691 INFO L78 Accepts]: Start accepts. Automaton has 3177 states and 4353 transitions. Word has length 95 [2022-07-14 04:37:04,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:37:04,692 INFO L495 AbstractCegarLoop]: Abstraction has 3177 states and 4353 transitions. [2022-07-14 04:37:04,692 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-14 04:37:04,692 INFO L276 IsEmpty]: Start isEmpty. Operand 3177 states and 4353 transitions. [2022-07-14 04:37:04,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-14 04:37:04,693 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:37:04,694 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:37:04,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 04:37:04,694 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-14 04:37:04,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:37:04,694 INFO L85 PathProgramCache]: Analyzing trace with hash 500393985, now seen corresponding path program 1 times [2022-07-14 04:37:04,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:37:04,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869994278] [2022-07-14 04:37:04,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:37:04,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:37:04,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:04,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:37:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:04,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:37:04,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:04,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:37:04,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:04,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 04:37:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:04,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:37:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:04,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-14 04:37:04,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:04,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:37:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:04,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:37:05,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:05,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:37:05,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:05,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:37:05,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:05,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:37:05,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:05,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:37:05,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:05,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 04:37:05,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:05,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 04:37:05,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:05,053 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-14 04:37:05,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:37:05,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869994278] [2022-07-14 04:37:05,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869994278] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:37:05,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:37:05,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:37:05,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978219495] [2022-07-14 04:37:05,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:37:05,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:37:05,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:37:05,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:37:05,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:37:05,055 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-14 04:37:11,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:37:11,840 INFO L93 Difference]: Finished difference Result 3177 states and 4353 transitions. [2022-07-14 04:37:11,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:37:11,840 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-14 04:37:11,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:37:11,851 INFO L225 Difference]: With dead ends: 3177 [2022-07-14 04:37:11,852 INFO L226 Difference]: Without dead ends: 3175 [2022-07-14 04:37:11,853 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-14 04:37:11,853 INFO L413 NwaCegarLoop]: 3583 mSDtfsCounter, 6928 mSDsluCounter, 1870 mSDsCounter, 0 mSdLazyCounter, 4345 mSolverCounterSat, 3728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7119 SdHoareTripleChecker+Valid, 5453 SdHoareTripleChecker+Invalid, 8073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3728 IncrementalHoareTripleChecker+Valid, 4345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-07-14 04:37:11,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7119 Valid, 5453 Invalid, 8073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3728 Valid, 4345 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2022-07-14 04:37:11,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3175 states. [2022-07-14 04:37:11,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3175 to 3175. [2022-07-14 04:37:11,944 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-14 04:37:11,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3175 states to 3175 states and 4351 transitions. [2022-07-14 04:37:11,953 INFO L78 Accepts]: Start accepts. Automaton has 3175 states and 4351 transitions. Word has length 101 [2022-07-14 04:37:11,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:37:11,953 INFO L495 AbstractCegarLoop]: Abstraction has 3175 states and 4351 transitions. [2022-07-14 04:37:11,953 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-14 04:37:11,953 INFO L276 IsEmpty]: Start isEmpty. Operand 3175 states and 4351 transitions. [2022-07-14 04:37:11,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-14 04:37:11,955 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:37:11,955 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-14 04:37:11,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 04:37:11,955 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-14 04:37:11,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:37:11,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1002834405, now seen corresponding path program 1 times [2022-07-14 04:37:11,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:37:11,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219049079] [2022-07-14 04:37:11,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:37:11,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:37:12,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:12,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:37:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:12,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:37:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:12,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:37:12,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:12,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 04:37:12,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:12,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:37:12,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:12,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-14 04:37:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:12,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:37:12,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:12,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:37:12,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:12,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:37:12,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:12,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:37:12,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:12,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:37:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:12,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:37:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:12,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 04:37:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:12,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 04:37:12,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:12,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 04:37:12,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:12,247 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-14 04:37:12,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:37:12,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219049079] [2022-07-14 04:37:12,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219049079] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:37:12,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:37:12,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:37:12,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107196824] [2022-07-14 04:37:12,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:37:12,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:37:12,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:37:12,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:37:12,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:37:12,249 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-14 04:37:17,153 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-14 04:37:20,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:37:20,567 INFO L93 Difference]: Finished difference Result 3175 states and 4351 transitions. [2022-07-14 04:37:20,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:37:20,568 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-14 04:37:20,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:37:20,579 INFO L225 Difference]: With dead ends: 3175 [2022-07-14 04:37:20,579 INFO L226 Difference]: Without dead ends: 3173 [2022-07-14 04:37:20,581 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-14 04:37:20,581 INFO L413 NwaCegarLoop]: 3581 mSDtfsCounter, 6922 mSDsluCounter, 1870 mSDsCounter, 0 mSdLazyCounter, 4342 mSolverCounterSat, 3728 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7112 SdHoareTripleChecker+Valid, 5451 SdHoareTripleChecker+Invalid, 8071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3728 IncrementalHoareTripleChecker+Valid, 4342 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:37:20,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7112 Valid, 5451 Invalid, 8071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3728 Valid, 4342 Invalid, 1 Unknown, 0 Unchecked, 8.1s Time] [2022-07-14 04:37:20,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3173 states. [2022-07-14 04:37:20,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3173 to 3173. [2022-07-14 04:37:20,705 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-14 04:37:20,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3173 states to 3173 states and 4349 transitions. [2022-07-14 04:37:20,713 INFO L78 Accepts]: Start accepts. Automaton has 3173 states and 4349 transitions. Word has length 107 [2022-07-14 04:37:20,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:37:20,714 INFO L495 AbstractCegarLoop]: Abstraction has 3173 states and 4349 transitions. [2022-07-14 04:37:20,714 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-14 04:37:20,714 INFO L276 IsEmpty]: Start isEmpty. Operand 3173 states and 4349 transitions. [2022-07-14 04:37:20,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-14 04:37:20,715 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:37:20,715 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-14 04:37:20,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 04:37:20,716 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-14 04:37:20,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:37:20,717 INFO L85 PathProgramCache]: Analyzing trace with hash -379953983, now seen corresponding path program 1 times [2022-07-14 04:37:20,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:37:20,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326727136] [2022-07-14 04:37:20,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:37:20,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:37:20,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:20,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:37:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:20,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:37:20,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:20,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:37:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:20,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 04:37:20,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:20,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:37:20,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:21,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-14 04:37:21,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:21,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:37:21,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:21,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:37:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:21,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:37:21,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:21,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:37:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:21,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:37:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:21,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:37:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:21,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 04:37:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:21,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 04:37:21,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:21,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 04:37:21,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:21,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 04:37:21,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:21,101 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-14 04:37:21,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:37:21,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326727136] [2022-07-14 04:37:21,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326727136] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:37:21,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:37:21,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:37:21,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525685124] [2022-07-14 04:37:21,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:37:21,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:37:21,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:37:21,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:37:21,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:37:21,103 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-14 04:37:25,428 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:37:28,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:37:28,648 INFO L93 Difference]: Finished difference Result 3173 states and 4349 transitions. [2022-07-14 04:37:28,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:37:28,649 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-14 04:37:28,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:37:28,658 INFO L225 Difference]: With dead ends: 3173 [2022-07-14 04:37:28,658 INFO L226 Difference]: Without dead ends: 3171 [2022-07-14 04:37:28,659 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-14 04:37:28,660 INFO L413 NwaCegarLoop]: 3579 mSDtfsCounter, 6916 mSDsluCounter, 1870 mSDsCounter, 0 mSdLazyCounter, 4341 mSolverCounterSat, 3728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7105 SdHoareTripleChecker+Valid, 5449 SdHoareTripleChecker+Invalid, 8069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3728 IncrementalHoareTripleChecker+Valid, 4341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-07-14 04:37:28,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7105 Valid, 5449 Invalid, 8069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3728 Valid, 4341 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2022-07-14 04:37:28,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3171 states. [2022-07-14 04:37:28,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3171 to 3171. [2022-07-14 04:37:28,762 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-14 04:37:28,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3171 states to 3171 states and 4347 transitions. [2022-07-14 04:37:28,771 INFO L78 Accepts]: Start accepts. Automaton has 3171 states and 4347 transitions. Word has length 113 [2022-07-14 04:37:28,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:37:28,771 INFO L495 AbstractCegarLoop]: Abstraction has 3171 states and 4347 transitions. [2022-07-14 04:37:28,772 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-14 04:37:28,772 INFO L276 IsEmpty]: Start isEmpty. Operand 3171 states and 4347 transitions. [2022-07-14 04:37:28,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-14 04:37:28,773 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:37:28,773 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:37:28,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 04:37:28,773 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-14 04:37:28,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:37:28,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1159146525, now seen corresponding path program 1 times [2022-07-14 04:37:28,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:37:28,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508625400] [2022-07-14 04:37:28,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:37:28,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:37:28,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:28,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:37:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:28,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:37:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:28,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:37:28,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:28,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 04:37:28,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:28,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:37:28,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:28,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-14 04:37:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:28,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:37:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:28,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:37:28,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:28,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:37:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:29,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:37:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:29,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:37:29,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:29,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:37:29,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:29,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 04:37:29,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:29,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 04:37:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:29,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 04:37:29,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:29,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 04:37:29,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:29,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 04:37:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:29,061 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-14 04:37:29,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:37:29,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508625400] [2022-07-14 04:37:29,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508625400] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:37:29,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:37:29,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:37:29,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733968946] [2022-07-14 04:37:29,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:37:29,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:37:29,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:37:29,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:37:29,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:37:29,064 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-14 04:37:35,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:37:35,947 INFO L93 Difference]: Finished difference Result 3171 states and 4347 transitions. [2022-07-14 04:37:35,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:37:35,948 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-14 04:37:35,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:37:35,962 INFO L225 Difference]: With dead ends: 3171 [2022-07-14 04:37:35,962 INFO L226 Difference]: Without dead ends: 3169 [2022-07-14 04:37:35,963 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-14 04:37:35,964 INFO L413 NwaCegarLoop]: 3577 mSDtfsCounter, 6914 mSDsluCounter, 1870 mSDsCounter, 0 mSdLazyCounter, 4335 mSolverCounterSat, 3728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7102 SdHoareTripleChecker+Valid, 5447 SdHoareTripleChecker+Invalid, 8063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3728 IncrementalHoareTripleChecker+Valid, 4335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-07-14 04:37:35,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7102 Valid, 5447 Invalid, 8063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3728 Valid, 4335 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2022-07-14 04:37:35,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3169 states. [2022-07-14 04:37:36,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3169 to 3169. [2022-07-14 04:37:36,095 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-14 04:37:36,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3169 states to 3169 states and 4345 transitions. [2022-07-14 04:37:36,106 INFO L78 Accepts]: Start accepts. Automaton has 3169 states and 4345 transitions. Word has length 119 [2022-07-14 04:37:36,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:37:36,107 INFO L495 AbstractCegarLoop]: Abstraction has 3169 states and 4345 transitions. [2022-07-14 04:37:36,107 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-14 04:37:36,107 INFO L276 IsEmpty]: Start isEmpty. Operand 3169 states and 4345 transitions. [2022-07-14 04:37:36,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-14 04:37:36,109 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:37:36,109 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-14 04:37:36,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 04:37:36,110 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-14 04:37:36,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:37:36,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1543506560, now seen corresponding path program 1 times [2022-07-14 04:37:36,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:37:36,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851244018] [2022-07-14 04:37:36,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:37:36,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:37:36,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:36,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:37:36,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:36,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:37:36,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:36,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:37:36,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:36,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 04:37:36,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:36,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:37:36,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:36,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-14 04:37:36,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:36,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:37:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:36,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:37:36,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:36,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:37:36,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:36,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:37:36,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:36,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:37:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:36,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:37:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:36,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 04:37:36,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:36,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 04:37:36,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:36,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 04:37:36,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:36,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 04:37:36,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:36,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 04:37:36,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:36,566 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-14 04:37:36,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:37:36,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851244018] [2022-07-14 04:37:36,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851244018] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:37:36,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:37:36,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:37:36,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876270282] [2022-07-14 04:37:36,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:37:36,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:37:36,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:37:36,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:37:36,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:37:36,568 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-14 04:37:43,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:37:43,445 INFO L93 Difference]: Finished difference Result 3169 states and 4345 transitions. [2022-07-14 04:37:43,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:37:43,446 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-14 04:37:43,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:37:43,455 INFO L225 Difference]: With dead ends: 3169 [2022-07-14 04:37:43,455 INFO L226 Difference]: Without dead ends: 3167 [2022-07-14 04:37:43,456 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-14 04:37:43,457 INFO L413 NwaCegarLoop]: 3575 mSDtfsCounter, 6902 mSDsluCounter, 1870 mSDsCounter, 0 mSdLazyCounter, 4337 mSolverCounterSat, 3728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s 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, 6.6s IncrementalHoareTripleChecker+Time [2022-07-14 04:37:43,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7090 Valid, 5445 Invalid, 8065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3728 Valid, 4337 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2022-07-14 04:37:43,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3167 states. [2022-07-14 04:37:43,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3167 to 3167. [2022-07-14 04:37:43,549 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-14 04:37:43,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3167 states to 3167 states and 4343 transitions. [2022-07-14 04:37:43,560 INFO L78 Accepts]: Start accepts. Automaton has 3167 states and 4343 transitions. Word has length 121 [2022-07-14 04:37:43,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:37:43,560 INFO L495 AbstractCegarLoop]: Abstraction has 3167 states and 4343 transitions. [2022-07-14 04:37:43,560 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-14 04:37:43,561 INFO L276 IsEmpty]: Start isEmpty. Operand 3167 states and 4343 transitions. [2022-07-14 04:37:43,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-14 04:37:43,562 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:37:43,562 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-14 04:37:43,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 04:37:43,562 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-14 04:37:43,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:37:43,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1479640238, now seen corresponding path program 1 times [2022-07-14 04:37:43,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:37:43,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213730223] [2022-07-14 04:37:43,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:37:43,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:37:43,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:43,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:37:43,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:43,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:37:43,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:43,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:37:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:43,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 04:37:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:43,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:37:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:43,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-14 04:37:43,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:43,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:37:43,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:43,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:37:43,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:43,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:37:43,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:43,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:37:43,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:43,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:37:43,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:43,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:37:43,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:43,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 04:37:43,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:43,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 04:37:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:43,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 04:37:43,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:43,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 04:37:43,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:43,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 04:37:43,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:43,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-14 04:37:43,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:43,952 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-14 04:37:43,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:37:43,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213730223] [2022-07-14 04:37:43,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213730223] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:37:43,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:37:43,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:37:43,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281049726] [2022-07-14 04:37:43,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:37:43,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:37:43,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:37:43,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:37:43,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:37:43,955 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-14 04:37:50,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:37:50,321 INFO L93 Difference]: Finished difference Result 3167 states and 4343 transitions. [2022-07-14 04:37:50,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:37:50,321 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-14 04:37:50,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:37:50,331 INFO L225 Difference]: With dead ends: 3167 [2022-07-14 04:37:50,332 INFO L226 Difference]: Without dead ends: 3165 [2022-07-14 04:37:50,333 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-14 04:37:50,333 INFO L413 NwaCegarLoop]: 3573 mSDtfsCounter, 6898 mSDsluCounter, 1870 mSDsCounter, 0 mSdLazyCounter, 4335 mSolverCounterSat, 3728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s 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, 6.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:37:50,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7085 Valid, 5443 Invalid, 8063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3728 Valid, 4335 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-07-14 04:37:50,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3165 states. [2022-07-14 04:37:50,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3165 to 3165. [2022-07-14 04:37:50,426 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-14 04:37:50,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3165 states to 3165 states and 4341 transitions. [2022-07-14 04:37:50,435 INFO L78 Accepts]: Start accepts. Automaton has 3165 states and 4341 transitions. Word has length 127 [2022-07-14 04:37:50,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:37:50,436 INFO L495 AbstractCegarLoop]: Abstraction has 3165 states and 4341 transitions. [2022-07-14 04:37:50,436 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-14 04:37:50,436 INFO L276 IsEmpty]: Start isEmpty. Operand 3165 states and 4341 transitions. [2022-07-14 04:37:50,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-14 04:37:50,437 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:37:50,437 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-14 04:37:50,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-14 04:37:50,438 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-14 04:37:50,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:37:50,438 INFO L85 PathProgramCache]: Analyzing trace with hash -762027428, now seen corresponding path program 1 times [2022-07-14 04:37:50,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:37:50,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997370164] [2022-07-14 04:37:50,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:37:50,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:37:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:50,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:37:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:50,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:37:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:50,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:37:50,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:50,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 04:37:50,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:50,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 04:37:50,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:50,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:37:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:50,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:37:50,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:50,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:37:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:50,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-14 04:37:50,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:50,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:37:50,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:50,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:37:50,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:50,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:37:50,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:50,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:37:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:50,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:37:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:50,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:37:50,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:50,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:37:50,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:50,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-14 04:37:50,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:50,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:37:50,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:50,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:37:50,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:50,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:37:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:50,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-14 04:37:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:50,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:37:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:50,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:37:50,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:50,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:37:50,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:50,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-14 04:37:50,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:50,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-14 04:37:50,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:50,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-14 04:37:50,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:50,835 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-14 04:37:50,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:37:50,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997370164] [2022-07-14 04:37:50,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997370164] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:37:50,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:37:50,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:37:50,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753204842] [2022-07-14 04:37:50,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:37:50,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:37:50,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:37:50,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:37:50,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:37:50,837 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-14 04:37:58,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:37:58,051 INFO L93 Difference]: Finished difference Result 6376 states and 8793 transitions. [2022-07-14 04:37:58,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 04:37:58,052 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-14 04:37:58,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:37:58,065 INFO L225 Difference]: With dead ends: 6376 [2022-07-14 04:37:58,065 INFO L226 Difference]: Without dead ends: 3371 [2022-07-14 04:37:58,076 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-14 04:37:58,077 INFO L413 NwaCegarLoop]: 3375 mSDtfsCounter, 8239 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 3166 mSolverCounterSat, 5243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8452 SdHoareTripleChecker+Valid, 4999 SdHoareTripleChecker+Invalid, 8409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5243 IncrementalHoareTripleChecker+Valid, 3166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-07-14 04:37:58,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8452 Valid, 4999 Invalid, 8409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5243 Valid, 3166 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2022-07-14 04:37:58,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3371 states. [2022-07-14 04:37:58,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3371 to 3170. [2022-07-14 04:37:58,187 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-14 04:37:58,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3170 states to 3170 states and 4348 transitions. [2022-07-14 04:37:58,197 INFO L78 Accepts]: Start accepts. Automaton has 3170 states and 4348 transitions. Word has length 168 [2022-07-14 04:37:58,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:37:58,197 INFO L495 AbstractCegarLoop]: Abstraction has 3170 states and 4348 transitions. [2022-07-14 04:37:58,198 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-14 04:37:58,198 INFO L276 IsEmpty]: Start isEmpty. Operand 3170 states and 4348 transitions. [2022-07-14 04:37:58,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-14 04:37:58,199 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:37:58,199 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-14 04:37:58,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 04:37:58,200 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-14 04:37:58,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:37:58,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1769654094, now seen corresponding path program 1 times [2022-07-14 04:37:58,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:37:58,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127557025] [2022-07-14 04:37:58,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:37:58,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:37:58,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:58,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:37:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:58,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:37:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:58,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:37:58,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:58,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 04:37:58,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:58,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:37:58,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:58,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-14 04:37:58,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:58,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:37:58,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:58,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:37:58,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:58,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:37:58,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:58,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:37:58,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:58,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:37:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:58,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:37:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:58,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 04:37:58,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:58,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 04:37:58,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:58,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 04:37:58,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:58,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 04:37:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:58,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 04:37:58,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:58,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-14 04:37:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:58,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 04:37:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:58,513 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-14 04:37:58,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:37:58,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127557025] [2022-07-14 04:37:58,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127557025] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:37:58,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:37:58,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:37:58,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894333547] [2022-07-14 04:37:58,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:37:58,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:37:58,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:37:58,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:37:58,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:37:58,517 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-14 04:38:04,350 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-14 04:38:08,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:38:08,588 INFO L93 Difference]: Finished difference Result 3170 states and 4348 transitions. [2022-07-14 04:38:08,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:38:08,588 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-14 04:38:08,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:38:08,597 INFO L225 Difference]: With dead ends: 3170 [2022-07-14 04:38:08,597 INFO L226 Difference]: Without dead ends: 3168 [2022-07-14 04:38:08,598 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-14 04:38:08,599 INFO L413 NwaCegarLoop]: 3566 mSDtfsCounter, 6887 mSDsluCounter, 1856 mSDsCounter, 0 mSdLazyCounter, 4331 mSolverCounterSat, 3728 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7073 SdHoareTripleChecker+Valid, 5422 SdHoareTripleChecker+Invalid, 8060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3728 IncrementalHoareTripleChecker+Valid, 4331 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2022-07-14 04:38:08,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7073 Valid, 5422 Invalid, 8060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3728 Valid, 4331 Invalid, 1 Unknown, 0 Unchecked, 9.7s Time] [2022-07-14 04:38:08,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3168 states. [2022-07-14 04:38:08,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3168 to 3168. [2022-07-14 04:38:08,699 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-14 04:38:08,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3168 states to 3168 states and 4346 transitions. [2022-07-14 04:38:08,709 INFO L78 Accepts]: Start accepts. Automaton has 3168 states and 4346 transitions. Word has length 133 [2022-07-14 04:38:08,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:38:08,709 INFO L495 AbstractCegarLoop]: Abstraction has 3168 states and 4346 transitions. [2022-07-14 04:38:08,709 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-14 04:38:08,710 INFO L276 IsEmpty]: Start isEmpty. Operand 3168 states and 4346 transitions. [2022-07-14 04:38:08,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-07-14 04:38:08,711 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:38:08,711 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-14 04:38:08,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-14 04:38:08,711 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-14 04:38:08,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:38:08,712 INFO L85 PathProgramCache]: Analyzing trace with hash -65475925, now seen corresponding path program 1 times [2022-07-14 04:38:08,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:38:08,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508608912] [2022-07-14 04:38:08,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:38:08,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:38:08,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:08,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:38:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:08,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:38:08,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:08,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:38:08,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:08,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 04:38:08,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:08,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 04:38:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:08,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:08,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:08,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:38:08,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:08,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:38:08,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:08,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-14 04:38:08,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:08,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:08,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:08,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:38:08,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:08,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:38:08,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:08,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:38:08,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:08,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:08,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:09,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:38:09,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:09,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:38:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:09,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-14 04:38:09,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:09,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:09,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:09,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:38:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:09,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:38:09,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:09,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-14 04:38:09,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:09,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:09,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:09,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:38:09,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:09,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:38:09,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:09,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-14 04:38:09,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:09,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-14 04:38:09,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:09,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-14 04:38:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:09,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-14 04:38:09,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:09,121 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-14 04:38:09,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:38:09,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508608912] [2022-07-14 04:38:09,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508608912] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:38:09,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573048767] [2022-07-14 04:38:09,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:38:09,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:38:09,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:38:09,124 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-14 04:38:09,126 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-14 04:38:10,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:10,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 4430 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 04:38:10,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:38:10,347 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-14 04:38:10,347 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 04:38:10,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573048767] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:38:10,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 04:38:10,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-07-14 04:38:10,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530712412] [2022-07-14 04:38:10,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:38:10,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 04:38:10,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:38:10,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 04:38:10,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:38:10,349 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-14 04:38:10,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:38:10,536 INFO L93 Difference]: Finished difference Result 6251 states and 8554 transitions. [2022-07-14 04:38:10,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 04:38:10,537 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-14 04:38:10,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:38:10,547 INFO L225 Difference]: With dead ends: 6251 [2022-07-14 04:38:10,547 INFO L226 Difference]: Without dead ends: 3246 [2022-07-14 04:38:10,558 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-14 04:38:10,558 INFO L413 NwaCegarLoop]: 4208 mSDtfsCounter, 4091 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:38:10,559 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.1s Time] [2022-07-14 04:38:10,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3246 states. [2022-07-14 04:38:10,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3246 to 3243. [2022-07-14 04:38:10,684 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-14 04:38:10,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3243 states to 3243 states and 4434 transitions. [2022-07-14 04:38:10,695 INFO L78 Accepts]: Start accepts. Automaton has 3243 states and 4434 transitions. Word has length 174 [2022-07-14 04:38:10,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:38:10,695 INFO L495 AbstractCegarLoop]: Abstraction has 3243 states and 4434 transitions. [2022-07-14 04:38:10,695 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-14 04:38:10,695 INFO L276 IsEmpty]: Start isEmpty. Operand 3243 states and 4434 transitions. [2022-07-14 04:38:10,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-14 04:38:10,697 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:38:10,697 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-14 04:38:10,729 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-14 04:38:10,901 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-14 04:38:10,901 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-14 04:38:10,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:38:10,902 INFO L85 PathProgramCache]: Analyzing trace with hash 783970037, now seen corresponding path program 1 times [2022-07-14 04:38:10,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:38:10,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819590474] [2022-07-14 04:38:10,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:38:10,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:38:10,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:11,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:38:11,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:11,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:38:11,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:11,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:38:11,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:11,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 04:38:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:11,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:38:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:11,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-14 04:38:11,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:11,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:38:11,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:11,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:11,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:11,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:38:11,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:11,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:38:11,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:11,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:38:11,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:11,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:38:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:11,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 04:38:11,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:11,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 04:38:11,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:11,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 04:38:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:11,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 04:38:11,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:11,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 04:38:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:11,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-14 04:38:11,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:11,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 04:38:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:11,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-14 04:38:11,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:11,254 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-14 04:38:11,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:38:11,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819590474] [2022-07-14 04:38:11,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819590474] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:38:11,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:38:11,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:38:11,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992280826] [2022-07-14 04:38:11,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:38:11,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:38:11,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:38:11,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:38:11,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:38:11,256 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-14 04:38:15,778 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:38:18,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:38:18,994 INFO L93 Difference]: Finished difference Result 3243 states and 4434 transitions. [2022-07-14 04:38:18,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:38:18,995 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-14 04:38:18,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:38:19,002 INFO L225 Difference]: With dead ends: 3243 [2022-07-14 04:38:19,002 INFO L226 Difference]: Without dead ends: 3241 [2022-07-14 04:38:19,003 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-14 04:38:19,004 INFO L413 NwaCegarLoop]: 3559 mSDtfsCounter, 6876 mSDsluCounter, 1842 mSDsCounter, 0 mSdLazyCounter, 4329 mSolverCounterSat, 3728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7061 SdHoareTripleChecker+Valid, 5401 SdHoareTripleChecker+Invalid, 8057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3728 IncrementalHoareTripleChecker+Valid, 4329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:38:19,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7061 Valid, 5401 Invalid, 8057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3728 Valid, 4329 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2022-07-14 04:38:19,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3241 states. [2022-07-14 04:38:19,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3241 to 3241. [2022-07-14 04:38:19,118 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-14 04:38:19,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 4432 transitions. [2022-07-14 04:38:19,126 INFO L78 Accepts]: Start accepts. Automaton has 3241 states and 4432 transitions. Word has length 139 [2022-07-14 04:38:19,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:38:19,127 INFO L495 AbstractCegarLoop]: Abstraction has 3241 states and 4432 transitions. [2022-07-14 04:38:19,127 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-14 04:38:19,127 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 4432 transitions. [2022-07-14 04:38:19,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-14 04:38:19,129 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:38:19,129 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-14 04:38:19,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-14 04:38:19,129 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-14 04:38:19,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:38:19,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1655545842, now seen corresponding path program 1 times [2022-07-14 04:38:19,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:38:19,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143574239] [2022-07-14 04:38:19,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:38:19,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:38:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:19,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:38:19,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:19,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:38:19,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:19,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:38:19,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:19,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 04:38:19,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:19,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:38:19,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:19,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-14 04:38:19,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:19,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:38:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:19,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:19,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:19,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:38:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:19,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:38:19,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:19,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:38:19,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:19,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:38:19,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:19,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 04:38:19,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:19,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 04:38:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:19,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 04:38:19,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:19,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 04:38:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:19,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 04:38:19,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:19,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-14 04:38:19,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:19,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 04:38:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:19,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-14 04:38:19,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:19,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-14 04:38:19,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:19,409 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-14 04:38:19,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:38:19,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143574239] [2022-07-14 04:38:19,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143574239] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:38:19,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:38:19,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:38:19,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361739739] [2022-07-14 04:38:19,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:38:19,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:38:19,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:38:19,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:38:19,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:38:19,411 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-14 04:38:26,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:38:26,616 INFO L93 Difference]: Finished difference Result 3241 states and 4432 transitions. [2022-07-14 04:38:26,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:38:26,617 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-14 04:38:26,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:38:26,626 INFO L225 Difference]: With dead ends: 3241 [2022-07-14 04:38:26,626 INFO L226 Difference]: Without dead ends: 3239 [2022-07-14 04:38:26,627 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-14 04:38:26,627 INFO L413 NwaCegarLoop]: 3557 mSDtfsCounter, 6870 mSDsluCounter, 1842 mSDsCounter, 0 mSdLazyCounter, 4327 mSolverCounterSat, 3728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7054 SdHoareTripleChecker+Valid, 5399 SdHoareTripleChecker+Invalid, 8055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3728 IncrementalHoareTripleChecker+Valid, 4327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-07-14 04:38:26,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7054 Valid, 5399 Invalid, 8055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3728 Valid, 4327 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2022-07-14 04:38:26,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3239 states. [2022-07-14 04:38:26,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3239 to 3239. [2022-07-14 04:38:26,816 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-14 04:38:26,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3239 states to 3239 states and 4430 transitions. [2022-07-14 04:38:26,824 INFO L78 Accepts]: Start accepts. Automaton has 3239 states and 4430 transitions. Word has length 145 [2022-07-14 04:38:26,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:38:26,824 INFO L495 AbstractCegarLoop]: Abstraction has 3239 states and 4430 transitions. [2022-07-14 04:38:26,824 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-14 04:38:26,824 INFO L276 IsEmpty]: Start isEmpty. Operand 3239 states and 4430 transitions. [2022-07-14 04:38:26,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-14 04:38:26,826 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:38:26,826 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-14 04:38:26,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-14 04:38:26,827 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-14 04:38:26,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:38:26,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1166431932, now seen corresponding path program 1 times [2022-07-14 04:38:26,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:38:26,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84670642] [2022-07-14 04:38:26,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:38:26,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:38:26,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:26,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:38:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:26,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:38:26,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:26,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:38:26,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:27,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 04:38:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:27,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:38:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:27,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-14 04:38:27,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:27,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:38:27,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:27,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:27,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:27,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:38:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:27,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:38:27,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:27,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:38:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:27,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:38:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:27,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 04:38:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:27,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 04:38:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:27,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 04:38:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:27,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 04:38:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:27,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 04:38:27,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:27,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-14 04:38:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:27,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 04:38:27,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:27,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-14 04:38:27,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:27,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-14 04:38:27,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:27,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-14 04:38:27,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:27,116 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-14 04:38:27,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:38:27,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84670642] [2022-07-14 04:38:27,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84670642] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:38:27,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:38:27,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:38:27,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660226693] [2022-07-14 04:38:27,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:38:27,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:38:27,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:38:27,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:38:27,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:38:27,119 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-14 04:38:34,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:38:34,404 INFO L93 Difference]: Finished difference Result 3239 states and 4430 transitions. [2022-07-14 04:38:34,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:38:34,405 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-14 04:38:34,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:38:34,417 INFO L225 Difference]: With dead ends: 3239 [2022-07-14 04:38:34,417 INFO L226 Difference]: Without dead ends: 3237 [2022-07-14 04:38:34,419 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-14 04:38:34,419 INFO L413 NwaCegarLoop]: 3555 mSDtfsCounter, 6864 mSDsluCounter, 1842 mSDsCounter, 0 mSdLazyCounter, 4325 mSolverCounterSat, 3728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.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, 4325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-07-14 04:38:34,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7047 Valid, 5397 Invalid, 8053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3728 Valid, 4325 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2022-07-14 04:38:34,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3237 states. [2022-07-14 04:38:34,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3237 to 3237. [2022-07-14 04:38:34,609 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-14 04:38:34,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3237 states to 3237 states and 4428 transitions. [2022-07-14 04:38:34,621 INFO L78 Accepts]: Start accepts. Automaton has 3237 states and 4428 transitions. Word has length 151 [2022-07-14 04:38:34,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:38:34,622 INFO L495 AbstractCegarLoop]: Abstraction has 3237 states and 4428 transitions. [2022-07-14 04:38:34,622 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-14 04:38:34,622 INFO L276 IsEmpty]: Start isEmpty. Operand 3237 states and 4428 transitions. [2022-07-14 04:38:34,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-14 04:38:34,625 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:38:34,625 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-14 04:38:34,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-14 04:38:34,626 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-14 04:38:34,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:38:34,627 INFO L85 PathProgramCache]: Analyzing trace with hash 162647145, now seen corresponding path program 1 times [2022-07-14 04:38:34,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:38:34,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54097534] [2022-07-14 04:38:34,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:38:34,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:38:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:34,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:38:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:34,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:38:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:34,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:38:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:34,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 04:38:34,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:34,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:38:34,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:34,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-14 04:38:34,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:34,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:38:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:34,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:34,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:34,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:38:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:34,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:38:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:34,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:38:34,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:34,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:38:34,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:34,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 04:38:34,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:35,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 04:38:35,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:35,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 04:38:35,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:35,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 04:38:35,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:35,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 04:38:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:35,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-14 04:38:35,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:35,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 04:38:35,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:35,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-14 04:38:35,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:35,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-14 04:38:35,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:35,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-14 04:38:35,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:35,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-14 04:38:35,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:35,221 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-14 04:38:35,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:38:35,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54097534] [2022-07-14 04:38:35,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54097534] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:38:35,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:38:35,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:38:35,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202049573] [2022-07-14 04:38:35,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:38:35,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:38:35,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:38:35,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:38:35,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:38:35,225 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-14 04:38:39,770 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:38:43,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:38:43,239 INFO L93 Difference]: Finished difference Result 3237 states and 4428 transitions. [2022-07-14 04:38:43,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:38:43,240 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-14 04:38:43,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:38:43,248 INFO L225 Difference]: With dead ends: 3237 [2022-07-14 04:38:43,248 INFO L226 Difference]: Without dead ends: 3235 [2022-07-14 04:38:43,249 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-14 04:38:43,249 INFO L413 NwaCegarLoop]: 3553 mSDtfsCounter, 6858 mSDsluCounter, 1842 mSDsCounter, 0 mSdLazyCounter, 4323 mSolverCounterSat, 3728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s 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, 7.7s IncrementalHoareTripleChecker+Time [2022-07-14 04:38:43,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7040 Valid, 5395 Invalid, 8051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3728 Valid, 4323 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2022-07-14 04:38:43,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3235 states. [2022-07-14 04:38:43,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3235 to 3235. [2022-07-14 04:38:43,376 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-14 04:38:43,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3235 states to 3235 states and 4426 transitions. [2022-07-14 04:38:43,384 INFO L78 Accepts]: Start accepts. Automaton has 3235 states and 4426 transitions. Word has length 157 [2022-07-14 04:38:43,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:38:43,384 INFO L495 AbstractCegarLoop]: Abstraction has 3235 states and 4426 transitions. [2022-07-14 04:38:43,384 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-14 04:38:43,385 INFO L276 IsEmpty]: Start isEmpty. Operand 3235 states and 4426 transitions. [2022-07-14 04:38:43,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-14 04:38:43,386 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:38:43,387 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-14 04:38:43,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-14 04:38:43,387 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-14 04:38:43,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:38:43,387 INFO L85 PathProgramCache]: Analyzing trace with hash -826661930, now seen corresponding path program 1 times [2022-07-14 04:38:43,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:38:43,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411211260] [2022-07-14 04:38:43,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:38:43,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:38:43,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:43,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:38:43,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:43,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:38:43,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:43,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:38:43,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:43,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 04:38:43,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:43,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:38:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:43,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-14 04:38:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:43,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:38:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:43,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:38:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:43,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:38:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:43,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:38:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:43,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:38:43,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:43,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:38:43,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:43,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 04:38:43,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:43,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 04:38:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:43,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 04:38:43,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:43,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 04:38:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:43,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 04:38:43,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:43,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-14 04:38:43,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:43,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 04:38:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:43,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-14 04:38:43,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:43,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-14 04:38:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:43,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-14 04:38:43,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:43,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-14 04:38:43,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:43,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-14 04:38:43,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:38:43,680 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-14 04:38:43,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:38:43,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411211260] [2022-07-14 04:38:43,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411211260] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:38:43,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:38:43,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 04:38:43,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202315845] [2022-07-14 04:38:43,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:38:43,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 04:38:43,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:38:43,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 04:38:43,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-14 04:38:43,683 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-14 04:38:52,712 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:39:02,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:39:02,401 INFO L93 Difference]: Finished difference Result 6654 states and 9159 transitions. [2022-07-14 04:39:02,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 04:39:02,402 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-14 04:39:02,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:39:02,412 INFO L225 Difference]: With dead ends: 6654 [2022-07-14 04:39:02,412 INFO L226 Difference]: Without dead ends: 3810 [2022-07-14 04:39:02,420 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-14 04:39:02,421 INFO L413 NwaCegarLoop]: 3784 mSDtfsCounter, 6199 mSDsluCounter, 4857 mSDsCounter, 0 mSdLazyCounter, 18334 mSolverCounterSat, 3856 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.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, 18.2s IncrementalHoareTripleChecker+Time [2022-07-14 04:39:02,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6204 Valid, 8641 Invalid, 22190 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3856 Valid, 18334 Invalid, 0 Unknown, 0 Unchecked, 18.2s Time] [2022-07-14 04:39:02,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3810 states. [2022-07-14 04:39:02,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3810 to 3374. [2022-07-14 04:39:02,578 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-14 04:39:02,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3374 states to 3374 states and 4623 transitions. [2022-07-14 04:39:02,588 INFO L78 Accepts]: Start accepts. Automaton has 3374 states and 4623 transitions. Word has length 163 [2022-07-14 04:39:02,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:39:02,588 INFO L495 AbstractCegarLoop]: Abstraction has 3374 states and 4623 transitions. [2022-07-14 04:39:02,588 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-14 04:39:02,589 INFO L276 IsEmpty]: Start isEmpty. Operand 3374 states and 4623 transitions. [2022-07-14 04:39:02,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-14 04:39:02,591 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:39:02,591 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-14 04:39:02,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-14 04:39:02,591 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-14 04:39:02,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:39:02,591 INFO L85 PathProgramCache]: Analyzing trace with hash -400107432, now seen corresponding path program 1 times [2022-07-14 04:39:02,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:39:02,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529424579] [2022-07-14 04:39:02,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:02,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:39:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:02,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:02,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:02,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:39:02,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:02,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:39:02,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:02,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 04:39:02,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:02,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:39:02,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:02,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-14 04:39:02,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:02,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:39:02,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:02,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:02,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:02,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:39:02,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:02,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:39:02,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:02,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:39:02,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:02,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:39:02,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:02,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 04:39:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:02,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 04:39:02,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:02,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 04:39:02,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:02,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 04:39:02,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:02,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 04:39:02,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:02,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-14 04:39:02,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:02,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 04:39:02,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:02,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-14 04:39:02,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:02,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-14 04:39:02,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:02,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-14 04:39:02,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:02,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-14 04:39:02,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:02,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-14 04:39:02,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:02,937 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-14 04:39:02,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:39:02,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529424579] [2022-07-14 04:39:02,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529424579] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:39:02,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:39:02,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:39:02,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179654389] [2022-07-14 04:39:02,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:39:02,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:39:02,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:39:02,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:39:02,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:39:02,940 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-14 04:39:10,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:39:10,231 INFO L93 Difference]: Finished difference Result 3374 states and 4623 transitions. [2022-07-14 04:39:10,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:39:10,231 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-14 04:39:10,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:39:10,240 INFO L225 Difference]: With dead ends: 3374 [2022-07-14 04:39:10,240 INFO L226 Difference]: Without dead ends: 3372 [2022-07-14 04:39:10,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:39:10,241 INFO L413 NwaCegarLoop]: 3551 mSDtfsCounter, 6852 mSDsluCounter, 1842 mSDsCounter, 0 mSdLazyCounter, 4321 mSolverCounterSat, 3728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s 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, 6.9s IncrementalHoareTripleChecker+Time [2022-07-14 04:39:10,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7033 Valid, 5393 Invalid, 8049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3728 Valid, 4321 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2022-07-14 04:39:10,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3372 states. [2022-07-14 04:39:10,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3372 to 3372. [2022-07-14 04:39:10,405 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-14 04:39:10,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3372 states to 3372 states and 4621 transitions. [2022-07-14 04:39:10,414 INFO L78 Accepts]: Start accepts. Automaton has 3372 states and 4621 transitions. Word has length 163 [2022-07-14 04:39:10,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:39:10,414 INFO L495 AbstractCegarLoop]: Abstraction has 3372 states and 4621 transitions. [2022-07-14 04:39:10,414 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-14 04:39:10,415 INFO L276 IsEmpty]: Start isEmpty. Operand 3372 states and 4621 transitions. [2022-07-14 04:39:10,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-14 04:39:10,418 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:39:10,418 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-14 04:39:10,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-14 04:39:10,418 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-14 04:39:10,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:39:10,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1796644271, now seen corresponding path program 1 times [2022-07-14 04:39:10,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:39:10,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311055670] [2022-07-14 04:39:10,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:10,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:39:10,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:10,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:10,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:10,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:39:10,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:10,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:39:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:10,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 04:39:10,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:10,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:39:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:10,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-14 04:39:10,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:10,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:39:10,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:10,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:10,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:10,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:39:10,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:10,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:39:10,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:10,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:39:10,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:10,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:39:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:10,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 04:39:10,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:10,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 04:39:10,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:10,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 04:39:10,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:10,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 04:39:10,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:10,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 04:39:10,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:10,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-14 04:39:10,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:10,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 04:39:10,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:10,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-14 04:39:10,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:10,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-14 04:39:10,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:10,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-14 04:39:10,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:10,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-14 04:39:10,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:10,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-14 04:39:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:10,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-14 04:39:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:10,733 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-14 04:39:10,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:39:10,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311055670] [2022-07-14 04:39:10,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311055670] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:39:10,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:39:10,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:39:10,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77551949] [2022-07-14 04:39:10,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:39:10,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:39:10,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:39:10,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:39:10,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:39:10,735 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-14 04:39:18,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:39:18,110 INFO L93 Difference]: Finished difference Result 3372 states and 4621 transitions. [2022-07-14 04:39:18,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:39:18,111 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-14 04:39:18,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:39:18,119 INFO L225 Difference]: With dead ends: 3372 [2022-07-14 04:39:18,119 INFO L226 Difference]: Without dead ends: 3370 [2022-07-14 04:39:18,120 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-14 04:39:18,120 INFO L413 NwaCegarLoop]: 3549 mSDtfsCounter, 6846 mSDsluCounter, 1842 mSDsCounter, 0 mSdLazyCounter, 4319 mSolverCounterSat, 3728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s 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.0s IncrementalHoareTripleChecker+Time [2022-07-14 04:39:18,120 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.0s Time] [2022-07-14 04:39:18,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3370 states. [2022-07-14 04:39:18,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3370 to 3370. [2022-07-14 04:39:18,274 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-14 04:39:18,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3370 states to 3370 states and 4619 transitions. [2022-07-14 04:39:18,282 INFO L78 Accepts]: Start accepts. Automaton has 3370 states and 4619 transitions. Word has length 169 [2022-07-14 04:39:18,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:39:18,282 INFO L495 AbstractCegarLoop]: Abstraction has 3370 states and 4619 transitions. [2022-07-14 04:39:18,282 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-14 04:39:18,283 INFO L276 IsEmpty]: Start isEmpty. Operand 3370 states and 4619 transitions. [2022-07-14 04:39:18,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-07-14 04:39:18,285 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:39:18,285 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-14 04:39:18,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-14 04:39:18,286 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-14 04:39:18,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:39:18,286 INFO L85 PathProgramCache]: Analyzing trace with hash -2122786566, now seen corresponding path program 1 times [2022-07-14 04:39:18,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:39:18,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856785002] [2022-07-14 04:39:18,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:18,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:39:18,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:39:18,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:39:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 04:39:18,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:39:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-14 04:39:18,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:39:18,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:18,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:39:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:39:18,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:39:18,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:39:18,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 04:39:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 04:39:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 04:39:18,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 04:39:18,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 04:39:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-14 04:39:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 04:39:18,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-14 04:39:18,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-14 04:39:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-14 04:39:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-14 04:39:18,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-14 04:39:18,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-14 04:39:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-14 04:39:18,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:18,597 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-14 04:39:18,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:39:18,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856785002] [2022-07-14 04:39:18,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856785002] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:39:18,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:39:18,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:39:18,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009887314] [2022-07-14 04:39:18,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:39:18,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:39:18,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:39:18,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:39:18,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:39:18,599 INFO L87 Difference]: Start difference. First operand 3370 states and 4619 transitions. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-14 04:39:26,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:39:26,100 INFO L93 Difference]: Finished difference Result 3370 states and 4619 transitions. [2022-07-14 04:39:26,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:39:26,101 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 175 [2022-07-14 04:39:26,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:39:26,109 INFO L225 Difference]: With dead ends: 3370 [2022-07-14 04:39:26,109 INFO L226 Difference]: Without dead ends: 3368 [2022-07-14 04:39:26,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:39:26,110 INFO L413 NwaCegarLoop]: 3547 mSDtfsCounter, 6840 mSDsluCounter, 1842 mSDsCounter, 0 mSdLazyCounter, 4317 mSolverCounterSat, 3728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7019 SdHoareTripleChecker+Valid, 5389 SdHoareTripleChecker+Invalid, 8045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3728 IncrementalHoareTripleChecker+Valid, 4317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:39:26,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7019 Valid, 5389 Invalid, 8045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3728 Valid, 4317 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2022-07-14 04:39:26,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3368 states. [2022-07-14 04:39:26,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3368 to 3368. [2022-07-14 04:39:26,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3368 states, 2275 states have (on average 1.2742857142857142) internal successors, (2899), 2350 states have internal predecessors, (2899), 856 states have call successors, (856), 225 states have call predecessors, (856), 225 states have return successors, (862), 844 states have call predecessors, (862), 854 states have call successors, (862) [2022-07-14 04:39:26,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3368 states to 3368 states and 4617 transitions. [2022-07-14 04:39:26,316 INFO L78 Accepts]: Start accepts. Automaton has 3368 states and 4617 transitions. Word has length 175 [2022-07-14 04:39:26,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:39:26,317 INFO L495 AbstractCegarLoop]: Abstraction has 3368 states and 4617 transitions. [2022-07-14 04:39:26,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-14 04:39:26,317 INFO L276 IsEmpty]: Start isEmpty. Operand 3368 states and 4617 transitions. [2022-07-14 04:39:26,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2022-07-14 04:39:26,319 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:39:26,320 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:39:26,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-14 04:39:26,320 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-14 04:39:26,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:39:26,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1667494656, now seen corresponding path program 1 times [2022-07-14 04:39:26,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:39:26,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219519418] [2022-07-14 04:39:26,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:26,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:39:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:26,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:39:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:39:26,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 04:39:26,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 04:39:26,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:26,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:39:26,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:39:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-14 04:39:26,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:39:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:39:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:39:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:39:26,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:39:26,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-14 04:39:26,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:39:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:39:26,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-14 04:39:26,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:26,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:39:26,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:39:26,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-14 04:39:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-14 04:39:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-14 04:39:26,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-14 04:39:26,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-14 04:39:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-14 04:39:26,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:26,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-14 04:39:26,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-14 04:39:26,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-14 04:39:26,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-07-14 04:39:26,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-07-14 04:39:26,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:26,769 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2022-07-14 04:39:26,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:39:26,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219519418] [2022-07-14 04:39:26,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219519418] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:39:26,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:39:26,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 04:39:26,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722651584] [2022-07-14 04:39:26,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:39:26,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 04:39:26,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:39:26,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 04:39:26,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-14 04:39:26,772 INFO L87 Difference]: Start difference. First operand 3368 states and 4617 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (28), 7 states have call predecessors, (28), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-14 04:39:36,214 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-14 04:39:38,253 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []