./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.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 --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 5574142529d95f295134c1dccd4c5dbe0383ae5c309e7dc50fd933e5702659ed --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 14:36:03,242 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 14:36:03,301 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-24 14:36:03,305 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 14:36:03,305 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 14:36:03,331 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 14:36:03,332 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 14:36:03,332 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 14:36:03,333 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 14:36:03,334 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 14:36:03,334 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 14:36:03,335 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 14:36:03,335 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 14:36:03,335 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 14:36:03,338 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 14:36:03,338 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 14:36:03,338 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 14:36:03,338 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 14:36:03,338 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 14:36:03,339 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 14:36:03,339 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 14:36:03,339 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 14:36:03,339 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 14:36:03,340 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 14:36:03,340 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 14:36:03,340 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 14:36:03,340 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 14:36:03,340 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 14:36:03,340 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 14:36:03,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 14:36:03,341 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 14:36:03,341 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 14:36:03,341 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 14:36:03,341 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 14:36:03,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 14:36:03,341 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 14:36:03,341 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 14:36:03,341 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 14:36:03,342 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 14:36:03,342 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 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 -> 5574142529d95f295134c1dccd4c5dbe0383ae5c309e7dc50fd933e5702659ed [2024-10-24 14:36:03,536 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 14:36:03,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 14:36:03,562 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 14:36:03,563 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 14:36:03,564 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 14:36:03,565 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i [2024-10-24 14:36:04,949 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 14:36:05,346 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 14:36:05,348 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i [2024-10-24 14:36:05,382 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8feb251f/dc719c6891fc4c4d8bc0d182d59a2522/FLAG0ea61f40d [2024-10-24 14:36:05,394 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8feb251f/dc719c6891fc4c4d8bc0d182d59a2522 [2024-10-24 14:36:05,397 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 14:36:05,400 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 14:36:05,402 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 14:36:05,403 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 14:36:05,407 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 14:36:05,408 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:36:05" (1/1) ... [2024-10-24 14:36:05,408 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bcb3b03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:36:05, skipping insertion in model container [2024-10-24 14:36:05,409 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:36:05" (1/1) ... [2024-10-24 14:36:05,581 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 14:36:07,448 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273031,273044] [2024-10-24 14:36:07,452 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273176,273189] [2024-10-24 14:36:07,452 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273322,273335] [2024-10-24 14:36:07,453 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273487,273500] [2024-10-24 14:36:07,453 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273645,273658] [2024-10-24 14:36:07,454 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273803,273816] [2024-10-24 14:36:07,454 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273961,273974] [2024-10-24 14:36:07,454 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274121,274134] [2024-10-24 14:36:07,455 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274280,274293] [2024-10-24 14:36:07,455 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274419,274432] [2024-10-24 14:36:07,456 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274561,274574] [2024-10-24 14:36:07,498 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274710,274723] [2024-10-24 14:36:07,499 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274849,274862] [2024-10-24 14:36:07,500 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275004,275017] [2024-10-24 14:36:07,504 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275164,275177] [2024-10-24 14:36:07,505 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275315,275328] [2024-10-24 14:36:07,505 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275466,275479] [2024-10-24 14:36:07,505 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275618,275631] [2024-10-24 14:36:07,506 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275767,275780] [2024-10-24 14:36:07,506 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275915,275928] [2024-10-24 14:36:07,506 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276072,276085] [2024-10-24 14:36:07,506 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276221,276234] [2024-10-24 14:36:07,507 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276377,276390] [2024-10-24 14:36:07,507 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276530,276543] [2024-10-24 14:36:07,507 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276676,276689] [2024-10-24 14:36:07,507 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276819,276832] [2024-10-24 14:36:07,508 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276971,276984] [2024-10-24 14:36:07,508 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277117,277130] [2024-10-24 14:36:07,508 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277262,277275] [2024-10-24 14:36:07,509 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277416,277429] [2024-10-24 14:36:07,509 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277567,277580] [2024-10-24 14:36:07,509 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277722,277735] [2024-10-24 14:36:07,510 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277874,277887] [2024-10-24 14:36:07,510 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278029,278042] [2024-10-24 14:36:07,510 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278193,278206] [2024-10-24 14:36:07,511 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278349,278362] [2024-10-24 14:36:07,511 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278513,278526] [2024-10-24 14:36:07,511 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278655,278668] [2024-10-24 14:36:07,511 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278813,278826] [2024-10-24 14:36:07,512 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278980,278993] [2024-10-24 14:36:07,512 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279139,279152] [2024-10-24 14:36:07,512 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279298,279311] [2024-10-24 14:36:07,513 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279447,279460] [2024-10-24 14:36:07,513 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279594,279607] [2024-10-24 14:36:07,513 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279733,279746] [2024-10-24 14:36:07,514 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279896,279909] [2024-10-24 14:36:07,514 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280062,280075] [2024-10-24 14:36:07,514 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280226,280239] [2024-10-24 14:36:07,515 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280391,280404] [2024-10-24 14:36:07,515 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280556,280569] [2024-10-24 14:36:07,515 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280722,280735] [2024-10-24 14:36:07,515 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280887,280900] [2024-10-24 14:36:07,516 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281054,281067] [2024-10-24 14:36:07,516 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281214,281227] [2024-10-24 14:36:07,516 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281376,281389] [2024-10-24 14:36:07,517 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281535,281548] [2024-10-24 14:36:07,517 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281681,281694] [2024-10-24 14:36:07,517 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281824,281837] [2024-10-24 14:36:07,517 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281968,281981] [2024-10-24 14:36:07,518 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282111,282124] [2024-10-24 14:36:07,518 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282255,282268] [2024-10-24 14:36:07,518 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282396,282409] [2024-10-24 14:36:07,519 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282534,282547] [2024-10-24 14:36:07,519 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282692,282705] [2024-10-24 14:36:07,519 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282851,282864] [2024-10-24 14:36:07,520 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283007,283020] [2024-10-24 14:36:07,520 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283156,283169] [2024-10-24 14:36:07,520 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283308,283321] [2024-10-24 14:36:07,520 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283459,283472] [2024-10-24 14:36:07,521 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283608,283621] [2024-10-24 14:36:07,521 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283760,283773] [2024-10-24 14:36:07,521 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283908,283921] [2024-10-24 14:36:07,522 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284061,284074] [2024-10-24 14:36:07,522 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284212,284225] [2024-10-24 14:36:07,522 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284362,284375] [2024-10-24 14:36:07,522 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284509,284522] [2024-10-24 14:36:07,523 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284660,284673] [2024-10-24 14:36:07,523 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284811,284824] [2024-10-24 14:36:07,523 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284959,284972] [2024-10-24 14:36:07,524 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285125,285138] [2024-10-24 14:36:07,524 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285294,285307] [2024-10-24 14:36:07,524 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285461,285474] [2024-10-24 14:36:07,524 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285629,285642] [2024-10-24 14:36:07,525 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285779,285792] [2024-10-24 14:36:07,525 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285926,285939] [2024-10-24 14:36:07,525 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286087,286100] [2024-10-24 14:36:07,525 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286257,286270] [2024-10-24 14:36:07,526 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286419,286432] [2024-10-24 14:36:07,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 14:36:07,550 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 14:36:07,629 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("mfence": : : "memory"); [4644] [2024-10-24 14:36:07,635 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("mfence": : : "memory"); [4799] [2024-10-24 14:36:07,648 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("sfence": : : "memory"); [5192] [2024-10-24 14:36:07,706 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273031,273044] [2024-10-24 14:36:07,707 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273176,273189] [2024-10-24 14:36:07,708 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273322,273335] [2024-10-24 14:36:07,708 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273487,273500] [2024-10-24 14:36:07,708 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273645,273658] [2024-10-24 14:36:07,708 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273803,273816] [2024-10-24 14:36:07,709 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273961,273974] [2024-10-24 14:36:07,709 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274121,274134] [2024-10-24 14:36:07,709 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274280,274293] [2024-10-24 14:36:07,710 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274419,274432] [2024-10-24 14:36:07,710 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274561,274574] [2024-10-24 14:36:07,710 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274710,274723] [2024-10-24 14:36:07,711 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274849,274862] [2024-10-24 14:36:07,711 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275004,275017] [2024-10-24 14:36:07,711 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275164,275177] [2024-10-24 14:36:07,713 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275315,275328] [2024-10-24 14:36:07,713 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275466,275479] [2024-10-24 14:36:07,713 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275618,275631] [2024-10-24 14:36:07,713 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275767,275780] [2024-10-24 14:36:07,714 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275915,275928] [2024-10-24 14:36:07,714 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276072,276085] [2024-10-24 14:36:07,714 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276221,276234] [2024-10-24 14:36:07,714 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276377,276390] [2024-10-24 14:36:07,714 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276530,276543] [2024-10-24 14:36:07,715 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276676,276689] [2024-10-24 14:36:07,715 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276819,276832] [2024-10-24 14:36:07,715 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276971,276984] [2024-10-24 14:36:07,716 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277117,277130] [2024-10-24 14:36:07,717 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277262,277275] [2024-10-24 14:36:07,717 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277416,277429] [2024-10-24 14:36:07,717 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277567,277580] [2024-10-24 14:36:07,717 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277722,277735] [2024-10-24 14:36:07,718 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277874,277887] [2024-10-24 14:36:07,718 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278029,278042] [2024-10-24 14:36:07,718 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278193,278206] [2024-10-24 14:36:07,719 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278349,278362] [2024-10-24 14:36:07,719 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278513,278526] [2024-10-24 14:36:07,719 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278655,278668] [2024-10-24 14:36:07,720 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278813,278826] [2024-10-24 14:36:07,720 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278980,278993] [2024-10-24 14:36:07,721 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279139,279152] [2024-10-24 14:36:07,721 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279298,279311] [2024-10-24 14:36:07,721 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279447,279460] [2024-10-24 14:36:07,722 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279594,279607] [2024-10-24 14:36:07,722 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279733,279746] [2024-10-24 14:36:07,722 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279896,279909] [2024-10-24 14:36:07,722 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280062,280075] [2024-10-24 14:36:07,723 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280226,280239] [2024-10-24 14:36:07,723 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280391,280404] [2024-10-24 14:36:07,723 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280556,280569] [2024-10-24 14:36:07,723 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280722,280735] [2024-10-24 14:36:07,724 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280887,280900] [2024-10-24 14:36:07,724 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281054,281067] [2024-10-24 14:36:07,724 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281214,281227] [2024-10-24 14:36:07,724 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281376,281389] [2024-10-24 14:36:07,725 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281535,281548] [2024-10-24 14:36:07,725 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281681,281694] [2024-10-24 14:36:07,725 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281824,281837] [2024-10-24 14:36:07,726 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281968,281981] [2024-10-24 14:36:07,726 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282111,282124] [2024-10-24 14:36:07,726 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282255,282268] [2024-10-24 14:36:07,726 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282396,282409] [2024-10-24 14:36:07,727 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282534,282547] [2024-10-24 14:36:07,727 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282692,282705] [2024-10-24 14:36:07,728 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282851,282864] [2024-10-24 14:36:07,728 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283007,283020] [2024-10-24 14:36:07,728 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283156,283169] [2024-10-24 14:36:07,728 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283308,283321] [2024-10-24 14:36:07,729 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283459,283472] [2024-10-24 14:36:07,729 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283608,283621] [2024-10-24 14:36:07,729 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283760,283773] [2024-10-24 14:36:07,729 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283908,283921] [2024-10-24 14:36:07,730 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284061,284074] [2024-10-24 14:36:07,730 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284212,284225] [2024-10-24 14:36:07,731 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284362,284375] [2024-10-24 14:36:07,731 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284509,284522] [2024-10-24 14:36:07,731 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284660,284673] [2024-10-24 14:36:07,731 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284811,284824] [2024-10-24 14:36:07,731 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284959,284972] [2024-10-24 14:36:07,732 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285125,285138] [2024-10-24 14:36:07,732 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285294,285307] [2024-10-24 14:36:07,732 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285461,285474] [2024-10-24 14:36:07,732 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285629,285642] [2024-10-24 14:36:07,732 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285779,285792] [2024-10-24 14:36:07,732 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285926,285939] [2024-10-24 14:36:07,733 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286087,286100] [2024-10-24 14:36:07,733 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286257,286270] [2024-10-24 14:36:07,733 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286419,286432] [2024-10-24 14:36:07,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 14:36:07,964 INFO L204 MainTranslator]: Completed translation [2024-10-24 14:36:07,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:36:07 WrapperNode [2024-10-24 14:36:07,964 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 14:36:07,969 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 14:36:07,969 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 14:36:07,969 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 14:36:07,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:36:07" (1/1) ... [2024-10-24 14:36:08,033 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:36:07" (1/1) ... [2024-10-24 14:36:08,096 INFO L138 Inliner]: procedures = 526, calls = 1357, calls flagged for inlining = 224, calls inlined = 135, statements flattened = 2569 [2024-10-24 14:36:08,097 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 14:36:08,097 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 14:36:08,097 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 14:36:08,098 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 14:36:08,106 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:36:07" (1/1) ... [2024-10-24 14:36:08,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:36:07" (1/1) ... [2024-10-24 14:36:08,124 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:36:07" (1/1) ... [2024-10-24 14:36:08,585 INFO L175 MemorySlicer]: Split 338 memory accesses to 11 slices as follows [262, 7, 1, 2, 28, 3, 21, 4, 5, 2, 3]. 78 percent of accesses are in the largest equivalence class. The 107 initializations are split as follows [72, 7, 1, 2, 0, 0, 21, 4, 0, 0, 0]. The 100 writes are split as follows [71, 0, 0, 0, 24, 0, 0, 0, 5, 0, 0]. [2024-10-24 14:36:08,585 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:36:07" (1/1) ... [2024-10-24 14:36:08,585 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:36:07" (1/1) ... [2024-10-24 14:36:08,657 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:36:07" (1/1) ... [2024-10-24 14:36:08,669 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:36:07" (1/1) ... [2024-10-24 14:36:08,690 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:36:07" (1/1) ... [2024-10-24 14:36:08,708 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:36:07" (1/1) ... [2024-10-24 14:36:08,735 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 14:36:08,736 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 14:36:08,736 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 14:36:08,737 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 14:36:08,737 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:36:07" (1/1) ... [2024-10-24 14:36:08,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 14:36:08,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 14:36:08,774 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 14:36:08,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 14:36:08,821 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2024-10-24 14:36:08,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2024-10-24 14:36:08,821 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-24 14:36:08,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-24 14:36:08,822 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2024-10-24 14:36:08,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2024-10-24 14:36:08,822 INFO L130 BoogieDeclarations]: Found specification of procedure __might_sleep [2024-10-24 14:36:08,822 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_sleep [2024-10-24 14:36:08,822 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2024-10-24 14:36:08,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2024-10-24 14:36:08,822 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2024-10-24 14:36:08,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2024-10-24 14:36:08,823 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2024-10-24 14:36:08,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2024-10-24 14:36:08,823 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_read_buffer_lock_of_lego_usb_tower [2024-10-24 14:36:08,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_read_buffer_lock_of_lego_usb_tower [2024-10-24 14:36:08,824 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2024-10-24 14:36:08,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2024-10-24 14:36:08,824 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2024-10-24 14:36:08,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2024-10-24 14:36:08,824 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2024-10-24 14:36:08,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2024-10-24 14:36:08,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 14:36:08,825 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2024-10-24 14:36:08,825 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2024-10-24 14:36:08,825 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2024-10-24 14:36:08,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2024-10-24 14:36:08,825 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2024-10-24 14:36:08,825 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2024-10-24 14:36:08,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-10-24 14:36:08,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-10-24 14:36:08,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-10-24 14:36:08,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-10-24 14:36:08,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-10-24 14:36:08,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2024-10-24 14:36:08,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2024-10-24 14:36:08,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2024-10-24 14:36:08,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2024-10-24 14:36:08,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2024-10-24 14:36:08,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2024-10-24 14:36:08,826 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2024-10-24 14:36:08,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2024-10-24 14:36:08,827 INFO L130 BoogieDeclarations]: Found specification of procedure _dev_info [2024-10-24 14:36:08,827 INFO L138 BoogieDeclarations]: Found implementation of procedure _dev_info [2024-10-24 14:36:08,827 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2024-10-24 14:36:08,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2024-10-24 14:36:08,827 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irq_112 [2024-10-24 14:36:08,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irq_112 [2024-10-24 14:36:08,827 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2024-10-24 14:36:08,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2024-10-24 14:36:08,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 14:36:08,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 14:36:08,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 14:36:08,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-24 14:36:08,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-24 14:36:08,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-24 14:36:08,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-24 14:36:08,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-24 14:36:08,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-24 14:36:08,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-24 14:36:08,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-24 14:36:08,829 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2024-10-24 14:36:08,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2024-10-24 14:36:08,829 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2024-10-24 14:36:08,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2024-10-24 14:36:08,829 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2024-10-24 14:36:08,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2024-10-24 14:36:08,829 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2024-10-24 14:36:08,829 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2024-10-24 14:36:08,829 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2024-10-24 14:36:08,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2024-10-24 14:36:08,829 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait_event [2024-10-24 14:36:08,829 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait_event [2024-10-24 14:36:08,829 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2024-10-24 14:36:08,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2024-10-24 14:36:08,830 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_dev_dbg [2024-10-24 14:36:08,830 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_dev_dbg [2024-10-24 14:36:08,830 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_open_disc_mutex [2024-10-24 14:36:08,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_open_disc_mutex [2024-10-24 14:36:08,830 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_lock_of_lego_usb_tower [2024-10-24 14:36:08,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_lock_of_lego_usb_tower [2024-10-24 14:36:08,830 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2024-10-24 14:36:08,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2024-10-24 14:36:08,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 14:36:08,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 14:36:08,830 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2024-10-24 14:36:08,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2024-10-24 14:36:08,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 14:36:08,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 14:36:08,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-24 14:36:08,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-24 14:36:08,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-24 14:36:08,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-24 14:36:08,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-24 14:36:08,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-10-24 14:36:08,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-10-24 14:36:08,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-10-24 14:36:08,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-10-24 14:36:08,832 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2024-10-24 14:36:08,832 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2024-10-24 14:36:08,832 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2024-10-24 14:36:08,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2024-10-24 14:36:08,833 INFO L130 BoogieDeclarations]: Found specification of procedure usb_control_msg [2024-10-24 14:36:08,833 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_control_msg [2024-10-24 14:36:08,833 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2024-10-24 14:36:08,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2024-10-24 14:36:08,833 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2024-10-24 14:36:08,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2024-10-24 14:36:08,833 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2024-10-24 14:36:08,833 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2024-10-24 14:36:08,833 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_open_disc_mutex [2024-10-24 14:36:08,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_open_disc_mutex [2024-10-24 14:36:08,834 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_timeout [2024-10-24 14:36:08,834 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_timeout [2024-10-24 14:36:08,834 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2024-10-24 14:36:08,834 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2024-10-24 14:36:08,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 14:36:08,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 14:36:08,835 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2024-10-24 14:36:08,835 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2024-10-24 14:36:08,835 INFO L130 BoogieDeclarations]: Found specification of procedure tower_disconnect [2024-10-24 14:36:08,835 INFO L138 BoogieDeclarations]: Found implementation of procedure tower_disconnect [2024-10-24 14:36:08,835 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2024-10-24 14:36:08,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2024-10-24 14:36:08,835 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2024-10-24 14:36:08,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2024-10-24 14:36:08,835 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_maxp [2024-10-24 14:36:08,835 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_maxp [2024-10-24 14:36:08,835 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2024-10-24 14:36:08,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2024-10-24 14:36:08,836 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_free_urb [2024-10-24 14:36:08,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_free_urb [2024-10-24 14:36:08,836 INFO L130 BoogieDeclarations]: Found specification of procedure poll_wait [2024-10-24 14:36:08,836 INFO L138 BoogieDeclarations]: Found implementation of procedure poll_wait [2024-10-24 14:36:08,836 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2024-10-24 14:36:08,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2024-10-24 14:36:08,836 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_lock_of_lego_usb_tower [2024-10-24 14:36:08,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_lock_of_lego_usb_tower [2024-10-24 14:36:08,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 14:36:08,836 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2024-10-24 14:36:08,837 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2024-10-24 14:36:08,837 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2024-10-24 14:36:08,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2024-10-24 14:36:08,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 14:36:08,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 14:36:08,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-24 14:36:08,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-24 14:36:08,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-24 14:36:08,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-24 14:36:08,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-24 14:36:08,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-10-24 14:36:08,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-10-24 14:36:08,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-10-24 14:36:08,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-10-24 14:36:08,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-24 14:36:08,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-24 14:36:08,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-24 14:36:08,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-24 14:36:08,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-24 14:36:08,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-24 14:36:08,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-24 14:36:08,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-10-24 14:36:08,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-10-24 14:36:08,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-10-24 14:36:08,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2024-10-24 14:36:08,839 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2024-10-24 14:36:08,839 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2024-10-24 14:36:08,839 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2024-10-24 14:36:08,839 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2024-10-24 14:36:08,839 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2024-10-24 14:36:08,839 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2024-10-24 14:36:08,839 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2024-10-24 14:36:08,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2024-10-24 14:36:08,862 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2024-10-24 14:36:08,862 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2024-10-24 14:36:08,862 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2024-10-24 14:36:08,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2024-10-24 14:36:08,862 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_lock_of_lego_usb_tower [2024-10-24 14:36:08,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_lock_of_lego_usb_tower [2024-10-24 14:36:08,862 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2024-10-24 14:36:08,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2024-10-24 14:36:08,862 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_alloc_urb [2024-10-24 14:36:08,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_alloc_urb [2024-10-24 14:36:08,863 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2024-10-24 14:36:08,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2024-10-24 14:36:08,863 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2024-10-24 14:36:08,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2024-10-24 14:36:08,863 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2024-10-24 14:36:08,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2024-10-24 14:36:08,863 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2024-10-24 14:36:08,863 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2024-10-24 14:36:08,863 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2024-10-24 14:36:08,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2024-10-24 14:36:08,863 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_int_urb [2024-10-24 14:36:08,863 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_int_urb [2024-10-24 14:36:08,863 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_read_buffer_lock_of_lego_usb_tower [2024-10-24 14:36:08,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_read_buffer_lock_of_lego_usb_tower [2024-10-24 14:36:08,863 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2024-10-24 14:36:08,863 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2024-10-24 14:36:08,863 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2024-10-24 14:36:08,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2024-10-24 14:36:08,863 INFO L130 BoogieDeclarations]: Found specification of procedure tower_delete [2024-10-24 14:36:08,863 INFO L138 BoogieDeclarations]: Found implementation of procedure tower_delete [2024-10-24 14:36:08,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 14:36:08,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 14:36:08,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 14:36:08,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-24 14:36:08,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-24 14:36:08,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-24 14:36:08,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-24 14:36:08,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-24 14:36:08,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-24 14:36:08,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-24 14:36:08,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-24 14:36:08,864 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2024-10-24 14:36:08,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2024-10-24 14:36:08,864 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2024-10-24 14:36:08,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2024-10-24 14:36:08,864 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2024-10-24 14:36:08,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2024-10-24 14:36:08,864 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2024-10-24 14:36:08,864 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2024-10-24 14:36:08,864 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2024-10-24 14:36:08,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2024-10-24 14:36:08,864 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2024-10-24 14:36:08,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2024-10-24 14:36:08,864 INFO L130 BoogieDeclarations]: Found specification of procedure tower_check_for_read_packet [2024-10-24 14:36:08,865 INFO L138 BoogieDeclarations]: Found implementation of procedure tower_check_for_read_packet [2024-10-24 14:36:08,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 14:36:08,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 14:36:08,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 14:36:08,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 14:36:08,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-24 14:36:08,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-24 14:36:08,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-24 14:36:08,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-24 14:36:08,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-24 14:36:08,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-24 14:36:08,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-24 14:36:08,866 INFO L130 BoogieDeclarations]: Found specification of procedure tower_abort_transfers [2024-10-24 14:36:08,866 INFO L138 BoogieDeclarations]: Found implementation of procedure tower_abort_transfers [2024-10-24 14:36:08,866 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_irq_111 [2024-10-24 14:36:08,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_irq_111 [2024-10-24 14:36:09,221 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 14:36:09,224 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 14:36:09,316 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2024-10-24 14:36:10,743 INFO L? ?]: Removed 1165 outVars from TransFormulas that were not future-live. [2024-10-24 14:36:10,743 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 14:36:10,939 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 14:36:10,940 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 14:36:10,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:36:10 BoogieIcfgContainer [2024-10-24 14:36:10,940 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 14:36:10,945 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 14:36:10,945 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 14:36:10,948 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 14:36:10,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:36:05" (1/3) ... [2024-10-24 14:36:10,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@446fa1f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:36:10, skipping insertion in model container [2024-10-24 14:36:10,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:36:07" (2/3) ... [2024-10-24 14:36:10,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@446fa1f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:36:10, skipping insertion in model container [2024-10-24 14:36:10,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:36:10" (3/3) ... [2024-10-24 14:36:10,950 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i [2024-10-24 14:36:10,963 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 14:36:10,963 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2024-10-24 14:36:11,021 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 14:36:11,025 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5e2f73f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 14:36:11,025 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2024-10-24 14:36:11,032 INFO L276 IsEmpty]: Start isEmpty. Operand has 927 states, 553 states have (on average 1.3544303797468353) internal successors, (749), 598 states have internal predecessors, (749), 264 states have call successors, (264), 80 states have call predecessors, (264), 79 states have return successors, (259), 256 states have call predecessors, (259), 259 states have call successors, (259) [2024-10-24 14:36:11,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-24 14:36:11,038 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:36:11,039 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-24 14:36:11,039 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-10-24 14:36:11,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:36:11,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1698285832, now seen corresponding path program 1 times [2024-10-24 14:36:11,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:36:11,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408382081] [2024-10-24 14:36:11,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:36:11,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:36:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:11,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:11,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:11,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:36:11,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:11,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 14:36:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:11,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:36:11,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:11,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 14:36:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:11,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 14:36:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:11,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 14:36:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:11,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:11,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 14:36:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:11,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 14:36:11,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:11,846 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 14:36:11,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:36:11,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408382081] [2024-10-24 14:36:11,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408382081] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:36:11,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:36:11,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:36:11,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527643557] [2024-10-24 14:36:11,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:36:11,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:36:11,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:36:11,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:36:11,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:36:11,879 INFO L87 Difference]: Start difference. First operand has 927 states, 553 states have (on average 1.3544303797468353) internal successors, (749), 598 states have internal predecessors, (749), 264 states have call successors, (264), 80 states have call predecessors, (264), 79 states have return successors, (259), 256 states have call predecessors, (259), 259 states have call successors, (259) Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 4 states have internal predecessors, (24), 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) [2024-10-24 14:36:14,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:36:14,930 INFO L93 Difference]: Finished difference Result 1815 states and 2584 transitions. [2024-10-24 14:36:14,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:36:14,932 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 4 states have internal predecessors, (24), 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 53 [2024-10-24 14:36:14,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:36:14,958 INFO L225 Difference]: With dead ends: 1815 [2024-10-24 14:36:14,962 INFO L226 Difference]: Without dead ends: 912 [2024-10-24 14:36:14,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-24 14:36:14,973 INFO L432 NwaCegarLoop]: 794 mSDtfsCounter, 1492 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 1612 mSolverCounterSat, 722 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1693 SdHoareTripleChecker+Valid, 2111 SdHoareTripleChecker+Invalid, 2334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 722 IncrementalHoareTripleChecker+Valid, 1612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-24 14:36:14,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1693 Valid, 2111 Invalid, 2334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [722 Valid, 1612 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-24 14:36:14,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2024-10-24 14:36:15,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 912. [2024-10-24 14:36:15,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 546 states have (on average 1.2820512820512822) internal successors, (700), 586 states have internal predecessors, (700), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 254 states have call predecessors, (257), 257 states have call successors, (257) [2024-10-24 14:36:15,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1216 transitions. [2024-10-24 14:36:15,072 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1216 transitions. Word has length 53 [2024-10-24 14:36:15,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:36:15,074 INFO L471 AbstractCegarLoop]: Abstraction has 912 states and 1216 transitions. [2024-10-24 14:36:15,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 4 states have internal predecessors, (24), 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) [2024-10-24 14:36:15,074 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1216 transitions. [2024-10-24 14:36:15,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-24 14:36:15,076 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:36:15,076 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-24 14:36:15,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 14:36:15,077 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-10-24 14:36:15,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:36:15,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1954458344, now seen corresponding path program 1 times [2024-10-24 14:36:15,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:36:15,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243267633] [2024-10-24 14:36:15,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:36:15,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:36:15,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:15,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:15,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:15,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:36:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:15,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 14:36:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:15,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:36:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:15,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 14:36:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:15,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 14:36:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:15,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 14:36:15,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:15,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:15,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 14:36:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:15,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 14:36:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:15,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 14:36:15,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:15,466 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 14:36:15,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:36:15,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243267633] [2024-10-24 14:36:15,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243267633] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:36:15,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:36:15,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:36:15,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558762613] [2024-10-24 14:36:15,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:36:15,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:36:15,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:36:15,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:36:15,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:36:15,469 INFO L87 Difference]: Start difference. First operand 912 states and 1216 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 4 states have internal predecessors, (27), 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) [2024-10-24 14:36:18,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:36:18,236 INFO L93 Difference]: Finished difference Result 912 states and 1216 transitions. [2024-10-24 14:36:18,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:36:18,237 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 4 states have internal predecessors, (27), 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 58 [2024-10-24 14:36:18,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:36:18,245 INFO L225 Difference]: With dead ends: 912 [2024-10-24 14:36:18,245 INFO L226 Difference]: Without dead ends: 910 [2024-10-24 14:36:18,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-24 14:36:18,246 INFO L432 NwaCegarLoop]: 782 mSDtfsCounter, 1461 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 1592 mSolverCounterSat, 712 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1659 SdHoareTripleChecker+Valid, 2079 SdHoareTripleChecker+Invalid, 2304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 712 IncrementalHoareTripleChecker+Valid, 1592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-24 14:36:18,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1659 Valid, 2079 Invalid, 2304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [712 Valid, 1592 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-24 14:36:18,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2024-10-24 14:36:18,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 910. [2024-10-24 14:36:18,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 545 states have (on average 1.2807339449541284) internal successors, (698), 584 states have internal predecessors, (698), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 254 states have call predecessors, (257), 257 states have call successors, (257) [2024-10-24 14:36:18,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1214 transitions. [2024-10-24 14:36:18,314 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1214 transitions. Word has length 58 [2024-10-24 14:36:18,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:36:18,315 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1214 transitions. [2024-10-24 14:36:18,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 4 states have internal predecessors, (27), 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) [2024-10-24 14:36:18,315 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1214 transitions. [2024-10-24 14:36:18,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-24 14:36:18,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:36:18,318 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-24 14:36:18,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 14:36:18,319 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-10-24 14:36:18,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:36:18,319 INFO L85 PathProgramCache]: Analyzing trace with hash 580203604, now seen corresponding path program 1 times [2024-10-24 14:36:18,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:36:18,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046758925] [2024-10-24 14:36:18,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:36:18,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:36:18,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:18,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:18,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:18,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:36:18,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:18,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 14:36:18,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:18,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:36:18,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:18,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 14:36:18,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:18,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 14:36:18,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:18,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 14:36:18,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:18,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:18,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:18,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 14:36:18,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:18,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 14:36:18,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:18,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 14:36:18,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:18,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 14:36:18,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:18,816 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 14:36:18,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:36:18,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046758925] [2024-10-24 14:36:18,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046758925] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:36:18,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:36:18,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:36:18,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173154936] [2024-10-24 14:36:18,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:36:18,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:36:18,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:36:18,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:36:18,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:36:18,821 INFO L87 Difference]: Start difference. First operand 910 states and 1214 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 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) [2024-10-24 14:36:21,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:36:21,667 INFO L93 Difference]: Finished difference Result 910 states and 1214 transitions. [2024-10-24 14:36:21,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:36:21,667 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 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 63 [2024-10-24 14:36:21,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:36:21,672 INFO L225 Difference]: With dead ends: 910 [2024-10-24 14:36:21,672 INFO L226 Difference]: Without dead ends: 908 [2024-10-24 14:36:21,673 INFO L431 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 [2024-10-24 14:36:21,674 INFO L432 NwaCegarLoop]: 782 mSDtfsCounter, 1455 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 1588 mSolverCounterSat, 712 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1652 SdHoareTripleChecker+Valid, 2079 SdHoareTripleChecker+Invalid, 2300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 712 IncrementalHoareTripleChecker+Valid, 1588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-24 14:36:21,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1652 Valid, 2079 Invalid, 2300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [712 Valid, 1588 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-24 14:36:21,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2024-10-24 14:36:21,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 908. [2024-10-24 14:36:21,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 544 states have (on average 1.2794117647058822) internal successors, (696), 582 states have internal predecessors, (696), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 254 states have call predecessors, (257), 257 states have call successors, (257) [2024-10-24 14:36:21,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1212 transitions. [2024-10-24 14:36:21,762 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1212 transitions. Word has length 63 [2024-10-24 14:36:21,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:36:21,762 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1212 transitions. [2024-10-24 14:36:21,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 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) [2024-10-24 14:36:21,763 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1212 transitions. [2024-10-24 14:36:21,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-24 14:36:21,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:36:21,768 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-24 14:36:21,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 14:36:21,768 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-10-24 14:36:21,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:36:21,769 INFO L85 PathProgramCache]: Analyzing trace with hash 728273076, now seen corresponding path program 1 times [2024-10-24 14:36:21,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:36:21,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346370619] [2024-10-24 14:36:21,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:36:21,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:36:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:22,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:22,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:22,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:36:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:22,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 14:36:22,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:22,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:36:22,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:22,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 14:36:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:22,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 14:36:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:22,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 14:36:22,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:22,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:22,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 14:36:22,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:22,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 14:36:22,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:22,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 14:36:22,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:22,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 14:36:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:22,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 14:36:22,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:22,156 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 14:36:22,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:36:22,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346370619] [2024-10-24 14:36:22,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346370619] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:36:22,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:36:22,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:36:22,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265071939] [2024-10-24 14:36:22,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:36:22,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:36:22,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:36:22,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:36:22,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:36:22,158 INFO L87 Difference]: Start difference. First operand 908 states and 1212 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 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) [2024-10-24 14:36:24,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:36:24,637 INFO L93 Difference]: Finished difference Result 908 states and 1212 transitions. [2024-10-24 14:36:24,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:36:24,638 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 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 68 [2024-10-24 14:36:24,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:36:24,643 INFO L225 Difference]: With dead ends: 908 [2024-10-24 14:36:24,643 INFO L226 Difference]: Without dead ends: 906 [2024-10-24 14:36:24,644 INFO L431 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 [2024-10-24 14:36:24,645 INFO L432 NwaCegarLoop]: 782 mSDtfsCounter, 1449 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 1584 mSolverCounterSat, 712 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1645 SdHoareTripleChecker+Valid, 2079 SdHoareTripleChecker+Invalid, 2296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 712 IncrementalHoareTripleChecker+Valid, 1584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-24 14:36:24,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1645 Valid, 2079 Invalid, 2296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [712 Valid, 1584 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-24 14:36:24,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2024-10-24 14:36:24,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 906. [2024-10-24 14:36:24,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 543 states have (on average 1.278084714548803) internal successors, (694), 580 states have internal predecessors, (694), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 254 states have call predecessors, (257), 257 states have call successors, (257) [2024-10-24 14:36:24,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1210 transitions. [2024-10-24 14:36:24,684 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1210 transitions. Word has length 68 [2024-10-24 14:36:24,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:36:24,684 INFO L471 AbstractCegarLoop]: Abstraction has 906 states and 1210 transitions. [2024-10-24 14:36:24,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 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) [2024-10-24 14:36:24,684 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1210 transitions. [2024-10-24 14:36:24,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-24 14:36:24,686 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:36:24,686 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-24 14:36:24,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 14:36:24,686 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-10-24 14:36:24,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:36:24,687 INFO L85 PathProgramCache]: Analyzing trace with hash -486271332, now seen corresponding path program 1 times [2024-10-24 14:36:24,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:36:24,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583296974] [2024-10-24 14:36:24,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:36:24,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:36:24,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:24,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:24,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:24,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:36:24,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:24,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 14:36:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:24,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:36:24,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:24,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 14:36:24,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:24,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 14:36:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:24,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 14:36:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:24,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:24,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:24,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 14:36:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:24,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 14:36:24,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:24,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 14:36:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:24,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 14:36:24,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:24,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 14:36:24,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:24,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 14:36:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:24,984 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 14:36:24,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:36:24,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583296974] [2024-10-24 14:36:24,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583296974] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:36:24,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:36:24,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:36:24,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608984784] [2024-10-24 14:36:24,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:36:24,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:36:24,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:36:24,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:36:24,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:36:24,986 INFO L87 Difference]: Start difference. First operand 906 states and 1210 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (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) [2024-10-24 14:36:27,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:36:27,734 INFO L93 Difference]: Finished difference Result 906 states and 1210 transitions. [2024-10-24 14:36:27,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:36:27,735 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (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 73 [2024-10-24 14:36:27,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:36:27,743 INFO L225 Difference]: With dead ends: 906 [2024-10-24 14:36:27,744 INFO L226 Difference]: Without dead ends: 904 [2024-10-24 14:36:27,744 INFO L431 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 [2024-10-24 14:36:27,745 INFO L432 NwaCegarLoop]: 782 mSDtfsCounter, 1443 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 1580 mSolverCounterSat, 712 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1638 SdHoareTripleChecker+Valid, 2079 SdHoareTripleChecker+Invalid, 2292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 712 IncrementalHoareTripleChecker+Valid, 1580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-24 14:36:27,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1638 Valid, 2079 Invalid, 2292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [712 Valid, 1580 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-24 14:36:27,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2024-10-24 14:36:27,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 904. [2024-10-24 14:36:27,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 542 states have (on average 1.2767527675276753) internal successors, (692), 578 states have internal predecessors, (692), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 254 states have call predecessors, (257), 257 states have call successors, (257) [2024-10-24 14:36:27,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1208 transitions. [2024-10-24 14:36:27,784 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1208 transitions. Word has length 73 [2024-10-24 14:36:27,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:36:27,785 INFO L471 AbstractCegarLoop]: Abstraction has 904 states and 1208 transitions. [2024-10-24 14:36:27,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (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) [2024-10-24 14:36:27,786 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1208 transitions. [2024-10-24 14:36:27,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 14:36:27,787 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:36:27,787 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-24 14:36:27,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 14:36:27,787 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-10-24 14:36:27,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:36:27,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1172020186, now seen corresponding path program 1 times [2024-10-24 14:36:27,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:36:27,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332978232] [2024-10-24 14:36:27,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:36:27,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:36:27,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:27,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:27,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:27,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:36:27,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:27,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 14:36:27,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:27,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:36:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:28,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 14:36:28,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:28,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 14:36:28,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:28,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 14:36:28,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:28,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:28,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:28,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 14:36:28,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:28,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 14:36:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:28,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 14:36:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:28,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 14:36:28,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:28,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 14:36:28,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:28,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 14:36:28,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:28,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 14:36:28,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:28,067 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 14:36:28,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:36:28,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332978232] [2024-10-24 14:36:28,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332978232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:36:28,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:36:28,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:36:28,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312263700] [2024-10-24 14:36:28,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:36:28,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:36:28,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:36:28,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:36:28,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:36:28,069 INFO L87 Difference]: Start difference. First operand 904 states and 1208 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 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) [2024-10-24 14:36:30,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:36:30,469 INFO L93 Difference]: Finished difference Result 904 states and 1208 transitions. [2024-10-24 14:36:30,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:36:30,469 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 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 78 [2024-10-24 14:36:30,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:36:30,473 INFO L225 Difference]: With dead ends: 904 [2024-10-24 14:36:30,473 INFO L226 Difference]: Without dead ends: 902 [2024-10-24 14:36:30,474 INFO L431 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 [2024-10-24 14:36:30,474 INFO L432 NwaCegarLoop]: 782 mSDtfsCounter, 1437 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 1576 mSolverCounterSat, 712 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1631 SdHoareTripleChecker+Valid, 2079 SdHoareTripleChecker+Invalid, 2288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 712 IncrementalHoareTripleChecker+Valid, 1576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-24 14:36:30,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1631 Valid, 2079 Invalid, 2288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [712 Valid, 1576 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-24 14:36:30,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2024-10-24 14:36:30,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 902. [2024-10-24 14:36:30,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 541 states have (on average 1.2754158964879851) internal successors, (690), 576 states have internal predecessors, (690), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 254 states have call predecessors, (257), 257 states have call successors, (257) [2024-10-24 14:36:30,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1206 transitions. [2024-10-24 14:36:30,512 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1206 transitions. Word has length 78 [2024-10-24 14:36:30,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:36:30,513 INFO L471 AbstractCegarLoop]: Abstraction has 902 states and 1206 transitions. [2024-10-24 14:36:30,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 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) [2024-10-24 14:36:30,513 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1206 transitions. [2024-10-24 14:36:30,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-24 14:36:30,514 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:36:30,514 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-24 14:36:30,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 14:36:30,514 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-10-24 14:36:30,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:36:30,515 INFO L85 PathProgramCache]: Analyzing trace with hash -958264363, now seen corresponding path program 1 times [2024-10-24 14:36:30,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:36:30,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480430710] [2024-10-24 14:36:30,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:36:30,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:36:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:30,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:30,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:30,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:36:30,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:30,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 14:36:30,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:30,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:36:30,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:30,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 14:36:30,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:30,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 14:36:30,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:30,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 14:36:30,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:30,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:30,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:30,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 14:36:30,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:30,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 14:36:30,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:30,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 14:36:30,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:30,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 14:36:30,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:30,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 14:36:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:30,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 14:36:30,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:30,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 14:36:30,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:30,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 14:36:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:30,817 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 14:36:30,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:36:30,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480430710] [2024-10-24 14:36:30,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480430710] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:36:30,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:36:30,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:36:30,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533144499] [2024-10-24 14:36:30,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:36:30,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:36:30,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:36:30,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:36:30,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:36:30,820 INFO L87 Difference]: Start difference. First operand 902 states and 1206 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 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) [2024-10-24 14:36:33,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:36:33,738 INFO L93 Difference]: Finished difference Result 902 states and 1206 transitions. [2024-10-24 14:36:33,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:36:33,738 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 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 83 [2024-10-24 14:36:33,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:36:33,743 INFO L225 Difference]: With dead ends: 902 [2024-10-24 14:36:33,743 INFO L226 Difference]: Without dead ends: 900 [2024-10-24 14:36:33,744 INFO L431 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 [2024-10-24 14:36:33,744 INFO L432 NwaCegarLoop]: 782 mSDtfsCounter, 1431 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 1572 mSolverCounterSat, 712 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1624 SdHoareTripleChecker+Valid, 2079 SdHoareTripleChecker+Invalid, 2284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 712 IncrementalHoareTripleChecker+Valid, 1572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-24 14:36:33,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1624 Valid, 2079 Invalid, 2284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [712 Valid, 1572 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-24 14:36:33,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2024-10-24 14:36:33,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 900. [2024-10-24 14:36:33,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 540 states have (on average 1.2740740740740741) internal successors, (688), 574 states have internal predecessors, (688), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 254 states have call predecessors, (257), 257 states have call successors, (257) [2024-10-24 14:36:33,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1204 transitions. [2024-10-24 14:36:33,787 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1204 transitions. Word has length 83 [2024-10-24 14:36:33,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:36:33,787 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1204 transitions. [2024-10-24 14:36:33,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 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) [2024-10-24 14:36:33,787 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1204 transitions. [2024-10-24 14:36:33,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-24 14:36:33,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:36:33,788 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-24 14:36:33,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 14:36:33,789 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-10-24 14:36:33,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:36:33,789 INFO L85 PathProgramCache]: Analyzing trace with hash 983878165, now seen corresponding path program 1 times [2024-10-24 14:36:33,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:36:33,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730453462] [2024-10-24 14:36:33,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:36:33,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:36:33,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:33,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:33,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:33,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:36:33,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:33,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 14:36:34,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:34,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:36:34,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:34,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 14:36:34,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:34,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 14:36:34,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:34,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 14:36:34,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:34,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:34,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:34,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 14:36:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:34,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 14:36:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:34,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 14:36:34,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:34,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 14:36:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:34,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 14:36:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:34,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 14:36:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:34,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 14:36:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:34,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 14:36:34,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:34,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 14:36:34,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:34,086 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 14:36:34,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:36:34,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730453462] [2024-10-24 14:36:34,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730453462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:36:34,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:36:34,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:36:34,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416088603] [2024-10-24 14:36:34,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:36:34,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:36:34,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:36:34,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:36:34,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:36:34,088 INFO L87 Difference]: Start difference. First operand 900 states and 1204 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 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) [2024-10-24 14:36:36,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:36:36,510 INFO L93 Difference]: Finished difference Result 900 states and 1204 transitions. [2024-10-24 14:36:36,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:36:36,511 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 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 88 [2024-10-24 14:36:36,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:36:36,515 INFO L225 Difference]: With dead ends: 900 [2024-10-24 14:36:36,515 INFO L226 Difference]: Without dead ends: 898 [2024-10-24 14:36:36,516 INFO L431 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 [2024-10-24 14:36:36,516 INFO L432 NwaCegarLoop]: 782 mSDtfsCounter, 1425 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 1568 mSolverCounterSat, 712 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1617 SdHoareTripleChecker+Valid, 2079 SdHoareTripleChecker+Invalid, 2280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 712 IncrementalHoareTripleChecker+Valid, 1568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-24 14:36:36,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1617 Valid, 2079 Invalid, 2280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [712 Valid, 1568 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-24 14:36:36,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2024-10-24 14:36:36,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 898. [2024-10-24 14:36:36,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 539 states have (on average 1.2727272727272727) internal successors, (686), 572 states have internal predecessors, (686), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 254 states have call predecessors, (257), 257 states have call successors, (257) [2024-10-24 14:36:36,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1202 transitions. [2024-10-24 14:36:36,560 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1202 transitions. Word has length 88 [2024-10-24 14:36:36,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:36:36,561 INFO L471 AbstractCegarLoop]: Abstraction has 898 states and 1202 transitions. [2024-10-24 14:36:36,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 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) [2024-10-24 14:36:36,561 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1202 transitions. [2024-10-24 14:36:36,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-24 14:36:36,562 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:36:36,562 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-24 14:36:36,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 14:36:36,562 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-10-24 14:36:36,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:36:36,563 INFO L85 PathProgramCache]: Analyzing trace with hash 614243512, now seen corresponding path program 1 times [2024-10-24 14:36:36,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:36:36,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650825125] [2024-10-24 14:36:36,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:36:36,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:36:36,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:36,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:36,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:36,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:36:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:36,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 14:36:36,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:36,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:36:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:36,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 14:36:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:36,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 14:36:36,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:36,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 14:36:36,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:36,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:36,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:36,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 14:36:36,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:36,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 14:36:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:36,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 14:36:36,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:36,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 14:36:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:36,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 14:36:36,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:36,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 14:36:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:36,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 14:36:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:36,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 14:36:36,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:36,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 14:36:36,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:36,854 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 14:36:36,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:36:36,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650825125] [2024-10-24 14:36:36,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650825125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:36:36,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:36:36,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:36:36,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500452853] [2024-10-24 14:36:36,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:36:36,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:36:36,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:36:36,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:36:36,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:36:36,856 INFO L87 Difference]: Start difference. First operand 898 states and 1202 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, (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) [2024-10-24 14:36:39,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:36:39,109 INFO L93 Difference]: Finished difference Result 898 states and 1202 transitions. [2024-10-24 14:36:39,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:36:39,109 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, (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 90 [2024-10-24 14:36:39,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:36:39,113 INFO L225 Difference]: With dead ends: 898 [2024-10-24 14:36:39,113 INFO L226 Difference]: Without dead ends: 896 [2024-10-24 14:36:39,114 INFO L431 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 [2024-10-24 14:36:39,114 INFO L432 NwaCegarLoop]: 782 mSDtfsCounter, 1417 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 1564 mSolverCounterSat, 712 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1609 SdHoareTripleChecker+Valid, 2079 SdHoareTripleChecker+Invalid, 2276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 712 IncrementalHoareTripleChecker+Valid, 1564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-24 14:36:39,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1609 Valid, 2079 Invalid, 2276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [712 Valid, 1564 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-24 14:36:39,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2024-10-24 14:36:39,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 896. [2024-10-24 14:36:39,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 538 states have (on average 1.271375464684015) internal successors, (684), 570 states have internal predecessors, (684), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 254 states have call predecessors, (257), 257 states have call successors, (257) [2024-10-24 14:36:39,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1200 transitions. [2024-10-24 14:36:39,161 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1200 transitions. Word has length 90 [2024-10-24 14:36:39,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:36:39,162 INFO L471 AbstractCegarLoop]: Abstraction has 896 states and 1200 transitions. [2024-10-24 14:36:39,162 INFO L472 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, (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) [2024-10-24 14:36:39,162 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1200 transitions. [2024-10-24 14:36:39,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 14:36:39,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:36:39,163 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-24 14:36:39,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 14:36:39,163 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-10-24 14:36:39,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:36:39,164 INFO L85 PathProgramCache]: Analyzing trace with hash 482176534, now seen corresponding path program 1 times [2024-10-24 14:36:39,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:36:39,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889458931] [2024-10-24 14:36:39,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:36:39,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:36:39,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:39,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:39,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:36:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:39,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 14:36:39,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:39,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:36:39,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:39,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 14:36:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:39,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 14:36:39,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:39,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 14:36:39,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:39,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:39,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:39,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 14:36:39,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:39,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 14:36:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:39,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 14:36:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:39,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 14:36:39,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:39,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 14:36:39,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:39,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 14:36:39,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:39,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 14:36:39,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:39,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 14:36:39,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:39,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 14:36:39,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:39,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 14:36:39,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:39,456 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 14:36:39,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:36:39,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889458931] [2024-10-24 14:36:39,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889458931] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:36:39,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:36:39,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:36:39,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465667805] [2024-10-24 14:36:39,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:36:39,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:36:39,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:36:39,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:36:39,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:36:39,458 INFO L87 Difference]: Start difference. First operand 896 states and 1200 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 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) [2024-10-24 14:36:41,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:36:41,732 INFO L93 Difference]: Finished difference Result 896 states and 1200 transitions. [2024-10-24 14:36:41,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:36:41,732 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 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 95 [2024-10-24 14:36:41,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:36:41,736 INFO L225 Difference]: With dead ends: 896 [2024-10-24 14:36:41,737 INFO L226 Difference]: Without dead ends: 894 [2024-10-24 14:36:41,737 INFO L431 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 [2024-10-24 14:36:41,738 INFO L432 NwaCegarLoop]: 782 mSDtfsCounter, 1413 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 1560 mSolverCounterSat, 712 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1604 SdHoareTripleChecker+Valid, 2079 SdHoareTripleChecker+Invalid, 2272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 712 IncrementalHoareTripleChecker+Valid, 1560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-24 14:36:41,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1604 Valid, 2079 Invalid, 2272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [712 Valid, 1560 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-24 14:36:41,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2024-10-24 14:36:41,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 894. [2024-10-24 14:36:41,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 537 states have (on average 1.2700186219739293) internal successors, (682), 568 states have internal predecessors, (682), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 254 states have call predecessors, (257), 257 states have call successors, (257) [2024-10-24 14:36:41,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1198 transitions. [2024-10-24 14:36:41,788 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1198 transitions. Word has length 95 [2024-10-24 14:36:41,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:36:41,789 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 1198 transitions. [2024-10-24 14:36:41,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 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) [2024-10-24 14:36:41,789 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1198 transitions. [2024-10-24 14:36:41,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 14:36:41,790 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:36:41,790 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-24 14:36:41,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 14:36:41,791 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-10-24 14:36:41,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:36:41,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1866051489, now seen corresponding path program 1 times [2024-10-24 14:36:41,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:36:41,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687172105] [2024-10-24 14:36:41,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:36:41,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:36:41,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:41,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:41,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:41,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:36:41,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:41,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 14:36:41,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:42,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:36:42,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:42,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 14:36:42,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:42,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 14:36:42,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:42,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 14:36:42,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:42,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:42,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 14:36:42,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:42,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 14:36:42,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:42,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 14:36:42,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:42,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 14:36:42,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:42,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 14:36:42,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:42,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 14:36:42,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:42,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 14:36:42,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:42,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 14:36:42,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:42,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 14:36:42,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:42,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 14:36:42,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:42,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 14:36:42,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:42,077 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 14:36:42,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:36:42,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687172105] [2024-10-24 14:36:42,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687172105] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:36:42,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:36:42,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:36:42,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091009621] [2024-10-24 14:36:42,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:36:42,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:36:42,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:36:42,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:36:42,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:36:42,079 INFO L87 Difference]: Start difference. First operand 894 states and 1198 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 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) [2024-10-24 14:36:44,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:36:44,580 INFO L93 Difference]: Finished difference Result 894 states and 1198 transitions. [2024-10-24 14:36:44,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:36:44,580 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 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 100 [2024-10-24 14:36:44,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:36:44,585 INFO L225 Difference]: With dead ends: 894 [2024-10-24 14:36:44,585 INFO L226 Difference]: Without dead ends: 892 [2024-10-24 14:36:44,586 INFO L431 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 [2024-10-24 14:36:44,586 INFO L432 NwaCegarLoop]: 782 mSDtfsCounter, 1407 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 1556 mSolverCounterSat, 712 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1597 SdHoareTripleChecker+Valid, 2079 SdHoareTripleChecker+Invalid, 2268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 712 IncrementalHoareTripleChecker+Valid, 1556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-24 14:36:44,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1597 Valid, 2079 Invalid, 2268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [712 Valid, 1556 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-24 14:36:44,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2024-10-24 14:36:44,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 892. [2024-10-24 14:36:44,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 536 states have (on average 1.2686567164179106) internal successors, (680), 566 states have internal predecessors, (680), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 254 states have call predecessors, (257), 257 states have call successors, (257) [2024-10-24 14:36:44,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1196 transitions. [2024-10-24 14:36:44,651 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1196 transitions. Word has length 100 [2024-10-24 14:36:44,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:36:44,652 INFO L471 AbstractCegarLoop]: Abstraction has 892 states and 1196 transitions. [2024-10-24 14:36:44,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 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) [2024-10-24 14:36:44,652 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1196 transitions. [2024-10-24 14:36:44,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 14:36:44,653 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:36:44,654 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2024-10-24 14:36:44,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 14:36:44,654 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-10-24 14:36:44,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:36:44,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1901973382, now seen corresponding path program 1 times [2024-10-24 14:36:44,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:36:44,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822935209] [2024-10-24 14:36:44,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:36:44,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:36:44,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:45,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:45,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:36:45,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:45,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 14:36:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:45,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:36:45,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:45,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-24 14:36:45,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:45,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:45,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:45,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:36:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:45,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:36:45,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:45,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 14:36:45,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:45,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:45,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:45,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:36:45,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:45,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:36:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:45,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 14:36:45,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:45,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:45,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:45,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:36:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:45,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:36:45,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:45,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 14:36:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:45,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:45,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:45,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:36:45,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:45,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:36:45,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:45,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 14:36:45,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:45,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:45,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:45,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:36:45,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:45,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:36:45,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:45,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 14:36:45,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:45,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 14:36:45,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:45,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 14:36:45,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:45,894 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-10-24 14:36:45,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:36:45,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822935209] [2024-10-24 14:36:45,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822935209] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:36:45,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:36:45,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 14:36:45,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908947147] [2024-10-24 14:36:45,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:36:45,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 14:36:45,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:36:45,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 14:36:45,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 14:36:45,897 INFO L87 Difference]: Start difference. First operand 892 states and 1196 transitions. Second operand has 9 states, 8 states have (on average 4.375) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 14:36:50,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:36:50,259 INFO L93 Difference]: Finished difference Result 1765 states and 2374 transitions. [2024-10-24 14:36:50,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 14:36:50,260 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2024-10-24 14:36:50,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:36:50,264 INFO L225 Difference]: With dead ends: 1765 [2024-10-24 14:36:50,264 INFO L226 Difference]: Without dead ends: 906 [2024-10-24 14:36:50,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-10-24 14:36:50,267 INFO L432 NwaCegarLoop]: 784 mSDtfsCounter, 1679 mSDsluCounter, 2595 mSDsCounter, 0 mSdLazyCounter, 3313 mSolverCounterSat, 1022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1883 SdHoareTripleChecker+Valid, 3379 SdHoareTripleChecker+Invalid, 4335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1022 IncrementalHoareTripleChecker+Valid, 3313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-24 14:36:50,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1883 Valid, 3379 Invalid, 4335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1022 Valid, 3313 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-24 14:36:50,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2024-10-24 14:36:50,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 892. [2024-10-24 14:36:50,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 536 states have (on average 1.2667910447761195) internal successors, (679), 566 states have internal predecessors, (679), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 254 states have call predecessors, (257), 257 states have call successors, (257) [2024-10-24 14:36:50,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1195 transitions. [2024-10-24 14:36:50,327 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1195 transitions. Word has length 131 [2024-10-24 14:36:50,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:36:50,327 INFO L471 AbstractCegarLoop]: Abstraction has 892 states and 1195 transitions. [2024-10-24 14:36:50,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 14:36:50,328 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1195 transitions. [2024-10-24 14:36:50,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 14:36:50,329 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:36:50,329 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2024-10-24 14:36:50,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 14:36:50,330 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-10-24 14:36:50,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:36:50,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1902032964, now seen corresponding path program 1 times [2024-10-24 14:36:50,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:36:50,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130461701] [2024-10-24 14:36:50,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:36:50,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:36:50,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:50,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:50,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:50,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:36:50,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:50,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 14:36:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:50,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:36:50,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:50,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-24 14:36:50,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:50,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:50,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:50,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:36:50,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:50,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:36:50,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:50,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 14:36:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:50,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:50,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:36:50,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:50,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:36:50,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:50,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 14:36:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:50,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:50,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:50,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:36:50,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:50,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:36:50,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:50,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 14:36:50,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:50,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:50,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:36:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:50,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:36:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:50,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 14:36:50,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:50,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:50,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:50,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:36:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:50,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:36:50,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:50,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 14:36:50,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:50,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 14:36:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:50,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 14:36:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:50,779 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-10-24 14:36:50,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:36:50,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130461701] [2024-10-24 14:36:50,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130461701] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:36:50,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:36:50,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 14:36:50,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783590411] [2024-10-24 14:36:50,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:36:50,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 14:36:50,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:36:50,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 14:36:50,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 14:36:50,782 INFO L87 Difference]: Start difference. First operand 892 states and 1195 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 14:36:54,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:36:54,071 INFO L93 Difference]: Finished difference Result 906 states and 1219 transitions. [2024-10-24 14:36:54,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 14:36:54,072 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2024-10-24 14:36:54,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:36:54,076 INFO L225 Difference]: With dead ends: 906 [2024-10-24 14:36:54,076 INFO L226 Difference]: Without dead ends: 904 [2024-10-24 14:36:54,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-10-24 14:36:54,077 INFO L432 NwaCegarLoop]: 786 mSDtfsCounter, 796 mSDsluCounter, 2231 mSDsCounter, 0 mSdLazyCounter, 2485 mSolverCounterSat, 920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 3017 SdHoareTripleChecker+Invalid, 3405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 920 IncrementalHoareTripleChecker+Valid, 2485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-24 14:36:54,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 3017 Invalid, 3405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [920 Valid, 2485 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-24 14:36:54,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2024-10-24 14:36:54,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 890. [2024-10-24 14:36:54,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 535 states have (on average 1.2654205607476636) internal successors, (677), 564 states have internal predecessors, (677), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 254 states have call predecessors, (257), 257 states have call successors, (257) [2024-10-24 14:36:54,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1193 transitions. [2024-10-24 14:36:54,132 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1193 transitions. Word has length 131 [2024-10-24 14:36:54,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:36:54,132 INFO L471 AbstractCegarLoop]: Abstraction has 890 states and 1193 transitions. [2024-10-24 14:36:54,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 14:36:54,133 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1193 transitions. [2024-10-24 14:36:54,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 14:36:54,134 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:36:54,134 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-24 14:36:54,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 14:36:54,134 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-10-24 14:36:54,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:36:54,134 INFO L85 PathProgramCache]: Analyzing trace with hash 438070283, now seen corresponding path program 1 times [2024-10-24 14:36:54,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:36:54,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887651334] [2024-10-24 14:36:54,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:36:54,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:36:54,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:36:54,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 14:36:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:36:54,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 14:36:54,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 14:36:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 14:36:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 14:36:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 14:36:54,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 14:36:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 14:36:54,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 14:36:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 14:36:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 14:36:54,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 14:36:54,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 14:36:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 14:36:54,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 14:36:54,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 14:36:54,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,414 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 14:36:54,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:36:54,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887651334] [2024-10-24 14:36:54,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887651334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:36:54,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:36:54,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:36:54,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559243848] [2024-10-24 14:36:54,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:36:54,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:36:54,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:36:54,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:36:54,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:36:54,416 INFO L87 Difference]: Start difference. First operand 890 states and 1193 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (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) [2024-10-24 14:36:56,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:36:56,882 INFO L93 Difference]: Finished difference Result 890 states and 1193 transitions. [2024-10-24 14:36:56,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:36:56,883 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (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 105 [2024-10-24 14:36:56,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:36:56,887 INFO L225 Difference]: With dead ends: 890 [2024-10-24 14:36:56,887 INFO L226 Difference]: Without dead ends: 888 [2024-10-24 14:36:56,887 INFO L431 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 [2024-10-24 14:36:56,888 INFO L432 NwaCegarLoop]: 782 mSDtfsCounter, 1392 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 1546 mSolverCounterSat, 712 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1581 SdHoareTripleChecker+Valid, 2079 SdHoareTripleChecker+Invalid, 2258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 712 IncrementalHoareTripleChecker+Valid, 1546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-24 14:36:56,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1581 Valid, 2079 Invalid, 2258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [712 Valid, 1546 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-24 14:36:56,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2024-10-24 14:36:56,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 888. [2024-10-24 14:36:56,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 534 states have (on average 1.2640449438202248) internal successors, (675), 562 states have internal predecessors, (675), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 254 states have call predecessors, (257), 257 states have call successors, (257) [2024-10-24 14:36:56,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1191 transitions. [2024-10-24 14:36:56,946 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1191 transitions. Word has length 105 [2024-10-24 14:36:56,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:36:56,946 INFO L471 AbstractCegarLoop]: Abstraction has 888 states and 1191 transitions. [2024-10-24 14:36:56,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (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) [2024-10-24 14:36:56,947 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1191 transitions. [2024-10-24 14:36:56,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-24 14:36:56,948 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:36:56,948 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2024-10-24 14:36:56,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 14:36:56,948 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-10-24 14:36:56,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:36:56,948 INFO L85 PathProgramCache]: Analyzing trace with hash 2116740903, now seen corresponding path program 1 times [2024-10-24 14:36:56,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:36:56,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381995959] [2024-10-24 14:36:56,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:36:56,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:36:57,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:57,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:57,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:57,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:36:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:57,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 14:36:57,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:57,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:36:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:57,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-24 14:36:57,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:57,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:57,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:57,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:36:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:57,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:36:57,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:57,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 14:36:57,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:57,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:57,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:57,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:36:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:57,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:36:57,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:57,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 14:36:57,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:57,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:57,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:57,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:36:57,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:57,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:36:57,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:57,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 14:36:57,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:57,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:57,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:57,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:36:57,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:57,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:36:57,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:57,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 14:36:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:57,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:57,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:36:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:57,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:36:57,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:57,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 14:36:57,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:57,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 14:36:57,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:57,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 14:36:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:57,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:57,254 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-10-24 14:36:57,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:36:57,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381995959] [2024-10-24 14:36:57,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381995959] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:36:57,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:36:57,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:36:57,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304980677] [2024-10-24 14:36:57,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:36:57,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:36:57,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:36:57,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:36:57,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:36:57,256 INFO L87 Difference]: Start difference. First operand 888 states and 1191 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 14:36:59,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:36:59,972 INFO L93 Difference]: Finished difference Result 1753 states and 2360 transitions. [2024-10-24 14:36:59,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:36:59,973 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 137 [2024-10-24 14:36:59,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:36:59,977 INFO L225 Difference]: With dead ends: 1753 [2024-10-24 14:36:59,977 INFO L226 Difference]: Without dead ends: 898 [2024-10-24 14:36:59,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-24 14:36:59,980 INFO L432 NwaCegarLoop]: 783 mSDtfsCounter, 1643 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 1021 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1848 SdHoareTripleChecker+Valid, 1866 SdHoareTripleChecker+Invalid, 2246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1021 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-24 14:36:59,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1848 Valid, 1866 Invalid, 2246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1021 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-24 14:36:59,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2024-10-24 14:37:00,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 884. [2024-10-24 14:37:00,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 531 states have (on average 1.2617702448210923) internal successors, (670), 558 states have internal predecessors, (670), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 254 states have call predecessors, (257), 257 states have call successors, (257) [2024-10-24 14:37:00,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1186 transitions. [2024-10-24 14:37:00,041 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1186 transitions. Word has length 137 [2024-10-24 14:37:00,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:37:00,042 INFO L471 AbstractCegarLoop]: Abstraction has 884 states and 1186 transitions. [2024-10-24 14:37:00,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 14:37:00,042 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1186 transitions. [2024-10-24 14:37:00,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-24 14:37:00,043 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:37:00,043 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:37:00,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 14:37:00,044 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-10-24 14:37:00,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:37:00,044 INFO L85 PathProgramCache]: Analyzing trace with hash -530790256, now seen corresponding path program 1 times [2024-10-24 14:37:00,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:37:00,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863202788] [2024-10-24 14:37:00,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:37:00,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:37:00,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:00,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:00,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:37:00,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:00,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 14:37:00,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:00,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:37:00,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:00,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 14:37:00,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:00,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 14:37:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:00,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 14:37:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:00,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:00,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 14:37:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:00,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 14:37:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:00,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 14:37:00,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:00,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 14:37:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:00,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:00,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:00,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:37:00,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:00,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:37:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:00,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 14:37:00,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:00,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:00,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:00,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:37:00,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:00,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:37:00,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:00,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 14:37:00,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:00,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:00,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:37:00,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:00,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:37:00,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:00,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 14:37:00,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:00,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 14:37:00,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:00,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 14:37:00,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:00,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:00,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:00,455 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-10-24 14:37:00,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:37:00,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863202788] [2024-10-24 14:37:00,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863202788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:37:00,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:37:00,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 14:37:00,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701379273] [2024-10-24 14:37:00,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:37:00,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 14:37:00,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:37:00,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 14:37:00,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 14:37:00,459 INFO L87 Difference]: Start difference. First operand 884 states and 1186 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 14:37:04,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:37:04,585 INFO L93 Difference]: Finished difference Result 1521 states and 2007 transitions. [2024-10-24 14:37:04,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 14:37:04,586 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 130 [2024-10-24 14:37:04,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:37:04,590 INFO L225 Difference]: With dead ends: 1521 [2024-10-24 14:37:04,590 INFO L226 Difference]: Without dead ends: 900 [2024-10-24 14:37:04,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-10-24 14:37:04,592 INFO L432 NwaCegarLoop]: 782 mSDtfsCounter, 775 mSDsluCounter, 2798 mSDsCounter, 0 mSdLazyCounter, 3071 mSolverCounterSat, 921 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 3580 SdHoareTripleChecker+Invalid, 3992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 921 IncrementalHoareTripleChecker+Valid, 3071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-24 14:37:04,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 3580 Invalid, 3992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [921 Valid, 3071 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-24 14:37:04,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2024-10-24 14:37:04,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 888. [2024-10-24 14:37:04,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 534 states have (on average 1.2602996254681649) internal successors, (673), 561 states have internal predecessors, (673), 259 states have call successors, (259), 79 states have call predecessors, (259), 79 states have return successors, (261), 255 states have call predecessors, (261), 257 states have call successors, (261) [2024-10-24 14:37:04,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1193 transitions. [2024-10-24 14:37:04,653 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1193 transitions. Word has length 130 [2024-10-24 14:37:04,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:37:04,654 INFO L471 AbstractCegarLoop]: Abstraction has 888 states and 1193 transitions. [2024-10-24 14:37:04,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 14:37:04,654 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1193 transitions. [2024-10-24 14:37:04,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-24 14:37:04,655 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:37:04,655 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-24 14:37:04,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 14:37:04,655 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-10-24 14:37:04,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:37:04,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1386666455, now seen corresponding path program 1 times [2024-10-24 14:37:04,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:37:04,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950086949] [2024-10-24 14:37:04,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:37:04,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:37:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:04,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:04,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:04,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:37:04,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:04,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 14:37:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:04,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:37:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:04,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 14:37:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:04,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 14:37:04,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:04,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 14:37:04,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:04,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:04,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:04,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 14:37:04,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:04,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 14:37:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:04,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 14:37:04,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:04,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 14:37:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:04,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 14:37:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:04,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 14:37:04,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:04,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 14:37:04,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:04,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 14:37:04,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:04,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 14:37:04,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:04,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 14:37:04,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:04,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 14:37:04,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:04,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 14:37:04,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:04,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 14:37:04,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:04,918 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 14:37:04,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:37:04,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950086949] [2024-10-24 14:37:04,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950086949] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:37:04,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:37:04,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:37:04,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641873664] [2024-10-24 14:37:04,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:37:04,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:37:04,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:37:04,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:37:04,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:37:04,920 INFO L87 Difference]: Start difference. First operand 888 states and 1193 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, (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) [2024-10-24 14:37:07,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:37:07,377 INFO L93 Difference]: Finished difference Result 888 states and 1193 transitions. [2024-10-24 14:37:07,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:37:07,378 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, (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 110 [2024-10-24 14:37:07,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:37:07,383 INFO L225 Difference]: With dead ends: 888 [2024-10-24 14:37:07,383 INFO L226 Difference]: Without dead ends: 886 [2024-10-24 14:37:07,383 INFO L431 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 [2024-10-24 14:37:07,384 INFO L432 NwaCegarLoop]: 782 mSDtfsCounter, 1371 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 1532 mSolverCounterSat, 712 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1559 SdHoareTripleChecker+Valid, 2079 SdHoareTripleChecker+Invalid, 2244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 712 IncrementalHoareTripleChecker+Valid, 1532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-24 14:37:07,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1559 Valid, 2079 Invalid, 2244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [712 Valid, 1532 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-24 14:37:07,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2024-10-24 14:37:07,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 886. [2024-10-24 14:37:07,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 533 states have (on average 1.2589118198874296) internal successors, (671), 559 states have internal predecessors, (671), 259 states have call successors, (259), 79 states have call predecessors, (259), 79 states have return successors, (261), 255 states have call predecessors, (261), 257 states have call successors, (261) [2024-10-24 14:37:07,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1191 transitions. [2024-10-24 14:37:07,449 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1191 transitions. Word has length 110 [2024-10-24 14:37:07,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:37:07,449 INFO L471 AbstractCegarLoop]: Abstraction has 886 states and 1191 transitions. [2024-10-24 14:37:07,450 INFO L472 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, (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) [2024-10-24 14:37:07,450 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1191 transitions. [2024-10-24 14:37:07,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-24 14:37:07,451 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:37:07,451 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-24 14:37:07,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 14:37:07,451 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-10-24 14:37:07,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:37:07,451 INFO L85 PathProgramCache]: Analyzing trace with hash -323591968, now seen corresponding path program 1 times [2024-10-24 14:37:07,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:37:07,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203283312] [2024-10-24 14:37:07,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:37:07,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:37:07,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:37:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 14:37:07,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:37:07,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 14:37:07,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 14:37:07,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 14:37:07,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 14:37:07,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 14:37:07,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 14:37:07,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 14:37:07,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 14:37:07,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 14:37:07,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 14:37:07,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 14:37:07,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 14:37:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 14:37:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 14:37:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 14:37:07,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 14:37:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 14:37:07,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,749 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 14:37:07,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:37:07,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203283312] [2024-10-24 14:37:07,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203283312] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:37:07,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:37:07,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:37:07,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092142509] [2024-10-24 14:37:07,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:37:07,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:37:07,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:37:07,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:37:07,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:37:07,752 INFO L87 Difference]: Start difference. First operand 886 states and 1191 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 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) [2024-10-24 14:37:10,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:37:10,057 INFO L93 Difference]: Finished difference Result 886 states and 1191 transitions. [2024-10-24 14:37:10,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:37:10,058 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 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 115 [2024-10-24 14:37:10,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:37:10,064 INFO L225 Difference]: With dead ends: 886 [2024-10-24 14:37:10,064 INFO L226 Difference]: Without dead ends: 884 [2024-10-24 14:37:10,064 INFO L431 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 [2024-10-24 14:37:10,065 INFO L432 NwaCegarLoop]: 782 mSDtfsCounter, 1365 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 1528 mSolverCounterSat, 712 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1552 SdHoareTripleChecker+Valid, 2079 SdHoareTripleChecker+Invalid, 2240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 712 IncrementalHoareTripleChecker+Valid, 1528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-24 14:37:10,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1552 Valid, 2079 Invalid, 2240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [712 Valid, 1528 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-24 14:37:10,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2024-10-24 14:37:10,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 884. [2024-10-24 14:37:10,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 532 states have (on average 1.2575187969924813) internal successors, (669), 557 states have internal predecessors, (669), 259 states have call successors, (259), 79 states have call predecessors, (259), 79 states have return successors, (261), 255 states have call predecessors, (261), 257 states have call successors, (261) [2024-10-24 14:37:10,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1189 transitions. [2024-10-24 14:37:10,135 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1189 transitions. Word has length 115 [2024-10-24 14:37:10,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:37:10,135 INFO L471 AbstractCegarLoop]: Abstraction has 884 states and 1189 transitions. [2024-10-24 14:37:10,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 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) [2024-10-24 14:37:10,137 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1189 transitions. [2024-10-24 14:37:10,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-24 14:37:10,138 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:37:10,138 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 7, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:37:10,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 14:37:10,139 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-10-24 14:37:10,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:37:10,139 INFO L85 PathProgramCache]: Analyzing trace with hash -283717307, now seen corresponding path program 1 times [2024-10-24 14:37:10,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:37:10,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968852232] [2024-10-24 14:37:10,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:37:10,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:37:10,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:10,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:37:10,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 14:37:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:37:10,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 14:37:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 14:37:10,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 14:37:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 14:37:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 14:37:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 14:37:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 14:37:10,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:10,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:37:10,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:37:10,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 14:37:10,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:10,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:37:10,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:37:10,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 14:37:10,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:10,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:37:10,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:37:10,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 14:37:10,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 14:37:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 14:37:10,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:10,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:37:10,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 14:37:10,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 14:37:10,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:10,734 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2024-10-24 14:37:10,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:37:10,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968852232] [2024-10-24 14:37:10,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968852232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:37:10,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:37:10,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 14:37:10,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145720797] [2024-10-24 14:37:10,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:37:10,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 14:37:10,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:37:10,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 14:37:10,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 14:37:10,737 INFO L87 Difference]: Start difference. First operand 884 states and 1189 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (26), 6 states have call predecessors, (26), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-24 14:37:15,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:37:15,110 INFO L93 Difference]: Finished difference Result 986 states and 1297 transitions. [2024-10-24 14:37:15,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 14:37:15,111 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (26), 6 states have call predecessors, (26), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 143 [2024-10-24 14:37:15,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:37:15,115 INFO L225 Difference]: With dead ends: 986 [2024-10-24 14:37:15,115 INFO L226 Difference]: Without dead ends: 984 [2024-10-24 14:37:15,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-10-24 14:37:15,116 INFO L432 NwaCegarLoop]: 784 mSDtfsCounter, 1670 mSDsluCounter, 2292 mSDsCounter, 0 mSdLazyCounter, 2641 mSolverCounterSat, 1079 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1845 SdHoareTripleChecker+Valid, 3076 SdHoareTripleChecker+Invalid, 3720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1079 IncrementalHoareTripleChecker+Valid, 2641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-24 14:37:15,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1845 Valid, 3076 Invalid, 3720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1079 Valid, 2641 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-24 14:37:15,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2024-10-24 14:37:15,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 966. [2024-10-24 14:37:15,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 582 states have (on average 1.2525773195876289) internal successors, (729), 607 states have internal predecessors, (729), 271 states have call successors, (271), 99 states have call predecessors, (271), 99 states have return successors, (273), 267 states have call predecessors, (273), 269 states have call successors, (273) [2024-10-24 14:37:15,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1273 transitions. [2024-10-24 14:37:15,230 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1273 transitions. Word has length 143 [2024-10-24 14:37:15,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:37:15,232 INFO L471 AbstractCegarLoop]: Abstraction has 966 states and 1273 transitions. [2024-10-24 14:37:15,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (26), 6 states have call predecessors, (26), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-24 14:37:15,232 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1273 transitions. [2024-10-24 14:37:15,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-24 14:37:15,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:37:15,233 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-24 14:37:15,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 14:37:15,233 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-10-24 14:37:15,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:37:15,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1867082109, now seen corresponding path program 1 times [2024-10-24 14:37:15,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:37:15,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883491751] [2024-10-24 14:37:15,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:37:15,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:37:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:15,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:15,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:15,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:37:15,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:15,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 14:37:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:15,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:37:15,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:15,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 14:37:15,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:15,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 14:37:15,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:15,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 14:37:15,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:15,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:15,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:15,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 14:37:15,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:15,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 14:37:15,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:15,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 14:37:15,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:15,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 14:37:15,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:15,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 14:37:15,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:15,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 14:37:15,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:15,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 14:37:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:15,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 14:37:15,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:15,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 14:37:15,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:15,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 14:37:15,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:15,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 14:37:15,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:15,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 14:37:15,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:15,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 14:37:15,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:15,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 14:37:15,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:15,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-24 14:37:15,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:15,546 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 14:37:15,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:37:15,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883491751] [2024-10-24 14:37:15,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883491751] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:37:15,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:37:15,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:37:15,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855512110] [2024-10-24 14:37:15,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:37:15,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:37:15,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:37:15,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:37:15,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:37:15,548 INFO L87 Difference]: Start difference. First operand 966 states and 1273 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 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) [2024-10-24 14:37:18,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:37:18,044 INFO L93 Difference]: Finished difference Result 966 states and 1273 transitions. [2024-10-24 14:37:18,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:37:18,045 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 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 120 [2024-10-24 14:37:18,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:37:18,049 INFO L225 Difference]: With dead ends: 966 [2024-10-24 14:37:18,049 INFO L226 Difference]: Without dead ends: 964 [2024-10-24 14:37:18,049 INFO L431 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 [2024-10-24 14:37:18,050 INFO L432 NwaCegarLoop]: 782 mSDtfsCounter, 1359 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 1524 mSolverCounterSat, 712 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1545 SdHoareTripleChecker+Valid, 2079 SdHoareTripleChecker+Invalid, 2236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 712 IncrementalHoareTripleChecker+Valid, 1524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-24 14:37:18,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1545 Valid, 2079 Invalid, 2236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [712 Valid, 1524 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-24 14:37:18,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2024-10-24 14:37:18,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 964. [2024-10-24 14:37:18,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 581 states have (on average 1.2512908777969018) internal successors, (727), 605 states have internal predecessors, (727), 271 states have call successors, (271), 99 states have call predecessors, (271), 99 states have return successors, (273), 267 states have call predecessors, (273), 269 states have call successors, (273) [2024-10-24 14:37:18,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1271 transitions. [2024-10-24 14:37:18,170 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1271 transitions. Word has length 120 [2024-10-24 14:37:18,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:37:18,170 INFO L471 AbstractCegarLoop]: Abstraction has 964 states and 1271 transitions. [2024-10-24 14:37:18,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 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) [2024-10-24 14:37:18,170 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1271 transitions. [2024-10-24 14:37:18,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-24 14:37:18,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:37:18,176 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-24 14:37:18,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 14:37:18,176 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-10-24 14:37:18,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:37:18,176 INFO L85 PathProgramCache]: Analyzing trace with hash -2019390321, now seen corresponding path program 1 times [2024-10-24 14:37:18,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:37:18,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804556641] [2024-10-24 14:37:18,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:37:18,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:37:18,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:18,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:18,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:18,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:37:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:18,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 14:37:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:18,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:37:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:18,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 14:37:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:18,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 14:37:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:18,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 14:37:18,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:18,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:18,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:18,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 14:37:18,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:18,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 14:37:18,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:18,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 14:37:18,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:18,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 14:37:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:18,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 14:37:18,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:18,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 14:37:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:18,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 14:37:18,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:18,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 14:37:18,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:18,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 14:37:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:18,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 14:37:18,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:18,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 14:37:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:18,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 14:37:18,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:18,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 14:37:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:18,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 14:37:18,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:18,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-24 14:37:18,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:18,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 14:37:18,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:18,527 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 14:37:18,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:37:18,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804556641] [2024-10-24 14:37:18,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804556641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:37:18,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:37:18,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:37:18,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690545532] [2024-10-24 14:37:18,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:37:18,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:37:18,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:37:18,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:37:18,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:37:18,530 INFO L87 Difference]: Start difference. First operand 964 states and 1271 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 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) [2024-10-24 14:37:20,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:37:20,831 INFO L93 Difference]: Finished difference Result 964 states and 1271 transitions. [2024-10-24 14:37:20,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:37:20,831 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 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 125 [2024-10-24 14:37:20,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:37:20,836 INFO L225 Difference]: With dead ends: 964 [2024-10-24 14:37:20,836 INFO L226 Difference]: Without dead ends: 962 [2024-10-24 14:37:20,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-24 14:37:20,837 INFO L432 NwaCegarLoop]: 782 mSDtfsCounter, 1353 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 1520 mSolverCounterSat, 712 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1538 SdHoareTripleChecker+Valid, 2079 SdHoareTripleChecker+Invalid, 2232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 712 IncrementalHoareTripleChecker+Valid, 1520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-24 14:37:20,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1538 Valid, 2079 Invalid, 2232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [712 Valid, 1520 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-24 14:37:20,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2024-10-24 14:37:20,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2024-10-24 14:37:20,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 580 states have (on average 1.25) internal successors, (725), 603 states have internal predecessors, (725), 271 states have call successors, (271), 99 states have call predecessors, (271), 99 states have return successors, (273), 267 states have call predecessors, (273), 269 states have call successors, (273) [2024-10-24 14:37:20,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1269 transitions. [2024-10-24 14:37:20,959 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1269 transitions. Word has length 125 [2024-10-24 14:37:20,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:37:20,960 INFO L471 AbstractCegarLoop]: Abstraction has 962 states and 1269 transitions. [2024-10-24 14:37:20,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 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) [2024-10-24 14:37:20,960 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1269 transitions. [2024-10-24 14:37:20,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-24 14:37:20,961 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:37:20,961 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-24 14:37:20,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 14:37:20,961 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-10-24 14:37:20,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:37:20,962 INFO L85 PathProgramCache]: Analyzing trace with hash -638774019, now seen corresponding path program 1 times [2024-10-24 14:37:20,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:37:20,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379065975] [2024-10-24 14:37:20,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:37:20,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:37:21,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:21,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:37:21,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 14:37:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:37:21,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 14:37:21,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 14:37:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 14:37:21,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:21,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 14:37:21,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 14:37:21,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 14:37:21,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 14:37:21,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 14:37:21,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 14:37:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 14:37:21,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 14:37:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 14:37:21,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 14:37:21,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 14:37:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 14:37:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 14:37:21,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 14:37:21,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-24 14:37:21,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 14:37:21,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 14:37:21,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:21,226 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 14:37:21,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:37:21,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379065975] [2024-10-24 14:37:21,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379065975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:37:21,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:37:21,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:37:21,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544727672] [2024-10-24 14:37:21,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:37:21,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:37:21,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:37:21,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:37:21,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:37:21,229 INFO L87 Difference]: Start difference. First operand 962 states and 1269 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, (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) [2024-10-24 14:37:23,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:37:23,637 INFO L93 Difference]: Finished difference Result 962 states and 1269 transitions. [2024-10-24 14:37:23,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:37:23,638 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, (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 130 [2024-10-24 14:37:23,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:37:23,643 INFO L225 Difference]: With dead ends: 962 [2024-10-24 14:37:23,643 INFO L226 Difference]: Without dead ends: 960 [2024-10-24 14:37:23,644 INFO L431 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 [2024-10-24 14:37:23,647 INFO L432 NwaCegarLoop]: 782 mSDtfsCounter, 1347 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 1516 mSolverCounterSat, 712 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1531 SdHoareTripleChecker+Valid, 2079 SdHoareTripleChecker+Invalid, 2228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 712 IncrementalHoareTripleChecker+Valid, 1516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-24 14:37:23,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1531 Valid, 2079 Invalid, 2228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [712 Valid, 1516 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-24 14:37:23,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2024-10-24 14:37:23,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 960. [2024-10-24 14:37:23,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 579 states have (on average 1.2487046632124352) internal successors, (723), 601 states have internal predecessors, (723), 271 states have call successors, (271), 99 states have call predecessors, (271), 99 states have return successors, (273), 267 states have call predecessors, (273), 269 states have call successors, (273) [2024-10-24 14:37:23,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1267 transitions. [2024-10-24 14:37:23,772 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1267 transitions. Word has length 130 [2024-10-24 14:37:23,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:37:23,772 INFO L471 AbstractCegarLoop]: Abstraction has 960 states and 1267 transitions. [2024-10-24 14:37:23,772 INFO L472 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, (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) [2024-10-24 14:37:23,772 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1267 transitions. [2024-10-24 14:37:23,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-24 14:37:23,773 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:37:23,773 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 7, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:37:23,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-24 14:37:23,773 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-10-24 14:37:23,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:37:23,774 INFO L85 PathProgramCache]: Analyzing trace with hash 181263125, now seen corresponding path program 1 times [2024-10-24 14:37:23,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:37:23,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028645451] [2024-10-24 14:37:23,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:37:23,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:37:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:24,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:24,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:24,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:37:24,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:24,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 14:37:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:24,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:37:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:24,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 14:37:24,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:24,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 14:37:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:24,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 14:37:24,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:24,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:24,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:24,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 14:37:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:24,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 14:37:24,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:24,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 14:37:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:24,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 14:37:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:24,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:24,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:37:24,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:24,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:37:24,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:24,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 14:37:24,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:24,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:24,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:37:24,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:24,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:37:24,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:24,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 14:37:24,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:24,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:24,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:37:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:24,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:37:24,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:24,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 14:37:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:24,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 14:37:24,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:24,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 14:37:24,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:24,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:24,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:24,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:37:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:24,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 14:37:24,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:24,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 14:37:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:24,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 14:37:24,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:24,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:24,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:24,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 14:37:24,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:24,233 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2024-10-24 14:37:24,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:37:24,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028645451] [2024-10-24 14:37:24,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028645451] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:37:24,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:37:24,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 14:37:24,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411234214] [2024-10-24 14:37:24,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:37:24,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 14:37:24,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:37:24,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 14:37:24,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 14:37:24,236 INFO L87 Difference]: Start difference. First operand 960 states and 1267 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (29), 7 states have call predecessors, (29), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-24 14:37:28,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:37:28,913 INFO L93 Difference]: Finished difference Result 984 states and 1294 transitions. [2024-10-24 14:37:28,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 14:37:28,913 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (29), 7 states have call predecessors, (29), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 158 [2024-10-24 14:37:28,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:37:28,917 INFO L225 Difference]: With dead ends: 984 [2024-10-24 14:37:28,918 INFO L226 Difference]: Without dead ends: 982 [2024-10-24 14:37:28,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=261, Unknown=0, NotChecked=0, Total=380 [2024-10-24 14:37:28,918 INFO L432 NwaCegarLoop]: 770 mSDtfsCounter, 1192 mSDsluCounter, 3108 mSDsCounter, 0 mSdLazyCounter, 3486 mSolverCounterSat, 1274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1205 SdHoareTripleChecker+Valid, 3878 SdHoareTripleChecker+Invalid, 4760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1274 IncrementalHoareTripleChecker+Valid, 3486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-24 14:37:28,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1205 Valid, 3878 Invalid, 4760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1274 Valid, 3486 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-10-24 14:37:28,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2024-10-24 14:37:29,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 964. [2024-10-24 14:37:29,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 582 states have (on average 1.2474226804123711) internal successors, (726), 604 states have internal predecessors, (726), 271 states have call successors, (271), 100 states have call predecessors, (271), 100 states have return successors, (273), 267 states have call predecessors, (273), 269 states have call successors, (273) [2024-10-24 14:37:29,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1270 transitions. [2024-10-24 14:37:29,010 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1270 transitions. Word has length 158 [2024-10-24 14:37:29,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:37:29,010 INFO L471 AbstractCegarLoop]: Abstraction has 964 states and 1270 transitions. [2024-10-24 14:37:29,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (29), 7 states have call predecessors, (29), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-24 14:37:29,011 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1270 transitions. [2024-10-24 14:37:29,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-24 14:37:29,012 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:37:29,012 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 7, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-24 14:37:29,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-24 14:37:29,012 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-10-24 14:37:29,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:37:29,013 INFO L85 PathProgramCache]: Analyzing trace with hash 643234334, now seen corresponding path program 1 times [2024-10-24 14:37:29,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:37:29,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94898072] [2024-10-24 14:37:29,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:37:29,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:37:29,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:29,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:29,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:29,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:37:29,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:29,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 14:37:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:29,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:37:29,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:29,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 14:37:29,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:29,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 14:37:29,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:29,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 14:37:29,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:29,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:29,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:29,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 14:37:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:29,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 14:37:29,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:29,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 14:37:29,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:29,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 14:37:29,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:29,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:29,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:29,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:37:29,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:29,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:37:29,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:29,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 14:37:29,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:29,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:29,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:29,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:37:29,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:29,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:37:29,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:29,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 14:37:29,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:29,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:29,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:29,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:37:29,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:29,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:37:29,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:29,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 14:37:29,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:29,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 14:37:29,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:29,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 14:37:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:29,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:29,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:29,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:37:29,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:29,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 14:37:29,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:29,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 14:37:29,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:29,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 14:37:29,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:29,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:29,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:29,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 14:37:29,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:29,492 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2024-10-24 14:37:29,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:37:29,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94898072] [2024-10-24 14:37:29,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94898072] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:37:29,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:37:29,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 14:37:29,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232354416] [2024-10-24 14:37:29,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:37:29,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 14:37:29,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:37:29,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 14:37:29,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 14:37:29,494 INFO L87 Difference]: Start difference. First operand 964 states and 1270 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (29), 7 states have call predecessors, (29), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27)