./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.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 838cbce098703eae9745d1ba54cc8860e1e4bdea5f00e637be7216785f1ba452 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 10:13:59,999 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 10:14:00,059 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-17 10:14:00,067 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 10:14:00,068 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 10:14:00,091 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 10:14:00,093 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 10:14:00,093 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 10:14:00,093 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 10:14:00,094 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 10:14:00,094 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 10:14:00,094 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 10:14:00,095 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 10:14:00,095 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 10:14:00,095 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 10:14:00,095 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 10:14:00,095 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 10:14:00,095 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 10:14:00,095 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 10:14:00,096 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 10:14:00,096 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 10:14:00,096 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 10:14:00,096 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 10:14:00,096 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 10:14:00,096 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 10:14:00,096 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 10:14:00,096 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 10:14:00,096 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 10:14:00,096 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 10:14:00,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:14:00,096 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 10:14:00,096 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 10:14:00,096 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 10:14:00,096 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 10:14:00,096 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 10:14:00,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 10:14:00,096 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 10:14:00,097 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 10:14:00,097 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 10:14:00,097 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 10:14:00,097 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 838cbce098703eae9745d1ba54cc8860e1e4bdea5f00e637be7216785f1ba452 [2025-03-17 10:14:00,362 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 10:14:00,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 10:14:00,373 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 10:14:00,374 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 10:14:00,374 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 10:14:00,375 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i [2025-03-17 10:14:01,601 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56e2648be/4ebf3ac3e8b8487fa6a935ae99c89923/FLAG74f4bbdd6 [2025-03-17 10:14:02,150 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 10:14:02,151 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--yurex.ko.cil.i [2025-03-17 10:14:02,202 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56e2648be/4ebf3ac3e8b8487fa6a935ae99c89923/FLAG74f4bbdd6 [2025-03-17 10:14:02,218 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56e2648be/4ebf3ac3e8b8487fa6a935ae99c89923 [2025-03-17 10:14:02,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 10:14:02,222 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 10:14:02,223 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 10:14:02,223 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 10:14:02,227 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 10:14:02,228 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:14:02" (1/1) ... [2025-03-17 10:14:02,228 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@736f61e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:14:02, skipping insertion in model container [2025-03-17 10:14:02,228 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:14:02" (1/1) ... [2025-03-17 10:14:02,313 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 10:14:04,319 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[259112,259125] [2025-03-17 10:14:04,323 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[259257,259270] [2025-03-17 10:14:04,323 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[259403,259416] [2025-03-17 10:14:04,324 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[259568,259581] [2025-03-17 10:14:04,324 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[259726,259739] [2025-03-17 10:14:04,324 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[259884,259897] [2025-03-17 10:14:04,325 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[260042,260055] [2025-03-17 10:14:04,325 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[260202,260215] [2025-03-17 10:14:04,325 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[260361,260374] [2025-03-17 10:14:04,326 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[260500,260513] [2025-03-17 10:14:04,328 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[260642,260655] [2025-03-17 10:14:04,329 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[260791,260804] [2025-03-17 10:14:04,329 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[260930,260943] [2025-03-17 10:14:04,329 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[261085,261098] [2025-03-17 10:14:04,329 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[261245,261258] [2025-03-17 10:14:04,329 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[261396,261409] [2025-03-17 10:14:04,330 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[261547,261560] [2025-03-17 10:14:04,330 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[261699,261712] [2025-03-17 10:14:04,330 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[261848,261861] [2025-03-17 10:14:04,330 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[261996,262009] [2025-03-17 10:14:04,330 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[262153,262166] [2025-03-17 10:14:04,330 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[262302,262315] [2025-03-17 10:14:04,331 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[262458,262471] [2025-03-17 10:14:04,331 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[262611,262624] [2025-03-17 10:14:04,331 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[262757,262770] [2025-03-17 10:14:04,331 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[262900,262913] [2025-03-17 10:14:04,331 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[263052,263065] [2025-03-17 10:14:04,332 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[263198,263211] [2025-03-17 10:14:04,332 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[263343,263356] [2025-03-17 10:14:04,333 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[263497,263510] [2025-03-17 10:14:04,333 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[263648,263661] [2025-03-17 10:14:04,333 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[263803,263816] [2025-03-17 10:14:04,334 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[263955,263968] [2025-03-17 10:14:04,337 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[264110,264123] [2025-03-17 10:14:04,338 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[264274,264287] [2025-03-17 10:14:04,339 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[264430,264443] [2025-03-17 10:14:04,339 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[264594,264607] [2025-03-17 10:14:04,339 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[264736,264749] [2025-03-17 10:14:04,339 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[264894,264907] [2025-03-17 10:14:04,339 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[265061,265074] [2025-03-17 10:14:04,339 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[265220,265233] [2025-03-17 10:14:04,340 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[265379,265392] [2025-03-17 10:14:04,340 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[265528,265541] [2025-03-17 10:14:04,340 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[265675,265688] [2025-03-17 10:14:04,340 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[265814,265827] [2025-03-17 10:14:04,340 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[265977,265990] [2025-03-17 10:14:04,340 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[266143,266156] [2025-03-17 10:14:04,341 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[266307,266320] [2025-03-17 10:14:04,341 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[266472,266485] [2025-03-17 10:14:04,341 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[266637,266650] [2025-03-17 10:14:04,342 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[266803,266816] [2025-03-17 10:14:04,342 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[266968,266981] [2025-03-17 10:14:04,342 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[267135,267148] [2025-03-17 10:14:04,342 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[267295,267308] [2025-03-17 10:14:04,342 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[267457,267470] [2025-03-17 10:14:04,343 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[267616,267629] [2025-03-17 10:14:04,343 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[267762,267775] [2025-03-17 10:14:04,343 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[267905,267918] [2025-03-17 10:14:04,343 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[268049,268062] [2025-03-17 10:14:04,344 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[268192,268205] [2025-03-17 10:14:04,344 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[268336,268349] [2025-03-17 10:14:04,344 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[268477,268490] [2025-03-17 10:14:04,344 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[268615,268628] [2025-03-17 10:14:04,345 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[268773,268786] [2025-03-17 10:14:04,345 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[268932,268945] [2025-03-17 10:14:04,345 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[269088,269101] [2025-03-17 10:14:04,345 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[269237,269250] [2025-03-17 10:14:04,346 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[269389,269402] [2025-03-17 10:14:04,346 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[269540,269553] [2025-03-17 10:14:04,346 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[269689,269702] [2025-03-17 10:14:04,346 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[269841,269854] [2025-03-17 10:14:04,346 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[269989,270002] [2025-03-17 10:14:04,347 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[270142,270155] [2025-03-17 10:14:04,347 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[270293,270306] [2025-03-17 10:14:04,347 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[270443,270456] [2025-03-17 10:14:04,347 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[270590,270603] [2025-03-17 10:14:04,347 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[270741,270754] [2025-03-17 10:14:04,347 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[270892,270905] [2025-03-17 10:14:04,348 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[271040,271053] [2025-03-17 10:14:04,348 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[271206,271219] [2025-03-17 10:14:04,348 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[271375,271388] [2025-03-17 10:14:04,348 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[271542,271555] [2025-03-17 10:14:04,348 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[271710,271723] [2025-03-17 10:14:04,349 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[271860,271873] [2025-03-17 10:14:04,349 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[272007,272020] [2025-03-17 10:14:04,349 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[272168,272181] [2025-03-17 10:14:04,349 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[272338,272351] [2025-03-17 10:14:04,350 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[272500,272513] [2025-03-17 10:14:04,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:14:04,373 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 10:14:04,431 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [4155] [2025-03-17 10:14:04,432 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4158] [2025-03-17 10:14:04,432 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4161] [2025-03-17 10:14:04,433 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4164] [2025-03-17 10:14:04,542 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[259112,259125] [2025-03-17 10:14:04,543 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[259257,259270] [2025-03-17 10:14:04,543 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[259403,259416] [2025-03-17 10:14:04,543 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[259568,259581] [2025-03-17 10:14:04,543 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[259726,259739] [2025-03-17 10:14:04,544 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[259884,259897] [2025-03-17 10:14:04,544 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[260042,260055] [2025-03-17 10:14:04,544 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[260202,260215] [2025-03-17 10:14:04,544 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[260361,260374] [2025-03-17 10:14:04,544 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[260500,260513] [2025-03-17 10:14:04,545 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[260642,260655] [2025-03-17 10:14:04,545 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[260791,260804] [2025-03-17 10:14:04,545 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[260930,260943] [2025-03-17 10:14:04,545 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[261085,261098] [2025-03-17 10:14:04,545 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[261245,261258] [2025-03-17 10:14:04,548 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[261396,261409] [2025-03-17 10:14:04,548 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[261547,261560] [2025-03-17 10:14:04,548 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[261699,261712] [2025-03-17 10:14:04,549 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[261848,261861] [2025-03-17 10:14:04,550 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[261996,262009] [2025-03-17 10:14:04,550 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[262153,262166] [2025-03-17 10:14:04,550 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[262302,262315] [2025-03-17 10:14:04,550 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[262458,262471] [2025-03-17 10:14:04,550 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[262611,262624] [2025-03-17 10:14:04,550 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[262757,262770] [2025-03-17 10:14:04,551 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[262900,262913] [2025-03-17 10:14:04,551 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[263052,263065] [2025-03-17 10:14:04,551 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[263198,263211] [2025-03-17 10:14:04,551 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[263343,263356] [2025-03-17 10:14:04,551 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[263497,263510] [2025-03-17 10:14:04,551 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[263648,263661] [2025-03-17 10:14:04,552 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[263803,263816] [2025-03-17 10:14:04,552 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[263955,263968] [2025-03-17 10:14:04,552 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[264110,264123] [2025-03-17 10:14:04,552 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[264274,264287] [2025-03-17 10:14:04,552 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[264430,264443] [2025-03-17 10:14:04,552 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[264594,264607] [2025-03-17 10:14:04,554 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[264736,264749] [2025-03-17 10:14:04,554 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[264894,264907] [2025-03-17 10:14:04,555 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[265061,265074] [2025-03-17 10:14:04,555 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[265220,265233] [2025-03-17 10:14:04,556 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[265379,265392] [2025-03-17 10:14:04,556 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[265528,265541] [2025-03-17 10:14:04,556 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[265675,265688] [2025-03-17 10:14:04,556 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[265814,265827] [2025-03-17 10:14:04,557 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[265977,265990] [2025-03-17 10:14:04,557 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[266143,266156] [2025-03-17 10:14:04,557 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[266307,266320] [2025-03-17 10:14:04,558 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[266472,266485] [2025-03-17 10:14:04,558 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[266637,266650] [2025-03-17 10:14:04,558 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[266803,266816] [2025-03-17 10:14:04,558 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[266968,266981] [2025-03-17 10:14:04,559 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[267135,267148] [2025-03-17 10:14:04,559 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[267295,267308] [2025-03-17 10:14:04,559 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[267457,267470] [2025-03-17 10:14:04,560 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[267616,267629] [2025-03-17 10:14:04,560 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[267762,267775] [2025-03-17 10:14:04,561 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[267905,267918] [2025-03-17 10:14:04,561 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[268049,268062] [2025-03-17 10:14:04,561 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[268192,268205] [2025-03-17 10:14:04,561 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[268336,268349] [2025-03-17 10:14:04,561 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[268477,268490] [2025-03-17 10:14:04,561 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[268615,268628] [2025-03-17 10:14:04,561 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[268773,268786] [2025-03-17 10:14:04,562 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[268932,268945] [2025-03-17 10:14:04,562 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[269088,269101] [2025-03-17 10:14:04,562 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[269237,269250] [2025-03-17 10:14:04,562 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[269389,269402] [2025-03-17 10:14:04,562 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[269540,269553] [2025-03-17 10:14:04,562 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[269689,269702] [2025-03-17 10:14:04,562 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[269841,269854] [2025-03-17 10:14:04,562 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[269989,270002] [2025-03-17 10:14:04,563 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[270142,270155] [2025-03-17 10:14:04,563 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[270293,270306] [2025-03-17 10:14:04,563 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[270443,270456] [2025-03-17 10:14:04,563 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[270590,270603] [2025-03-17 10:14:04,563 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[270741,270754] [2025-03-17 10:14:04,563 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[270892,270905] [2025-03-17 10:14:04,565 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[271040,271053] [2025-03-17 10:14:04,565 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[271206,271219] [2025-03-17 10:14:04,566 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[271375,271388] [2025-03-17 10:14:04,566 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[271542,271555] [2025-03-17 10:14:04,566 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[271710,271723] [2025-03-17 10:14:04,567 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[271860,271873] [2025-03-17 10:14:04,567 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[272007,272020] [2025-03-17 10:14:04,567 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[272168,272181] [2025-03-17 10:14:04,567 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[272338,272351] [2025-03-17 10:14:04,567 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--yurex.ko.cil.i[272500,272513] [2025-03-17 10:14:04,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:14:04,657 INFO L204 MainTranslator]: Completed translation [2025-03-17 10:14:04,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:14:04 WrapperNode [2025-03-17 10:14:04,658 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 10:14:04,660 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 10:14:04,660 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 10:14:04,660 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 10:14:04,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:14:04" (1/1) ... [2025-03-17 10:14:04,718 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:14:04" (1/1) ... [2025-03-17 10:14:04,841 INFO L138 Inliner]: procedures = 509, calls = 1274, calls flagged for inlining = 230, calls inlined = 156, statements flattened = 2802 [2025-03-17 10:14:04,842 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 10:14:04,842 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 10:14:04,842 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 10:14:04,843 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 10:14:04,851 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:14:04" (1/1) ... [2025-03-17 10:14:04,852 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:14:04" (1/1) ... [2025-03-17 10:14:04,863 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:14:04" (1/1) ... [2025-03-17 10:14:05,239 INFO L175 MemorySlicer]: Split 421 memory accesses to 12 slices as follows [4, 1, 4, 19, 34, 3, 39, 6, 1, 35, 2, 273]. 65 percent of accesses are in the largest equivalence class. The 91 initializations are split as follows [4, 0, 4, 0, 34, 0, 8, 6, 1, 0, 2, 32]. The 174 writes are split as follows [0, 1, 0, 1, 0, 0, 31, 0, 0, 30, 0, 111]. [2025-03-17 10:14:05,239 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:14:04" (1/1) ... [2025-03-17 10:14:05,239 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:14:04" (1/1) ... [2025-03-17 10:14:05,317 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:14:04" (1/1) ... [2025-03-17 10:14:05,323 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:14:04" (1/1) ... [2025-03-17 10:14:05,343 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:14:04" (1/1) ... [2025-03-17 10:14:05,354 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:14:04" (1/1) ... [2025-03-17 10:14:05,376 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 10:14:05,377 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 10:14:05,377 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 10:14:05,377 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 10:14:05,381 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:14:04" (1/1) ... [2025-03-17 10:14:05,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:14:05,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:14:05,409 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) [2025-03-17 10:14:05,414 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 [2025-03-17 10:14:05,429 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2025-03-17 10:14:05,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2025-03-17 10:14:05,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-03-17 10:14:05,430 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-03-17 10:14:05,430 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-17 10:14:05,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-17 10:14:05,430 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-03-17 10:14:05,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-03-17 10:14:05,430 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_usb_alloc_coherent [2025-03-17 10:14:05,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_usb_alloc_coherent [2025-03-17 10:14:05,430 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_usb_yurex [2025-03-17 10:14:05,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_usb_yurex [2025-03-17 10:14:05,430 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-03-17 10:14:05,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-03-17 10:14:05,430 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2025-03-17 10:14:05,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2025-03-17 10:14:05,430 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2025-03-17 10:14:05,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2025-03-17 10:14:05,430 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2025-03-17 10:14:05,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2025-03-17 10:14:05,430 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-03-17 10:14:05,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-03-17 10:14:05,430 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2025-03-17 10:14:05,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2025-03-17 10:14:05,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 10:14:05,430 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2025-03-17 10:14:05,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2025-03-17 10:14:05,430 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2025-03-17 10:14:05,430 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2025-03-17 10:14:05,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-17 10:14:05,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-17 10:14:05,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-17 10:14:05,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-17 10:14:05,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-17 10:14:05,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-17 10:14:05,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-17 10:14:05,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-17 10:14:05,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-17 10:14:05,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-17 10:14:05,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-17 10:14:05,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-17 10:14:05,431 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2025-03-17 10:14:05,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2025-03-17 10:14:05,431 INFO L130 BoogieDeclarations]: Found specification of procedure _dev_info [2025-03-17 10:14:05,431 INFO L138 BoogieDeclarations]: Found implementation of procedure _dev_info [2025-03-17 10:14:05,431 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2025-03-17 10:14:05,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2025-03-17 10:14:05,431 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-03-17 10:14:05,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-03-17 10:14:05,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 10:14:05,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 10:14:05,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 10:14:05,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 10:14:05,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 10:14:05,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 10:14:05,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-17 10:14:05,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-17 10:14:05,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-17 10:14:05,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-17 10:14:05,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-17 10:14:05,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-17 10:14:05,431 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2025-03-17 10:14:05,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2025-03-17 10:14:05,431 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2025-03-17 10:14:05,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2025-03-17 10:14:05,431 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2025-03-17 10:14:05,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2025-03-17 10:14:05,431 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2025-03-17 10:14:05,431 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2025-03-17 10:14:05,431 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2025-03-17 10:14:05,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2025-03-17 10:14:05,431 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2025-03-17 10:14:05,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2025-03-17 10:14:05,431 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_dev_dbg [2025-03-17 10:14:05,431 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_dev_dbg [2025-03-17 10:14:05,431 INFO L130 BoogieDeclarations]: Found specification of procedure kref_put [2025-03-17 10:14:05,431 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_put [2025-03-17 10:14:05,433 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-03-17 10:14:05,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-03-17 10:14:05,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 10:14:05,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 10:14:05,433 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-03-17 10:14:05,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-03-17 10:14:05,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 10:14:05,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 10:14:05,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 10:14:05,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-17 10:14:05,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-17 10:14:05,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-17 10:14:05,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-17 10:14:05,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-17 10:14:05,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-17 10:14:05,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-17 10:14:05,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-17 10:14:05,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-17 10:14:05,434 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-03-17 10:14:05,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-03-17 10:14:05,434 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2025-03-17 10:14:05,434 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2025-03-17 10:14:05,435 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2025-03-17 10:14:05,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2025-03-17 10:14:05,435 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2025-03-17 10:14:05,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2025-03-17 10:14:05,435 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_io_mutex_of_usb_yurex [2025-03-17 10:14:05,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_io_mutex_of_usb_yurex [2025-03-17 10:14:05,435 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2025-03-17 10:14:05,435 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2025-03-17 10:14:05,435 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2025-03-17 10:14:05,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2025-03-17 10:14:05,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 10:14:05,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 10:14:05,435 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2025-03-17 10:14:05,435 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2025-03-17 10:14:05,435 INFO L130 BoogieDeclarations]: Found specification of procedure kref_sub [2025-03-17 10:14:05,435 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_sub [2025-03-17 10:14:05,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-17 10:14:05,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-17 10:14:05,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-17 10:14:05,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-17 10:14:05,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-17 10:14:05,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-17 10:14:05,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-17 10:14:05,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-17 10:14:05,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-17 10:14:05,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-17 10:14:05,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-17 10:14:05,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-17 10:14:05,436 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-17 10:14:05,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-17 10:14:05,436 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-03-17 10:14:05,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-03-17 10:14:05,436 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2025-03-17 10:14:05,436 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2025-03-17 10:14:05,436 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2025-03-17 10:14:05,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2025-03-17 10:14:05,436 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_free_urb [2025-03-17 10:14:05,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_free_urb [2025-03-17 10:14:05,436 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2025-03-17 10:14:05,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2025-03-17 10:14:05,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 10:14:05,436 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2025-03-17 10:14:05,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2025-03-17 10:14:05,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 10:14:05,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 10:14:05,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 10:14:05,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-17 10:14:05,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-17 10:14:05,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-17 10:14:05,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-17 10:14:05,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-17 10:14:05,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-17 10:14:05,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-17 10:14:05,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-17 10:14:05,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-17 10:14:05,436 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_usb_free_coherent [2025-03-17 10:14:05,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_usb_free_coherent [2025-03-17 10:14:05,436 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_101 [2025-03-17 10:14:05,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_101 [2025-03-17 10:14:05,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-17 10:14:05,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-17 10:14:05,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-17 10:14:05,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-17 10:14:05,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-17 10:14:05,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-17 10:14:05,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-17 10:14:05,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-17 10:14:05,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-17 10:14:05,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-17 10:14:05,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-17 10:14:05,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-17 10:14:05,440 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2025-03-17 10:14:05,440 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2025-03-17 10:14:05,440 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-03-17 10:14:05,440 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-03-17 10:14:05,440 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2025-03-17 10:14:05,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2025-03-17 10:14:05,440 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2025-03-17 10:14:05,440 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2025-03-17 10:14:05,440 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2025-03-17 10:14:05,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2025-03-17 10:14:05,440 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-03-17 10:14:05,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-03-17 10:14:05,440 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2025-03-17 10:14:05,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2025-03-17 10:14:05,440 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_alloc_urb [2025-03-17 10:14:05,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_alloc_urb [2025-03-17 10:14:05,440 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-03-17 10:14:05,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-03-17 10:14:05,440 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-03-17 10:14:05,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-03-17 10:14:05,440 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2025-03-17 10:14:05,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2025-03-17 10:14:05,440 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2025-03-17 10:14:05,440 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2025-03-17 10:14:05,440 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2025-03-17 10:14:05,440 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2025-03-17 10:14:05,440 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-03-17 10:14:05,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-03-17 10:14:05,440 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_io_mutex_of_usb_yurex [2025-03-17 10:14:05,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_io_mutex_of_usb_yurex [2025-03-17 10:14:05,440 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-17 10:14:05,440 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-17 10:14:05,440 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-03-17 10:14:05,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-03-17 10:14:05,440 INFO L130 BoogieDeclarations]: Found specification of procedure kill_fasync [2025-03-17 10:14:05,440 INFO L138 BoogieDeclarations]: Found implementation of procedure kill_fasync [2025-03-17 10:14:05,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 10:14:05,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 10:14:05,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 10:14:05,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 10:14:05,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 10:14:05,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 10:14:05,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-17 10:14:05,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-17 10:14:05,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-17 10:14:05,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-17 10:14:05,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-17 10:14:05,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-17 10:14:05,441 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2025-03-17 10:14:05,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2025-03-17 10:14:05,441 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-17 10:14:05,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-17 10:14:05,441 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2025-03-17 10:14:05,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2025-03-17 10:14:05,441 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2025-03-17 10:14:05,441 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2025-03-17 10:14:05,441 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2025-03-17 10:14:05,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2025-03-17 10:14:05,441 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-03-17 10:14:05,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-03-17 10:14:05,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 10:14:05,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 10:14:05,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 10:14:05,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 10:14:05,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 10:14:05,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 10:14:05,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-17 10:14:05,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-17 10:14:05,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-17 10:14:05,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-17 10:14:05,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-17 10:14:05,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-17 10:14:05,445 INFO L130 BoogieDeclarations]: Found specification of procedure yurex_disconnect [2025-03-17 10:14:05,445 INFO L138 BoogieDeclarations]: Found implementation of procedure yurex_disconnect [2025-03-17 10:14:05,892 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 10:14:05,894 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 10:14:05,942 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4422: havoc dev_get_drvdata_#t~mem73#1.base, dev_get_drvdata_#t~mem73#1.offset; [2025-03-17 10:14:06,011 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-17 10:14:06,067 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4546: havoc #t~mem107;havoc #t~bitwise108; [2025-03-17 10:14:06,368 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6113: havoc ldv_usb_submit_urb_102_#t~nondet354#1; [2025-03-17 10:14:06,369 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4581: call ULTIMATE.dealloc(yurex_delete_~#descriptor~0#1.base, yurex_delete_~#descriptor~0#1.offset);havoc yurex_delete_~#descriptor~0#1.base, yurex_delete_~#descriptor~0#1.offset; [2025-03-17 10:14:06,369 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4651: call ULTIMATE.dealloc(yurex_interrupt_~#descriptor~1#1.base, yurex_interrupt_~#descriptor~1#1.offset);havoc yurex_interrupt_~#descriptor~1#1.base, yurex_interrupt_~#descriptor~1#1.offset;call ULTIMATE.dealloc(yurex_interrupt_~#descriptor___0~0#1.base, yurex_interrupt_~#descriptor___0~0#1.offset);havoc yurex_interrupt_~#descriptor___0~0#1.base, yurex_interrupt_~#descriptor___0~0#1.offset;call ULTIMATE.dealloc(yurex_interrupt_~#descriptor___1~0#1.base, yurex_interrupt_~#descriptor___1~0#1.offset);havoc yurex_interrupt_~#descriptor___1~0#1.base, yurex_interrupt_~#descriptor___1~0#1.offset; [2025-03-17 10:14:06,372 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10800: havoc #t~nondet531; [2025-03-17 10:14:06,461 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10796: havoc #t~nondet530; [2025-03-17 10:14:11,624 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10870: havoc usb_register_driver_#t~nondet539#1; [2025-03-17 10:14:11,625 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4827: call ULTIMATE.dealloc(yurex_probe_~#wait~0#1.base, yurex_probe_~#wait~0#1.offset);havoc yurex_probe_~#wait~0#1.base, yurex_probe_~#wait~0#1.offset;call ULTIMATE.dealloc(yurex_probe_~#__key~0#1.base, yurex_probe_~#__key~0#1.offset);havoc yurex_probe_~#__key~0#1.base, yurex_probe_~#__key~0#1.offset;call ULTIMATE.dealloc(yurex_probe_~#__key___0~0#1.base, yurex_probe_~#__key___0~0#1.offset);havoc yurex_probe_~#__key___0~0#1.base, yurex_probe_~#__key___0~0#1.offset;call ULTIMATE.dealloc(yurex_probe_~#__key___1~0#1.base, yurex_probe_~#__key___1~0#1.offset);havoc yurex_probe_~#__key___1~0#1.base, yurex_probe_~#__key___1~0#1.offset; [2025-03-17 10:14:11,625 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10842: havoc printk_#t~nondet534#1; [2025-03-17 10:14:11,625 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10810: havoc default_llseek_#t~nondet532#1; [2025-03-17 10:14:11,625 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4437: havoc iminor_#t~mem78#1; [2025-03-17 10:14:11,625 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10846: havoc schedule_timeout_#t~nondet535#1; [2025-03-17 10:14:11,625 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10850: havoc simple_strtoull_#t~nondet536#1; [2025-03-17 10:14:11,625 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10817: havoc fasync_helper_#t~nondet533#1; [2025-03-17 10:14:11,625 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6656: havoc ldv_linux_usb_dev_atomic_add_return_#t~mem387#1; [2025-03-17 10:14:11,625 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5108: call ULTIMATE.dealloc(yurex_read_~#in_buffer~0#1.base, yurex_read_~#in_buffer~0#1.offset);havoc yurex_read_~#in_buffer~0#1.base, yurex_read_~#in_buffer~0#1.offset; [2025-03-17 10:14:11,625 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4318: havoc usb_endpoint_dir_in_#t~mem55#1; [2025-03-17 10:14:11,626 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10859: havoc usb_find_interface_#t~ret537#1.base, usb_find_interface_#t~ret537#1.offset; [2025-03-17 10:14:11,626 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6202: havoc ldv_usb_submit_urb_108_#t~nondet364#1; [2025-03-17 10:14:11,626 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6336-1: ldv_usb_register_driver_123_#res#1 := ldv_usb_register_driver_123_~ldv_func_res~0#1; [2025-03-17 10:14:11,626 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4324: havoc usb_endpoint_xfer_int_#t~mem56#1; [2025-03-17 10:14:11,626 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10866: havoc usb_register_dev_#t~nondet538#1; [2025-03-17 10:14:11,626 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5881-1: ldv_usb_register_driver_#res#1 := ldv_usb_register_driver_~arg0#1; [2025-03-17 10:14:11,626 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6311: havoc ldv_usb_submit_urb_121_#t~nondet365#1; [2025-03-17 10:14:11,626 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5155: call ULTIMATE.dealloc(yurex_write_~#buffer~0#1.base, yurex_write_~#buffer~0#1.offset);havoc yurex_write_~#buffer~0#1.base, yurex_write_~#buffer~0#1.offset;call ULTIMATE.dealloc(yurex_write_~#wait~1#1.base, yurex_write_~#wait~1#1.offset);havoc yurex_write_~#wait~1#1.base, yurex_write_~#wait~1#1.offset;call ULTIMATE.dealloc(yurex_write_~#descriptor~2#1.base, yurex_write_~#descriptor~2#1.offset);havoc yurex_write_~#descriptor~2#1.base, yurex_write_~#descriptor~2#1.offset; [2025-03-17 10:14:11,903 INFO L? ?]: Removed 1189 outVars from TransFormulas that were not future-live. [2025-03-17 10:14:11,903 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 10:14:11,954 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 10:14:11,955 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 10:14:11,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:14:11 BoogieIcfgContainer [2025-03-17 10:14:11,955 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 10:14:11,957 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 10:14:11,957 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 10:14:11,961 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 10:14:11,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 10:14:02" (1/3) ... [2025-03-17 10:14:11,962 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e319eba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:14:11, skipping insertion in model container [2025-03-17 10:14:11,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:14:04" (2/3) ... [2025-03-17 10:14:11,962 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e319eba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:14:11, skipping insertion in model container [2025-03-17 10:14:11,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:14:11" (3/3) ... [2025-03-17 10:14:11,964 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i [2025-03-17 10:14:11,975 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 10:14:11,978 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i that has 72 procedures, 961 locations, 1 initial locations, 2 loop locations, and 33 error locations. [2025-03-17 10:14:12,057 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:14:12,067 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;@950ff26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:14:12,067 INFO L334 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2025-03-17 10:14:12,076 INFO L276 IsEmpty]: Start isEmpty. Operand has 960 states, 611 states have (on average 1.3224222585924714) internal successors, (808), 669 states have internal predecessors, (808), 245 states have call successors, (245), 71 states have call predecessors, (245), 70 states have return successors, (240), 229 states have call predecessors, (240), 240 states have call successors, (240) [2025-03-17 10:14:12,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-17 10:14:12,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:12,086 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:12,086 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 31 more)] === [2025-03-17 10:14:12,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:12,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1746194365, now seen corresponding path program 1 times [2025-03-17 10:14:12,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:12,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997075761] [2025-03-17 10:14:12,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:12,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:12,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 10:14:12,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 10:14:12,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:12,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:13,310 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 10:14:13,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:13,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997075761] [2025-03-17 10:14:13,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997075761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:13,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:13,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:14:13,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874265273] [2025-03-17 10:14:13,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:13,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:14:13,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:13,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:14:13,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:13,337 INFO L87 Difference]: Start difference. First operand has 960 states, 611 states have (on average 1.3224222585924714) internal successors, (808), 669 states have internal predecessors, (808), 245 states have call successors, (245), 71 states have call predecessors, (245), 70 states have return successors, (240), 229 states have call predecessors, (240), 240 states have call successors, (240) Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 10:14:13,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:13,534 INFO L93 Difference]: Finished difference Result 1877 states and 2613 transitions. [2025-03-17 10:14:13,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:14:13,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (11), 2 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 65 [2025-03-17 10:14:13,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:13,591 INFO L225 Difference]: With dead ends: 1877 [2025-03-17 10:14:13,591 INFO L226 Difference]: Without dead ends: 942 [2025-03-17 10:14:13,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:14:13,604 INFO L435 NwaCegarLoop]: 1241 mSDtfsCounter, 1222 mSDsluCounter, 1240 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1222 SdHoareTripleChecker+Valid, 2481 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:13,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1222 Valid, 2481 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:14:13,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2025-03-17 10:14:13,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 942. [2025-03-17 10:14:13,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 601 states have (on average 1.2512479201331115) internal successors, (752), 654 states have internal predecessors, (752), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-17 10:14:13,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1230 transitions. [2025-03-17 10:14:13,710 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1230 transitions. Word has length 65 [2025-03-17 10:14:13,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:13,713 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1230 transitions. [2025-03-17 10:14:13,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 10:14:13,714 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1230 transitions. [2025-03-17 10:14:13,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-17 10:14:13,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:13,717 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:13,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 10:14:13,717 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 31 more)] === [2025-03-17 10:14:13,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:13,718 INFO L85 PathProgramCache]: Analyzing trace with hash 877639041, now seen corresponding path program 1 times [2025-03-17 10:14:13,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:13,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367703501] [2025-03-17 10:14:13,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:13,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:14,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-17 10:14:14,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 10:14:14,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:14,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:14,583 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 10:14:14,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:14,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367703501] [2025-03-17 10:14:14,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367703501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:14,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:14,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:14:14,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689296261] [2025-03-17 10:14:14,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:14,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:14:14,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:14,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:14:14,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:14,585 INFO L87 Difference]: Start difference. First operand 942 states and 1230 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 10:14:14,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:14,696 INFO L93 Difference]: Finished difference Result 942 states and 1230 transitions. [2025-03-17 10:14:14,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:14:14,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (12), 2 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 71 [2025-03-17 10:14:14,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:14,703 INFO L225 Difference]: With dead ends: 942 [2025-03-17 10:14:14,704 INFO L226 Difference]: Without dead ends: 940 [2025-03-17 10:14:14,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:14:14,705 INFO L435 NwaCegarLoop]: 1221 mSDtfsCounter, 1201 mSDsluCounter, 1220 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1201 SdHoareTripleChecker+Valid, 2441 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:14,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1201 Valid, 2441 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:14:14,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2025-03-17 10:14:14,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 940. [2025-03-17 10:14:14,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 600 states have (on average 1.25) internal successors, (750), 652 states have internal predecessors, (750), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-17 10:14:14,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1228 transitions. [2025-03-17 10:14:14,780 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1228 transitions. Word has length 71 [2025-03-17 10:14:14,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:14,780 INFO L471 AbstractCegarLoop]: Abstraction has 940 states and 1228 transitions. [2025-03-17 10:14:14,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 10:14:14,781 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1228 transitions. [2025-03-17 10:14:14,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-17 10:14:14,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:14,782 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:14,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 10:14:14,785 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 31 more)] === [2025-03-17 10:14:14,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:14,785 INFO L85 PathProgramCache]: Analyzing trace with hash -647054939, now seen corresponding path program 1 times [2025-03-17 10:14:14,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:14,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622481889] [2025-03-17 10:14:14,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:14,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:15,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-17 10:14:15,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 10:14:15,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:15,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:15,468 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 10:14:15,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:15,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622481889] [2025-03-17 10:14:15,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622481889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:15,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:15,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:14:15,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965217877] [2025-03-17 10:14:15,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:15,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:14:15,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:15,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:14:15,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:15,471 INFO L87 Difference]: Start difference. First operand 940 states and 1228 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 10:14:15,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:15,567 INFO L93 Difference]: Finished difference Result 940 states and 1228 transitions. [2025-03-17 10:14:15,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:14:15,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (13), 2 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 77 [2025-03-17 10:14:15,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:15,576 INFO L225 Difference]: With dead ends: 940 [2025-03-17 10:14:15,577 INFO L226 Difference]: Without dead ends: 938 [2025-03-17 10:14:15,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:14:15,580 INFO L435 NwaCegarLoop]: 1219 mSDtfsCounter, 1198 mSDsluCounter, 1218 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 2437 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:15,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1198 Valid, 2437 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:14:15,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2025-03-17 10:14:15,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 938. [2025-03-17 10:14:15,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 599 states have (on average 1.2487479131886476) internal successors, (748), 650 states have internal predecessors, (748), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-17 10:14:15,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1226 transitions. [2025-03-17 10:14:15,668 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1226 transitions. Word has length 77 [2025-03-17 10:14:15,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:15,669 INFO L471 AbstractCegarLoop]: Abstraction has 938 states and 1226 transitions. [2025-03-17 10:14:15,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 10:14:15,669 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1226 transitions. [2025-03-17 10:14:15,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-17 10:14:15,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:15,673 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:15,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 10:14:15,673 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 31 more)] === [2025-03-17 10:14:15,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:15,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1912543745, now seen corresponding path program 1 times [2025-03-17 10:14:15,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:15,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072536727] [2025-03-17 10:14:15,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:15,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:16,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 10:14:16,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 10:14:16,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:16,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:16,455 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 10:14:16,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:16,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072536727] [2025-03-17 10:14:16,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072536727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:16,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:16,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:14:16,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265131984] [2025-03-17 10:14:16,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:16,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:14:16,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:16,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:14:16,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:16,458 INFO L87 Difference]: Start difference. First operand 938 states and 1226 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 10:14:16,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:16,535 INFO L93 Difference]: Finished difference Result 938 states and 1226 transitions. [2025-03-17 10:14:16,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:14:16,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (14), 2 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 83 [2025-03-17 10:14:16,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:16,541 INFO L225 Difference]: With dead ends: 938 [2025-03-17 10:14:16,541 INFO L226 Difference]: Without dead ends: 936 [2025-03-17 10:14:16,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:14:16,542 INFO L435 NwaCegarLoop]: 1217 mSDtfsCounter, 1195 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1195 SdHoareTripleChecker+Valid, 2433 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:16,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1195 Valid, 2433 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:14:16,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2025-03-17 10:14:16,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 936. [2025-03-17 10:14:16,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 936 states, 598 states have (on average 1.2474916387959867) internal successors, (746), 648 states have internal predecessors, (746), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-17 10:14:16,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1224 transitions. [2025-03-17 10:14:16,587 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1224 transitions. Word has length 83 [2025-03-17 10:14:16,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:16,588 INFO L471 AbstractCegarLoop]: Abstraction has 936 states and 1224 transitions. [2025-03-17 10:14:16,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 10:14:16,588 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1224 transitions. [2025-03-17 10:14:16,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-17 10:14:16,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:16,593 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:16,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 10:14:16,593 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 31 more)] === [2025-03-17 10:14:16,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:16,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1636544893, now seen corresponding path program 1 times [2025-03-17 10:14:16,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:16,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880941011] [2025-03-17 10:14:16,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:16,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:16,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 10:14:16,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 10:14:16,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:16,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:17,184 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 10:14:17,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:17,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880941011] [2025-03-17 10:14:17,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880941011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:17,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:17,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:14:17,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362255153] [2025-03-17 10:14:17,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:17,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:14:17,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:17,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:14:17,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:17,186 INFO L87 Difference]: Start difference. First operand 936 states and 1224 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 10:14:17,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:17,265 INFO L93 Difference]: Finished difference Result 936 states and 1224 transitions. [2025-03-17 10:14:17,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:14:17,265 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (15), 2 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 89 [2025-03-17 10:14:17,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:17,272 INFO L225 Difference]: With dead ends: 936 [2025-03-17 10:14:17,273 INFO L226 Difference]: Without dead ends: 934 [2025-03-17 10:14:17,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:14:17,275 INFO L435 NwaCegarLoop]: 1215 mSDtfsCounter, 1192 mSDsluCounter, 1214 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1192 SdHoareTripleChecker+Valid, 2429 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:17,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1192 Valid, 2429 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:14:17,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2025-03-17 10:14:17,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 934. [2025-03-17 10:14:17,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 597 states have (on average 1.2462311557788945) internal successors, (744), 646 states have internal predecessors, (744), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-17 10:14:17,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1222 transitions. [2025-03-17 10:14:17,324 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1222 transitions. Word has length 89 [2025-03-17 10:14:17,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:17,324 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1222 transitions. [2025-03-17 10:14:17,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 10:14:17,325 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1222 transitions. [2025-03-17 10:14:17,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 10:14:17,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:17,329 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:17,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 10:14:17,329 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 31 more)] === [2025-03-17 10:14:17,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:17,330 INFO L85 PathProgramCache]: Analyzing trace with hash 974915903, now seen corresponding path program 1 times [2025-03-17 10:14:17,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:17,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308504960] [2025-03-17 10:14:17,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:17,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:17,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 10:14:17,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 10:14:17,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:17,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:17,931 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 10:14:17,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:17,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308504960] [2025-03-17 10:14:17,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308504960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:17,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:17,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:14:17,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070970381] [2025-03-17 10:14:17,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:17,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:14:17,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:17,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:14:17,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:17,932 INFO L87 Difference]: Start difference. First operand 934 states and 1222 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 10:14:18,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:18,024 INFO L93 Difference]: Finished difference Result 934 states and 1222 transitions. [2025-03-17 10:14:18,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:14:18,024 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 2 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 95 [2025-03-17 10:14:18,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:18,030 INFO L225 Difference]: With dead ends: 934 [2025-03-17 10:14:18,030 INFO L226 Difference]: Without dead ends: 932 [2025-03-17 10:14:18,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:14:18,032 INFO L435 NwaCegarLoop]: 1213 mSDtfsCounter, 1189 mSDsluCounter, 1212 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1189 SdHoareTripleChecker+Valid, 2425 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:18,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1189 Valid, 2425 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:14:18,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2025-03-17 10:14:18,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 932. [2025-03-17 10:14:18,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 596 states have (on average 1.24496644295302) internal successors, (742), 644 states have internal predecessors, (742), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-17 10:14:18,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1220 transitions. [2025-03-17 10:14:18,096 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1220 transitions. Word has length 95 [2025-03-17 10:14:18,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:18,096 INFO L471 AbstractCegarLoop]: Abstraction has 932 states and 1220 transitions. [2025-03-17 10:14:18,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 10:14:18,096 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1220 transitions. [2025-03-17 10:14:18,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-17 10:14:18,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:18,097 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:18,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 10:14:18,098 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 31 more)] === [2025-03-17 10:14:18,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:18,098 INFO L85 PathProgramCache]: Analyzing trace with hash 579004959, now seen corresponding path program 1 times [2025-03-17 10:14:18,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:18,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429227844] [2025-03-17 10:14:18,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:18,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:18,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 10:14:18,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 10:14:18,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:18,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:18,779 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 10:14:18,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:18,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429227844] [2025-03-17 10:14:18,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429227844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:18,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:18,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:14:18,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461061712] [2025-03-17 10:14:18,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:18,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:14:18,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:18,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:14:18,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:18,780 INFO L87 Difference]: Start difference. First operand 932 states and 1220 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 10:14:18,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:18,853 INFO L93 Difference]: Finished difference Result 932 states and 1220 transitions. [2025-03-17 10:14:18,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:14:18,853 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (17), 2 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 101 [2025-03-17 10:14:18,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:18,858 INFO L225 Difference]: With dead ends: 932 [2025-03-17 10:14:18,858 INFO L226 Difference]: Without dead ends: 930 [2025-03-17 10:14:18,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:14:18,859 INFO L435 NwaCegarLoop]: 1211 mSDtfsCounter, 1186 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 2421 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:18,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1186 Valid, 2421 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:14:18,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2025-03-17 10:14:18,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 930. [2025-03-17 10:14:18,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 595 states have (on average 1.2436974789915967) internal successors, (740), 642 states have internal predecessors, (740), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-17 10:14:18,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1218 transitions. [2025-03-17 10:14:18,904 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1218 transitions. Word has length 101 [2025-03-17 10:14:18,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:18,904 INFO L471 AbstractCegarLoop]: Abstraction has 930 states and 1218 transitions. [2025-03-17 10:14:18,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 10:14:18,905 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1218 transitions. [2025-03-17 10:14:18,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 10:14:18,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:18,906 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:18,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 10:14:18,906 INFO L396 AbstractCegarLoop]: === Iteration 8 === 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 31 more)] === [2025-03-17 10:14:18,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:18,906 INFO L85 PathProgramCache]: Analyzing trace with hash -734621980, now seen corresponding path program 1 times [2025-03-17 10:14:18,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:18,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428417215] [2025-03-17 10:14:18,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:18,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:19,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 10:14:19,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 10:14:19,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:19,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:19,437 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 10:14:19,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:19,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428417215] [2025-03-17 10:14:19,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428417215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:19,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:19,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:14:19,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698161037] [2025-03-17 10:14:19,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:19,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:14:19,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:19,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:14:19,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:19,439 INFO L87 Difference]: Start difference. First operand 930 states and 1218 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 10:14:19,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:19,510 INFO L93 Difference]: Finished difference Result 930 states and 1218 transitions. [2025-03-17 10:14:19,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:14:19,511 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (18), 2 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 107 [2025-03-17 10:14:19,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:19,515 INFO L225 Difference]: With dead ends: 930 [2025-03-17 10:14:19,515 INFO L226 Difference]: Without dead ends: 928 [2025-03-17 10:14:19,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:14:19,516 INFO L435 NwaCegarLoop]: 1209 mSDtfsCounter, 1183 mSDsluCounter, 1208 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1183 SdHoareTripleChecker+Valid, 2417 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:19,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1183 Valid, 2417 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:14:19,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2025-03-17 10:14:19,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 928. [2025-03-17 10:14:19,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 594 states have (on average 1.2424242424242424) internal successors, (738), 640 states have internal predecessors, (738), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-17 10:14:19,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1216 transitions. [2025-03-17 10:14:19,563 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1216 transitions. Word has length 107 [2025-03-17 10:14:19,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:19,563 INFO L471 AbstractCegarLoop]: Abstraction has 928 states and 1216 transitions. [2025-03-17 10:14:19,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 10:14:19,564 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1216 transitions. [2025-03-17 10:14:19,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 10:14:19,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:19,565 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:19,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 10:14:19,565 INFO L396 AbstractCegarLoop]: === Iteration 9 === 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 31 more)] === [2025-03-17 10:14:19,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:19,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1597053152, now seen corresponding path program 1 times [2025-03-17 10:14:19,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:19,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276567029] [2025-03-17 10:14:19,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:19,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:19,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 10:14:19,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 10:14:19,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:19,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:20,131 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 10:14:20,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:20,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276567029] [2025-03-17 10:14:20,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276567029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:20,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:20,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:14:20,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514844132] [2025-03-17 10:14:20,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:20,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:14:20,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:20,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:14:20,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:20,132 INFO L87 Difference]: Start difference. First operand 928 states and 1216 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 10:14:20,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:20,221 INFO L93 Difference]: Finished difference Result 928 states and 1216 transitions. [2025-03-17 10:14:20,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:14:20,222 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (18), 2 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 109 [2025-03-17 10:14:20,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:20,227 INFO L225 Difference]: With dead ends: 928 [2025-03-17 10:14:20,228 INFO L226 Difference]: Without dead ends: 926 [2025-03-17 10:14:20,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:14:20,229 INFO L435 NwaCegarLoop]: 1207 mSDtfsCounter, 1179 mSDsluCounter, 1206 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1179 SdHoareTripleChecker+Valid, 2413 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:20,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1179 Valid, 2413 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:14:20,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2025-03-17 10:14:20,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 926. [2025-03-17 10:14:20,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 593 states have (on average 1.2411467116357504) internal successors, (736), 638 states have internal predecessors, (736), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-17 10:14:20,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1214 transitions. [2025-03-17 10:14:20,283 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1214 transitions. Word has length 109 [2025-03-17 10:14:20,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:20,284 INFO L471 AbstractCegarLoop]: Abstraction has 926 states and 1214 transitions. [2025-03-17 10:14:20,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 10:14:20,284 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1214 transitions. [2025-03-17 10:14:20,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 10:14:20,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:20,287 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:20,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 10:14:20,288 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 31 more)] === [2025-03-17 10:14:20,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:20,288 INFO L85 PathProgramCache]: Analyzing trace with hash 488688208, now seen corresponding path program 1 times [2025-03-17 10:14:20,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:20,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359617617] [2025-03-17 10:14:20,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:20,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:20,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 10:14:20,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 10:14:20,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:20,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:20,939 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 10:14:20,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:20,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359617617] [2025-03-17 10:14:20,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359617617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:20,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:20,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:14:20,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085131072] [2025-03-17 10:14:20,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:20,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:14:20,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:20,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:14:20,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:20,941 INFO L87 Difference]: Start difference. First operand 926 states and 1214 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 10:14:21,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:21,066 INFO L93 Difference]: Finished difference Result 926 states and 1214 transitions. [2025-03-17 10:14:21,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:14:21,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (19), 2 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 115 [2025-03-17 10:14:21,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:21,072 INFO L225 Difference]: With dead ends: 926 [2025-03-17 10:14:21,072 INFO L226 Difference]: Without dead ends: 924 [2025-03-17 10:14:21,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:14:21,073 INFO L435 NwaCegarLoop]: 1205 mSDtfsCounter, 1178 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1178 SdHoareTripleChecker+Valid, 2409 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:21,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1178 Valid, 2409 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:14:21,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2025-03-17 10:14:21,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 924. [2025-03-17 10:14:21,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 592 states have (on average 1.239864864864865) internal successors, (734), 636 states have internal predecessors, (734), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-17 10:14:21,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1212 transitions. [2025-03-17 10:14:21,161 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1212 transitions. Word has length 115 [2025-03-17 10:14:21,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:21,163 INFO L471 AbstractCegarLoop]: Abstraction has 924 states and 1212 transitions. [2025-03-17 10:14:21,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 10:14:21,163 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1212 transitions. [2025-03-17 10:14:21,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-17 10:14:21,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:21,165 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:21,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 10:14:21,166 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 31 more)] === [2025-03-17 10:14:21,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:21,166 INFO L85 PathProgramCache]: Analyzing trace with hash -164288002, now seen corresponding path program 1 times [2025-03-17 10:14:21,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:21,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031157418] [2025-03-17 10:14:21,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:21,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:21,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 10:14:21,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 10:14:21,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:21,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:21,752 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 10:14:21,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:21,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031157418] [2025-03-17 10:14:21,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031157418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:21,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:21,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:14:21,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628757643] [2025-03-17 10:14:21,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:21,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:14:21,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:21,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:14:21,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:21,756 INFO L87 Difference]: Start difference. First operand 924 states and 1212 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 10:14:21,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:21,843 INFO L93 Difference]: Finished difference Result 924 states and 1212 transitions. [2025-03-17 10:14:21,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:14:21,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (20), 2 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 121 [2025-03-17 10:14:21,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:21,849 INFO L225 Difference]: With dead ends: 924 [2025-03-17 10:14:21,850 INFO L226 Difference]: Without dead ends: 922 [2025-03-17 10:14:21,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:14:21,851 INFO L435 NwaCegarLoop]: 1203 mSDtfsCounter, 1175 mSDsluCounter, 1202 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1175 SdHoareTripleChecker+Valid, 2405 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:21,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1175 Valid, 2405 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:14:21,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2025-03-17 10:14:21,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 922. [2025-03-17 10:14:21,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 591 states have (on average 1.2385786802030456) internal successors, (732), 634 states have internal predecessors, (732), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-17 10:14:21,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1210 transitions. [2025-03-17 10:14:21,907 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1210 transitions. Word has length 121 [2025-03-17 10:14:21,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:21,908 INFO L471 AbstractCegarLoop]: Abstraction has 922 states and 1210 transitions. [2025-03-17 10:14:21,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 10:14:21,908 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1210 transitions. [2025-03-17 10:14:21,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-17 10:14:21,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:21,910 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:21,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 10:14:21,910 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 31 more)] === [2025-03-17 10:14:21,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:21,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1264210562, now seen corresponding path program 1 times [2025-03-17 10:14:21,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:21,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908133791] [2025-03-17 10:14:21,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:21,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:22,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-17 10:14:22,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-17 10:14:22,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:22,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:23,280 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-03-17 10:14:23,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:23,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908133791] [2025-03-17 10:14:23,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908133791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:23,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:23,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 10:14:23,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427181242] [2025-03-17 10:14:23,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:23,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:14:23,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:23,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:14:23,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:14:23,282 INFO L87 Difference]: Start difference. First operand 922 states and 1210 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 10:14:27,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 10:14:28,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:28,538 INFO L93 Difference]: Finished difference Result 1808 states and 2381 transitions. [2025-03-17 10:14:28,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:14:28,539 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 167 [2025-03-17 10:14:28,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:28,544 INFO L225 Difference]: With dead ends: 1808 [2025-03-17 10:14:28,545 INFO L226 Difference]: Without dead ends: 922 [2025-03-17 10:14:28,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 10:14:28,549 INFO L435 NwaCegarLoop]: 1201 mSDtfsCounter, 1173 mSDsluCounter, 3121 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1174 SdHoareTripleChecker+Valid, 4322 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:28,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1174 Valid, 4322 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 509 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2025-03-17 10:14:28,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2025-03-17 10:14:28,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 922. [2025-03-17 10:14:28,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 591 states have (on average 1.236886632825719) internal successors, (731), 634 states have internal predecessors, (731), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-17 10:14:28,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1209 transitions. [2025-03-17 10:14:28,614 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1209 transitions. Word has length 167 [2025-03-17 10:14:28,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:28,614 INFO L471 AbstractCegarLoop]: Abstraction has 922 states and 1209 transitions. [2025-03-17 10:14:28,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 10:14:28,615 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1209 transitions. [2025-03-17 10:14:28,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-17 10:14:28,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:28,617 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:28,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 10:14:28,617 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 31 more)] === [2025-03-17 10:14:28,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:28,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1264240353, now seen corresponding path program 1 times [2025-03-17 10:14:28,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:28,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807810877] [2025-03-17 10:14:28,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:28,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:28,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-17 10:14:28,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-17 10:14:28,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:28,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:29,303 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-03-17 10:14:29,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:29,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807810877] [2025-03-17 10:14:29,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807810877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:29,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:29,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:14:29,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419707378] [2025-03-17 10:14:29,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:29,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:14:29,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:29,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:14:29,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:29,306 INFO L87 Difference]: Start difference. First operand 922 states and 1209 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 10:14:29,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:29,383 INFO L93 Difference]: Finished difference Result 922 states and 1209 transitions. [2025-03-17 10:14:29,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:14:29,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 167 [2025-03-17 10:14:29,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:29,389 INFO L225 Difference]: With dead ends: 922 [2025-03-17 10:14:29,389 INFO L226 Difference]: Without dead ends: 920 [2025-03-17 10:14:29,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:29,390 INFO L435 NwaCegarLoop]: 1200 mSDtfsCounter, 0 mSDsluCounter, 2397 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3597 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:29,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3597 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:14:29,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2025-03-17 10:14:29,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 920. [2025-03-17 10:14:29,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 590 states have (on average 1.235593220338983) internal successors, (729), 632 states have internal predecessors, (729), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-17 10:14:29,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1207 transitions. [2025-03-17 10:14:29,450 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1207 transitions. Word has length 167 [2025-03-17 10:14:29,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:29,450 INFO L471 AbstractCegarLoop]: Abstraction has 920 states and 1207 transitions. [2025-03-17 10:14:29,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 10:14:29,451 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1207 transitions. [2025-03-17 10:14:29,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 10:14:29,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:29,453 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:29,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 10:14:29,453 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 31 more)] === [2025-03-17 10:14:29,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:29,453 INFO L85 PathProgramCache]: Analyzing trace with hash -396934056, now seen corresponding path program 1 times [2025-03-17 10:14:29,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:29,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612504000] [2025-03-17 10:14:29,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:29,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:29,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 10:14:29,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 10:14:29,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:29,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:29,993 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 10:14:29,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:29,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612504000] [2025-03-17 10:14:29,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612504000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:29,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:29,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:14:29,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76013852] [2025-03-17 10:14:29,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:29,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:14:29,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:29,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:14:29,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:29,995 INFO L87 Difference]: Start difference. First operand 920 states and 1207 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 10:14:30,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:30,083 INFO L93 Difference]: Finished difference Result 920 states and 1207 transitions. [2025-03-17 10:14:30,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:14:30,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (21), 2 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 127 [2025-03-17 10:14:30,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:30,088 INFO L225 Difference]: With dead ends: 920 [2025-03-17 10:14:30,088 INFO L226 Difference]: Without dead ends: 918 [2025-03-17 10:14:30,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:14:30,089 INFO L435 NwaCegarLoop]: 1198 mSDtfsCounter, 1169 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1169 SdHoareTripleChecker+Valid, 2395 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:30,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1169 Valid, 2395 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:14:30,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2025-03-17 10:14:30,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 918. [2025-03-17 10:14:30,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 589 states have (on average 1.234295415959253) internal successors, (727), 630 states have internal predecessors, (727), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-17 10:14:30,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1205 transitions. [2025-03-17 10:14:30,229 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1205 transitions. Word has length 127 [2025-03-17 10:14:30,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:30,229 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1205 transitions. [2025-03-17 10:14:30,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 10:14:30,230 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1205 transitions. [2025-03-17 10:14:30,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-17 10:14:30,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:30,231 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:30,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 10:14:30,232 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 31 more)] === [2025-03-17 10:14:30,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:30,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1537283498, now seen corresponding path program 1 times [2025-03-17 10:14:30,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:30,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761102779] [2025-03-17 10:14:30,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:30,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:30,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-17 10:14:30,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-17 10:14:30,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:30,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:30,839 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-03-17 10:14:30,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:30,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761102779] [2025-03-17 10:14:30,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761102779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:30,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:30,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:14:30,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705312950] [2025-03-17 10:14:30,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:30,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:14:30,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:30,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:14:30,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:14:30,841 INFO L87 Difference]: Start difference. First operand 918 states and 1205 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 10:14:30,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:30,917 INFO L93 Difference]: Finished difference Result 1796 states and 2367 transitions. [2025-03-17 10:14:30,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:14:30,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 174 [2025-03-17 10:14:30,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:30,924 INFO L225 Difference]: With dead ends: 1796 [2025-03-17 10:14:30,924 INFO L226 Difference]: Without dead ends: 914 [2025-03-17 10:14:30,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:14:30,931 INFO L435 NwaCegarLoop]: 1194 mSDtfsCounter, 1164 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1164 SdHoareTripleChecker+Valid, 1194 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:30,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1164 Valid, 1194 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:14:30,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2025-03-17 10:14:31,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 914. [2025-03-17 10:14:31,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 586 states have (on average 1.2320819112627985) internal successors, (722), 626 states have internal predecessors, (722), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-17 10:14:31,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1200 transitions. [2025-03-17 10:14:31,041 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1200 transitions. Word has length 174 [2025-03-17 10:14:31,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:31,044 INFO L471 AbstractCegarLoop]: Abstraction has 914 states and 1200 transitions. [2025-03-17 10:14:31,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 10:14:31,044 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1200 transitions. [2025-03-17 10:14:31,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-17 10:14:31,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:31,046 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:31,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 10:14:31,046 INFO L396 AbstractCegarLoop]: === Iteration 16 === 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 31 more)] === [2025-03-17 10:14:31,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:31,047 INFO L85 PathProgramCache]: Analyzing trace with hash 695368147, now seen corresponding path program 1 times [2025-03-17 10:14:31,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:31,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115280949] [2025-03-17 10:14:31,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:31,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:31,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 10:14:31,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 10:14:31,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:31,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:31,558 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 10:14:31,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:31,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115280949] [2025-03-17 10:14:31,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115280949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:31,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:31,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:14:31,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799719295] [2025-03-17 10:14:31,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:31,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:14:31,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:31,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:14:31,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:31,561 INFO L87 Difference]: Start difference. First operand 914 states and 1200 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 10:14:31,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:31,641 INFO L93 Difference]: Finished difference Result 914 states and 1200 transitions. [2025-03-17 10:14:31,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:14:31,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (22), 2 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 133 [2025-03-17 10:14:31,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:31,647 INFO L225 Difference]: With dead ends: 914 [2025-03-17 10:14:31,647 INFO L226 Difference]: Without dead ends: 912 [2025-03-17 10:14:31,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:14:31,649 INFO L435 NwaCegarLoop]: 1191 mSDtfsCounter, 1161 mSDsluCounter, 1190 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1161 SdHoareTripleChecker+Valid, 2381 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:31,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1161 Valid, 2381 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:14:31,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2025-03-17 10:14:31,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 912. [2025-03-17 10:14:31,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 585 states have (on average 1.2307692307692308) internal successors, (720), 624 states have internal predecessors, (720), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-17 10:14:31,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1198 transitions. [2025-03-17 10:14:31,731 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1198 transitions. Word has length 133 [2025-03-17 10:14:31,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:31,732 INFO L471 AbstractCegarLoop]: Abstraction has 912 states and 1198 transitions. [2025-03-17 10:14:31,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 10:14:31,732 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1198 transitions. [2025-03-17 10:14:31,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 10:14:31,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:31,734 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:31,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 10:14:31,734 INFO L396 AbstractCegarLoop]: === Iteration 17 === 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 31 more)] === [2025-03-17 10:14:31,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:31,735 INFO L85 PathProgramCache]: Analyzing trace with hash -42189126, now seen corresponding path program 1 times [2025-03-17 10:14:31,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:31,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023496322] [2025-03-17 10:14:31,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:31,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:32,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 10:14:32,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 10:14:32,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:32,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:32,243 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 10:14:32,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:32,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023496322] [2025-03-17 10:14:32,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023496322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:32,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:32,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:14:32,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762624091] [2025-03-17 10:14:32,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:32,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:14:32,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:32,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:14:32,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:32,246 INFO L87 Difference]: Start difference. First operand 912 states and 1198 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 10:14:32,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:32,335 INFO L93 Difference]: Finished difference Result 912 states and 1198 transitions. [2025-03-17 10:14:32,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:14:32,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (23), 2 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 139 [2025-03-17 10:14:32,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:32,341 INFO L225 Difference]: With dead ends: 912 [2025-03-17 10:14:32,341 INFO L226 Difference]: Without dead ends: 910 [2025-03-17 10:14:32,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:14:32,342 INFO L435 NwaCegarLoop]: 1189 mSDtfsCounter, 1158 mSDsluCounter, 1188 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1158 SdHoareTripleChecker+Valid, 2377 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:32,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1158 Valid, 2377 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:14:32,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2025-03-17 10:14:32,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 910. [2025-03-17 10:14:32,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 584 states have (on average 1.2294520547945205) internal successors, (718), 622 states have internal predecessors, (718), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-17 10:14:32,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1196 transitions. [2025-03-17 10:14:32,434 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1196 transitions. Word has length 139 [2025-03-17 10:14:32,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:32,435 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1196 transitions. [2025-03-17 10:14:32,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 10:14:32,436 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1196 transitions. [2025-03-17 10:14:32,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 10:14:32,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:32,438 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:32,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 10:14:32,439 INFO L396 AbstractCegarLoop]: === Iteration 18 === 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 31 more)] === [2025-03-17 10:14:32,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:32,439 INFO L85 PathProgramCache]: Analyzing trace with hash 136836860, now seen corresponding path program 1 times [2025-03-17 10:14:32,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:32,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302613736] [2025-03-17 10:14:32,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:32,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:32,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 10:14:32,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 10:14:32,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:32,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:33,142 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 10:14:33,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:33,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302613736] [2025-03-17 10:14:33,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302613736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:33,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:33,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:14:33,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657402088] [2025-03-17 10:14:33,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:33,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:14:33,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:33,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:14:33,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:33,145 INFO L87 Difference]: Start difference. First operand 910 states and 1196 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 10:14:33,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:33,230 INFO L93 Difference]: Finished difference Result 910 states and 1196 transitions. [2025-03-17 10:14:33,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:14:33,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (24), 2 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 145 [2025-03-17 10:14:33,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:33,236 INFO L225 Difference]: With dead ends: 910 [2025-03-17 10:14:33,236 INFO L226 Difference]: Without dead ends: 908 [2025-03-17 10:14:33,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:14:33,237 INFO L435 NwaCegarLoop]: 1187 mSDtfsCounter, 1155 mSDsluCounter, 1186 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1155 SdHoareTripleChecker+Valid, 2373 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:33,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1155 Valid, 2373 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:14:33,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2025-03-17 10:14:33,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 908. [2025-03-17 10:14:33,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 583 states have (on average 1.228130360205832) internal successors, (716), 620 states have internal predecessors, (716), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-17 10:14:33,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1194 transitions. [2025-03-17 10:14:33,301 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1194 transitions. Word has length 145 [2025-03-17 10:14:33,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:33,301 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1194 transitions. [2025-03-17 10:14:33,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 10:14:33,302 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1194 transitions. [2025-03-17 10:14:33,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-17 10:14:33,303 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:33,303 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 7, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:33,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 10:14:33,303 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 31 more)] === [2025-03-17 10:14:33,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:33,304 INFO L85 PathProgramCache]: Analyzing trace with hash 810937023, now seen corresponding path program 1 times [2025-03-17 10:14:33,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:33,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725516282] [2025-03-17 10:14:33,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:33,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:33,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-17 10:14:33,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-17 10:14:33,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:33,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:34,099 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2025-03-17 10:14:34,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:34,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725516282] [2025-03-17 10:14:34,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725516282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:34,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:34,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 10:14:34,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278752114] [2025-03-17 10:14:34,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:34,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:14:34,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:34,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:14:34,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:14:34,102 INFO L87 Difference]: Start difference. First operand 908 states and 1194 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-17 10:14:34,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:34,225 INFO L93 Difference]: Finished difference Result 1539 states and 1975 transitions. [2025-03-17 10:14:34,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:14:34,226 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) Word has length 179 [2025-03-17 10:14:34,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:34,231 INFO L225 Difference]: With dead ends: 1539 [2025-03-17 10:14:34,232 INFO L226 Difference]: Without dead ends: 913 [2025-03-17 10:14:34,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:14:34,234 INFO L435 NwaCegarLoop]: 1186 mSDtfsCounter, 0 mSDsluCounter, 4737 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5923 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:34,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5923 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:14:34,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2025-03-17 10:14:34,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 913. [2025-03-17 10:14:34,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 587 states have (on average 1.2265758091993186) internal successors, (720), 624 states have internal predecessors, (720), 240 states have call successors, (240), 70 states have call predecessors, (240), 70 states have return successors, (242), 228 states have call predecessors, (242), 238 states have call successors, (242) [2025-03-17 10:14:34,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1202 transitions. [2025-03-17 10:14:34,295 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1202 transitions. Word has length 179 [2025-03-17 10:14:34,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:34,295 INFO L471 AbstractCegarLoop]: Abstraction has 913 states and 1202 transitions. [2025-03-17 10:14:34,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-17 10:14:34,295 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1202 transitions. [2025-03-17 10:14:34,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-17 10:14:34,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:34,297 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:34,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 10:14:34,297 INFO L396 AbstractCegarLoop]: === Iteration 20 === 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 31 more)] === [2025-03-17 10:14:34,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:34,298 INFO L85 PathProgramCache]: Analyzing trace with hash 346014687, now seen corresponding path program 1 times [2025-03-17 10:14:34,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:34,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659355191] [2025-03-17 10:14:34,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:34,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:34,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-17 10:14:34,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 10:14:34,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:34,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:34,947 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 10:14:34,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:34,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659355191] [2025-03-17 10:14:34,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659355191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:34,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:34,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:14:34,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033179734] [2025-03-17 10:14:34,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:34,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:14:34,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:34,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:14:34,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:34,949 INFO L87 Difference]: Start difference. First operand 913 states and 1202 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-17 10:14:35,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:35,068 INFO L93 Difference]: Finished difference Result 913 states and 1202 transitions. [2025-03-17 10:14:35,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:14:35,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (25), 2 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 151 [2025-03-17 10:14:35,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:35,076 INFO L225 Difference]: With dead ends: 913 [2025-03-17 10:14:35,076 INFO L226 Difference]: Without dead ends: 911 [2025-03-17 10:14:35,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:14:35,079 INFO L435 NwaCegarLoop]: 1185 mSDtfsCounter, 1152 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1152 SdHoareTripleChecker+Valid, 2369 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:35,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1152 Valid, 2369 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:14:35,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2025-03-17 10:14:35,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 911. [2025-03-17 10:14:35,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 911 states, 586 states have (on average 1.2252559726962458) internal successors, (718), 622 states have internal predecessors, (718), 240 states have call successors, (240), 70 states have call predecessors, (240), 70 states have return successors, (242), 228 states have call predecessors, (242), 238 states have call successors, (242) [2025-03-17 10:14:35,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1200 transitions. [2025-03-17 10:14:35,203 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1200 transitions. Word has length 151 [2025-03-17 10:14:35,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:35,205 INFO L471 AbstractCegarLoop]: Abstraction has 911 states and 1200 transitions. [2025-03-17 10:14:35,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-17 10:14:35,206 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1200 transitions. [2025-03-17 10:14:35,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-17 10:14:35,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:35,208 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:35,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 10:14:35,208 INFO L396 AbstractCegarLoop]: === Iteration 21 === 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 31 more)] === [2025-03-17 10:14:35,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:35,208 INFO L85 PathProgramCache]: Analyzing trace with hash -586515588, now seen corresponding path program 1 times [2025-03-17 10:14:35,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:35,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558433047] [2025-03-17 10:14:35,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:35,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:35,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-17 10:14:35,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-17 10:14:35,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:35,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:35,821 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 10:14:35,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:35,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558433047] [2025-03-17 10:14:35,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558433047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:35,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:35,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:14:35,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262767188] [2025-03-17 10:14:35,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:35,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:14:35,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:35,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:14:35,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:35,825 INFO L87 Difference]: Start difference. First operand 911 states and 1200 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 10:14:35,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:35,970 INFO L93 Difference]: Finished difference Result 911 states and 1200 transitions. [2025-03-17 10:14:35,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:14:35,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (26), 2 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 157 [2025-03-17 10:14:35,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:35,975 INFO L225 Difference]: With dead ends: 911 [2025-03-17 10:14:35,975 INFO L226 Difference]: Without dead ends: 909 [2025-03-17 10:14:35,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:14:35,978 INFO L435 NwaCegarLoop]: 1183 mSDtfsCounter, 1149 mSDsluCounter, 1182 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 2365 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:35,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1149 Valid, 2365 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:14:35,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2025-03-17 10:14:36,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 909. [2025-03-17 10:14:36,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 585 states have (on average 1.223931623931624) internal successors, (716), 620 states have internal predecessors, (716), 240 states have call successors, (240), 70 states have call predecessors, (240), 70 states have return successors, (242), 228 states have call predecessors, (242), 238 states have call successors, (242) [2025-03-17 10:14:36,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1198 transitions. [2025-03-17 10:14:36,041 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1198 transitions. Word has length 157 [2025-03-17 10:14:36,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:36,042 INFO L471 AbstractCegarLoop]: Abstraction has 909 states and 1198 transitions. [2025-03-17 10:14:36,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 10:14:36,042 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1198 transitions. [2025-03-17 10:14:36,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-17 10:14:36,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:36,044 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:36,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 10:14:36,044 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_net_sock_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 31 more)] === [2025-03-17 10:14:36,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:36,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1974066162, now seen corresponding path program 1 times [2025-03-17 10:14:36,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:36,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179970194] [2025-03-17 10:14:36,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:36,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:36,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-17 10:14:36,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-17 10:14:36,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:36,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:36,558 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 10:14:36,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:36,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179970194] [2025-03-17 10:14:36,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179970194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:36,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:36,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:14:36,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049293490] [2025-03-17 10:14:36,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:36,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:14:36,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:36,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:14:36,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:36,561 INFO L87 Difference]: Start difference. First operand 909 states and 1198 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-17 10:14:36,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:36,656 INFO L93 Difference]: Finished difference Result 909 states and 1198 transitions. [2025-03-17 10:14:36,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:14:36,657 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 163 [2025-03-17 10:14:36,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:36,661 INFO L225 Difference]: With dead ends: 909 [2025-03-17 10:14:36,661 INFO L226 Difference]: Without dead ends: 907 [2025-03-17 10:14:36,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:14:36,665 INFO L435 NwaCegarLoop]: 1181 mSDtfsCounter, 1146 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1146 SdHoareTripleChecker+Valid, 2361 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:36,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1146 Valid, 2361 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:14:36,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2025-03-17 10:14:36,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 907. [2025-03-17 10:14:36,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 584 states have (on average 1.2226027397260273) internal successors, (714), 618 states have internal predecessors, (714), 240 states have call successors, (240), 70 states have call predecessors, (240), 70 states have return successors, (242), 228 states have call predecessors, (242), 238 states have call successors, (242) [2025-03-17 10:14:36,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1196 transitions. [2025-03-17 10:14:36,729 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1196 transitions. Word has length 163 [2025-03-17 10:14:36,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:36,730 INFO L471 AbstractCegarLoop]: Abstraction has 907 states and 1196 transitions. [2025-03-17 10:14:36,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-17 10:14:36,730 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1196 transitions. [2025-03-17 10:14:36,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-17 10:14:36,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:36,732 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 7, 7, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:36,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 10:14:36,733 INFO L396 AbstractCegarLoop]: === Iteration 23 === 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 31 more)] === [2025-03-17 10:14:36,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:36,733 INFO L85 PathProgramCache]: Analyzing trace with hash 114217272, now seen corresponding path program 1 times [2025-03-17 10:14:36,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:36,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814640018] [2025-03-17 10:14:36,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:36,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:37,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-17 10:14:37,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-17 10:14:37,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:37,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:37,502 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2025-03-17 10:14:37,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:37,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814640018] [2025-03-17 10:14:37,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814640018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:37,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:37,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:14:37,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124043478] [2025-03-17 10:14:37,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:37,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 10:14:37,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:37,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 10:14:37,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:14:37,504 INFO L87 Difference]: Start difference. First operand 907 states and 1196 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (29), 3 states have call predecessors, (29), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-17 10:14:37,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:37,632 INFO L93 Difference]: Finished difference Result 964 states and 1248 transitions. [2025-03-17 10:14:37,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:14:37,633 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (29), 3 states have call predecessors, (29), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 195 [2025-03-17 10:14:37,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:37,637 INFO L225 Difference]: With dead ends: 964 [2025-03-17 10:14:37,638 INFO L226 Difference]: Without dead ends: 962 [2025-03-17 10:14:37,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:14:37,639 INFO L435 NwaCegarLoop]: 1178 mSDtfsCounter, 977 mSDsluCounter, 2559 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 3737 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:37,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [978 Valid, 3737 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:14:37,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2025-03-17 10:14:37,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 958. [2025-03-17 10:14:37,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 617 states have (on average 1.2123176661264181) internal successors, (748), 650 states have internal predecessors, (748), 247 states have call successors, (247), 82 states have call predecessors, (247), 82 states have return successors, (249), 235 states have call predecessors, (249), 245 states have call successors, (249) [2025-03-17 10:14:37,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1244 transitions. [2025-03-17 10:14:37,712 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1244 transitions. Word has length 195 [2025-03-17 10:14:37,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:37,712 INFO L471 AbstractCegarLoop]: Abstraction has 958 states and 1244 transitions. [2025-03-17 10:14:37,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (29), 3 states have call predecessors, (29), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-17 10:14:37,712 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1244 transitions. [2025-03-17 10:14:37,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-17 10:14:37,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:37,714 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:37,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 10:14:37,715 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2025-03-17 10:14:37,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:37,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1847532780, now seen corresponding path program 1 times [2025-03-17 10:14:37,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:37,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428993018] [2025-03-17 10:14:37,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:37,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:38,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-17 10:14:38,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-17 10:14:38,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:38,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:38,220 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2025-03-17 10:14:38,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:38,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428993018] [2025-03-17 10:14:38,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428993018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:38,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:38,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:14:38,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482653227] [2025-03-17 10:14:38,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:38,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:14:38,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:38,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:14:38,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:14:38,223 INFO L87 Difference]: Start difference. First operand 958 states and 1244 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 10:14:38,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:38,333 INFO L93 Difference]: Finished difference Result 1729 states and 2209 transitions. [2025-03-17 10:14:38,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:14:38,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 204 [2025-03-17 10:14:38,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:38,339 INFO L225 Difference]: With dead ends: 1729 [2025-03-17 10:14:38,339 INFO L226 Difference]: Without dead ends: 954 [2025-03-17 10:14:38,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:14:38,342 INFO L435 NwaCegarLoop]: 1175 mSDtfsCounter, 1163 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1163 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:38,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1163 Valid, 1175 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:14:38,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2025-03-17 10:14:38,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 954. [2025-03-17 10:14:38,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 614 states have (on average 1.210097719869707) internal successors, (743), 646 states have internal predecessors, (743), 247 states have call successors, (247), 82 states have call predecessors, (247), 82 states have return successors, (249), 235 states have call predecessors, (249), 245 states have call successors, (249) [2025-03-17 10:14:38,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1239 transitions. [2025-03-17 10:14:38,420 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1239 transitions. Word has length 204 [2025-03-17 10:14:38,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:38,421 INFO L471 AbstractCegarLoop]: Abstraction has 954 states and 1239 transitions. [2025-03-17 10:14:38,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 10:14:38,423 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1239 transitions. [2025-03-17 10:14:38,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-17 10:14:38,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:38,425 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:38,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 10:14:38,425 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_linux_usb_coherent_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 31 more)] === [2025-03-17 10:14:38,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:38,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1277064949, now seen corresponding path program 1 times [2025-03-17 10:14:38,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:38,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52696869] [2025-03-17 10:14:38,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:38,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:38,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-17 10:14:38,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-17 10:14:38,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:38,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:38,939 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 10:14:38,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:38,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52696869] [2025-03-17 10:14:38,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52696869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:38,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:38,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:14:38,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871443414] [2025-03-17 10:14:38,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:38,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:14:38,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:38,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:14:38,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:38,941 INFO L87 Difference]: Start difference. First operand 954 states and 1239 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-17 10:14:39,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:39,135 INFO L93 Difference]: Finished difference Result 1814 states and 2347 transitions. [2025-03-17 10:14:39,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:14:39,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 169 [2025-03-17 10:14:39,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:39,144 INFO L225 Difference]: With dead ends: 1814 [2025-03-17 10:14:39,145 INFO L226 Difference]: Without dead ends: 1812 [2025-03-17 10:14:39,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:14:39,146 INFO L435 NwaCegarLoop]: 1242 mSDtfsCounter, 1134 mSDsluCounter, 2273 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1134 SdHoareTripleChecker+Valid, 3515 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:39,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1134 Valid, 3515 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:14:39,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2025-03-17 10:14:39,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1779. [2025-03-17 10:14:39,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1779 states, 1154 states have (on average 1.208838821490468) internal successors, (1395), 1202 states have internal predecessors, (1395), 454 states have call successors, (454), 159 states have call predecessors, (454), 160 states have return successors, (470), 435 states have call predecessors, (470), 452 states have call successors, (470) [2025-03-17 10:14:39,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2319 transitions. [2025-03-17 10:14:39,292 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2319 transitions. Word has length 169 [2025-03-17 10:14:39,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:39,293 INFO L471 AbstractCegarLoop]: Abstraction has 1779 states and 2319 transitions. [2025-03-17 10:14:39,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-17 10:14:39,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2319 transitions. [2025-03-17 10:14:39,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-17 10:14:39,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:39,296 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:39,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 10:14:39,296 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2025-03-17 10:14:39,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:39,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1660074893, now seen corresponding path program 1 times [2025-03-17 10:14:39,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:39,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667316771] [2025-03-17 10:14:39,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:39,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:39,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-17 10:14:39,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-17 10:14:39,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:39,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:39,944 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2025-03-17 10:14:39,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:39,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667316771] [2025-03-17 10:14:39,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667316771] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:14:39,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594332259] [2025-03-17 10:14:39,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:39,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:14:39,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:14:39,946 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:14:39,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 10:14:40,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-17 10:14:41,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-17 10:14:41,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:41,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:41,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 2273 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 10:14:41,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:14:41,331 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-03-17 10:14:41,331 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 10:14:41,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594332259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:41,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 10:14:41,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-17 10:14:41,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681485206] [2025-03-17 10:14:41,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:41,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:14:41,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:41,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:14:41,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:14:41,332 INFO L87 Difference]: Start difference. First operand 1779 states and 2319 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-17 10:14:41,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:41,493 INFO L93 Difference]: Finished difference Result 3328 states and 4280 transitions. [2025-03-17 10:14:41,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:14:41,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 210 [2025-03-17 10:14:41,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:41,502 INFO L225 Difference]: With dead ends: 3328 [2025-03-17 10:14:41,502 INFO L226 Difference]: Without dead ends: 1827 [2025-03-17 10:14:41,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:14:41,506 INFO L435 NwaCegarLoop]: 1233 mSDtfsCounter, 1107 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1107 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:41,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1107 Valid, 1298 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:14:41,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1827 states. [2025-03-17 10:14:41,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1827 to 1824. [2025-03-17 10:14:41,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1824 states, 1179 states have (on average 1.2035623409669212) internal successors, (1419), 1230 states have internal predecessors, (1419), 469 states have call successors, (469), 165 states have call predecessors, (469), 166 states have return successors, (485), 448 states have call predecessors, (485), 467 states have call successors, (485) [2025-03-17 10:14:41,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 2373 transitions. [2025-03-17 10:14:41,668 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 2373 transitions. Word has length 210 [2025-03-17 10:14:41,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:41,669 INFO L471 AbstractCegarLoop]: Abstraction has 1824 states and 2373 transitions. [2025-03-17 10:14:41,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-17 10:14:41,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2373 transitions. [2025-03-17 10:14:41,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-17 10:14:41,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:41,672 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 7, 7, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:41,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 10:14:41,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-17 10:14:41,873 INFO L396 AbstractCegarLoop]: === Iteration 27 === 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 31 more)] === [2025-03-17 10:14:41,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:41,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1406733460, now seen corresponding path program 1 times [2025-03-17 10:14:41,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:41,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457380864] [2025-03-17 10:14:41,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:41,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:42,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-17 10:14:42,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-17 10:14:42,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:42,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:42,603 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2025-03-17 10:14:42,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:42,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457380864] [2025-03-17 10:14:42,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457380864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:42,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:42,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:14:42,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871761478] [2025-03-17 10:14:42,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:42,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 10:14:42,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:42,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 10:14:42,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:14:42,605 INFO L87 Difference]: Start difference. First operand 1824 states and 2373 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-17 10:14:46,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 10:14:46,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:46,813 INFO L93 Difference]: Finished difference Result 1828 states and 2375 transitions. [2025-03-17 10:14:46,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:14:46,813 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 1 states have call successors, (29) Word has length 206 [2025-03-17 10:14:46,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:46,821 INFO L225 Difference]: With dead ends: 1828 [2025-03-17 10:14:46,821 INFO L226 Difference]: Without dead ends: 1826 [2025-03-17 10:14:46,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:14:46,822 INFO L435 NwaCegarLoop]: 1218 mSDtfsCounter, 202 mSDsluCounter, 3445 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 4663 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:46,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 4663 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-17 10:14:46,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2025-03-17 10:14:46,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1822. [2025-03-17 10:14:46,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1822 states, 1178 states have (on average 1.202037351443124) internal successors, (1416), 1228 states have internal predecessors, (1416), 469 states have call successors, (469), 165 states have call predecessors, (469), 166 states have return successors, (485), 448 states have call predecessors, (485), 467 states have call successors, (485) [2025-03-17 10:14:46,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1822 states and 2370 transitions. [2025-03-17 10:14:46,985 INFO L78 Accepts]: Start accepts. Automaton has 1822 states and 2370 transitions. Word has length 206 [2025-03-17 10:14:46,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:46,985 INFO L471 AbstractCegarLoop]: Abstraction has 1822 states and 2370 transitions. [2025-03-17 10:14:46,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-17 10:14:46,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 2370 transitions. [2025-03-17 10:14:46,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-17 10:14:46,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:46,988 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:46,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 10:14:46,988 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_linux_usb_gadget_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 31 more)] === [2025-03-17 10:14:46,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:46,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1549452454, now seen corresponding path program 1 times [2025-03-17 10:14:46,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:46,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497104724] [2025-03-17 10:14:46,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:46,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:47,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-17 10:14:47,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-17 10:14:47,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:47,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:47,496 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 10:14:47,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:47,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497104724] [2025-03-17 10:14:47,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497104724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:47,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:47,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:14:47,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679620680] [2025-03-17 10:14:47,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:47,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:14:47,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:47,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:14:47,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:47,498 INFO L87 Difference]: Start difference. First operand 1822 states and 2370 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-17 10:14:47,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:47,654 INFO L93 Difference]: Finished difference Result 1822 states and 2370 transitions. [2025-03-17 10:14:47,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:14:47,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 175 [2025-03-17 10:14:47,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:47,664 INFO L225 Difference]: With dead ends: 1822 [2025-03-17 10:14:47,664 INFO L226 Difference]: Without dead ends: 1820 [2025-03-17 10:14:47,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:14:47,665 INFO L435 NwaCegarLoop]: 1165 mSDtfsCounter, 1128 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1128 SdHoareTripleChecker+Valid, 2329 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:47,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1128 Valid, 2329 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:14:47,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1820 states. [2025-03-17 10:14:47,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1820 to 1820. [2025-03-17 10:14:47,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1820 states, 1177 states have (on average 1.2013593882752762) internal successors, (1414), 1226 states have internal predecessors, (1414), 469 states have call successors, (469), 165 states have call predecessors, (469), 166 states have return successors, (485), 448 states have call predecessors, (485), 467 states have call successors, (485) [2025-03-17 10:14:47,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1820 states to 1820 states and 2368 transitions. [2025-03-17 10:14:47,838 INFO L78 Accepts]: Start accepts. Automaton has 1820 states and 2368 transitions. Word has length 175 [2025-03-17 10:14:47,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:47,839 INFO L471 AbstractCegarLoop]: Abstraction has 1820 states and 2368 transitions. [2025-03-17 10:14:47,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-17 10:14:47,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 2368 transitions. [2025-03-17 10:14:47,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-17 10:14:47,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:47,842 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:47,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 10:14:47,843 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_linux_usb_urb_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 31 more)] === [2025-03-17 10:14:47,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:47,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1827534336, now seen corresponding path program 1 times [2025-03-17 10:14:47,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:47,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546653860] [2025-03-17 10:14:47,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:47,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:48,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-17 10:14:48,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-17 10:14:48,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:48,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:48,324 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 10:14:48,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:48,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546653860] [2025-03-17 10:14:48,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546653860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:48,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:48,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:14:48,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853854898] [2025-03-17 10:14:48,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:48,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:14:48,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:48,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:14:48,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:48,326 INFO L87 Difference]: Start difference. First operand 1820 states and 2368 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-17 10:14:48,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:48,649 INFO L93 Difference]: Finished difference Result 3515 states and 4591 transitions. [2025-03-17 10:14:48,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:14:48,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 181 [2025-03-17 10:14:48,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:48,666 INFO L225 Difference]: With dead ends: 3515 [2025-03-17 10:14:48,667 INFO L226 Difference]: Without dead ends: 3364 [2025-03-17 10:14:48,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:14:48,670 INFO L435 NwaCegarLoop]: 1320 mSDtfsCounter, 1123 mSDsluCounter, 2378 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1123 SdHoareTripleChecker+Valid, 3698 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:48,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1123 Valid, 3698 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:14:48,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3364 states. [2025-03-17 10:14:48,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3364 to 3346. [2025-03-17 10:14:48,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3346 states, 2180 states have (on average 1.2077981651376146) internal successors, (2633), 2260 states have internal predecessors, (2633), 854 states have call successors, (854), 302 states have call predecessors, (854), 304 states have return successors, (914), 819 states have call predecessors, (914), 850 states have call successors, (914) [2025-03-17 10:14:48,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3346 states to 3346 states and 4401 transitions. [2025-03-17 10:14:48,945 INFO L78 Accepts]: Start accepts. Automaton has 3346 states and 4401 transitions. Word has length 181 [2025-03-17 10:14:48,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:48,945 INFO L471 AbstractCegarLoop]: Abstraction has 3346 states and 4401 transitions. [2025-03-17 10:14:48,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-17 10:14:48,945 INFO L276 IsEmpty]: Start isEmpty. Operand 3346 states and 4401 transitions. [2025-03-17 10:14:48,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-17 10:14:48,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:48,948 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:48,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 10:14:48,948 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_assert_linux_kernel_locking_spinlock__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 31 more)] === [2025-03-17 10:14:48,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:48,948 INFO L85 PathProgramCache]: Analyzing trace with hash -966219088, now seen corresponding path program 1 times [2025-03-17 10:14:48,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:48,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000991527] [2025-03-17 10:14:48,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:48,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:49,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-17 10:14:49,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-17 10:14:49,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:49,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:49,657 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 413 trivial. 0 not checked. [2025-03-17 10:14:49,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:49,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000991527] [2025-03-17 10:14:49,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000991527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:49,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:49,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:14:49,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36682187] [2025-03-17 10:14:49,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:49,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 10:14:49,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:49,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 10:14:49,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:14:49,659 INFO L87 Difference]: Start difference. First operand 3346 states and 4401 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (32), 3 states have call predecessors, (32), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-17 10:14:49,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:49,949 INFO L93 Difference]: Finished difference Result 3402 states and 4441 transitions. [2025-03-17 10:14:49,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:14:49,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (32), 3 states have call predecessors, (32), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 220 [2025-03-17 10:14:49,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:49,965 INFO L225 Difference]: With dead ends: 3402 [2025-03-17 10:14:49,965 INFO L226 Difference]: Without dead ends: 3400 [2025-03-17 10:14:49,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:14:49,969 INFO L435 NwaCegarLoop]: 1161 mSDtfsCounter, 1051 mSDsluCounter, 2361 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1052 SdHoareTripleChecker+Valid, 3522 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:49,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1052 Valid, 3522 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:14:49,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3400 states. [2025-03-17 10:14:50,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3400 to 3400. [2025-03-17 10:14:50,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3400 states, 2219 states have (on average 1.2005407841369986) internal successors, (2664), 2298 states have internal predecessors, (2664), 854 states have call successors, (854), 318 states have call predecessors, (854), 320 states have return successors, (914), 819 states have call predecessors, (914), 850 states have call successors, (914) [2025-03-17 10:14:50,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3400 states to 3400 states and 4432 transitions. [2025-03-17 10:14:50,446 INFO L78 Accepts]: Start accepts. Automaton has 3400 states and 4432 transitions. Word has length 220 [2025-03-17 10:14:50,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:50,447 INFO L471 AbstractCegarLoop]: Abstraction has 3400 states and 4432 transitions. [2025-03-17 10:14:50,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (32), 3 states have call predecessors, (32), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-17 10:14:50,447 INFO L276 IsEmpty]: Start isEmpty. Operand 3400 states and 4432 transitions. [2025-03-17 10:14:50,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-17 10:14:50,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:50,450 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:50,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 10:14:50,450 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2025-03-17 10:14:50,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:50,451 INFO L85 PathProgramCache]: Analyzing trace with hash 514820113, now seen corresponding path program 1 times [2025-03-17 10:14:50,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:50,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785082999] [2025-03-17 10:14:50,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:50,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:50,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-17 10:14:50,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-17 10:14:50,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:50,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:51,152 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2025-03-17 10:14:51,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:51,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785082999] [2025-03-17 10:14:51,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785082999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:51,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:51,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:14:51,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246650701] [2025-03-17 10:14:51,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:51,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:14:51,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:51,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:14:51,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:51,154 INFO L87 Difference]: Start difference. First operand 3400 states and 4432 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-17 10:14:51,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:51,515 INFO L93 Difference]: Finished difference Result 6303 states and 8178 transitions. [2025-03-17 10:14:51,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:14:51,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 219 [2025-03-17 10:14:51,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:51,527 INFO L225 Difference]: With dead ends: 6303 [2025-03-17 10:14:51,527 INFO L226 Difference]: Without dead ends: 3408 [2025-03-17 10:14:51,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:51,533 INFO L435 NwaCegarLoop]: 1163 mSDtfsCounter, 0 mSDsluCounter, 2321 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3484 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:51,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3484 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:14:51,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3408 states. [2025-03-17 10:14:51,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3408 to 3408. [2025-03-17 10:14:51,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3408 states, 2227 states have (on average 1.199820386169735) internal successors, (2672), 2306 states have internal predecessors, (2672), 854 states have call successors, (854), 318 states have call predecessors, (854), 320 states have return successors, (914), 819 states have call predecessors, (914), 850 states have call successors, (914) [2025-03-17 10:14:51,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3408 states to 3408 states and 4440 transitions. [2025-03-17 10:14:51,823 INFO L78 Accepts]: Start accepts. Automaton has 3408 states and 4440 transitions. Word has length 219 [2025-03-17 10:14:51,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:51,824 INFO L471 AbstractCegarLoop]: Abstraction has 3408 states and 4440 transitions. [2025-03-17 10:14:51,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-17 10:14:51,826 INFO L276 IsEmpty]: Start isEmpty. Operand 3408 states and 4440 transitions. [2025-03-17 10:14:51,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-17 10:14:51,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:51,828 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:51,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 10:14:51,828 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2025-03-17 10:14:51,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:51,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1073527789, now seen corresponding path program 1 times [2025-03-17 10:14:51,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:51,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103428861] [2025-03-17 10:14:51,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:51,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:52,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-17 10:14:52,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-17 10:14:52,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:52,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:53,232 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 9 proven. 28 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2025-03-17 10:14:53,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:53,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103428861] [2025-03-17 10:14:53,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103428861] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:14:53,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353846081] [2025-03-17 10:14:53,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:53,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:14:53,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:14:53,235 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:14:53,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 10:14:54,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-17 10:14:54,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-17 10:14:54,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:54,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:54,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 2444 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 10:14:54,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:14:54,735 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2025-03-17 10:14:54,735 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 10:14:54,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353846081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:54,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 10:14:54,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 20 [2025-03-17 10:14:54,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486997701] [2025-03-17 10:14:54,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:54,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 10:14:54,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:54,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 10:14:54,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2025-03-17 10:14:54,738 INFO L87 Difference]: Start difference. First operand 3408 states and 4440 transitions. Second operand has 10 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 5 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (29), 5 states have call predecessors, (29), 5 states have call successors, (29) [2025-03-17 10:14:55,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:55,504 INFO L93 Difference]: Finished difference Result 6158 states and 7887 transitions. [2025-03-17 10:14:55,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 10:14:55,504 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 5 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (29), 5 states have call predecessors, (29), 5 states have call successors, (29) Word has length 219 [2025-03-17 10:14:55,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:55,517 INFO L225 Difference]: With dead ends: 6158 [2025-03-17 10:14:55,517 INFO L226 Difference]: Without dead ends: 3605 [2025-03-17 10:14:55,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=538, Unknown=0, NotChecked=0, Total=600 [2025-03-17 10:14:55,524 INFO L435 NwaCegarLoop]: 1186 mSDtfsCounter, 29 mSDsluCounter, 9383 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 10569 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:55,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 10569 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 10:14:55,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3605 states. [2025-03-17 10:14:55,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3605 to 3432. [2025-03-17 10:14:55,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3432 states, 2243 states have (on average 1.1983950066874722) internal successors, (2688), 2322 states have internal predecessors, (2688), 862 states have call successors, (862), 318 states have call predecessors, (862), 320 states have return successors, (922), 827 states have call predecessors, (922), 858 states have call successors, (922) [2025-03-17 10:14:55,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3432 states to 3432 states and 4472 transitions. [2025-03-17 10:14:55,821 INFO L78 Accepts]: Start accepts. Automaton has 3432 states and 4472 transitions. Word has length 219 [2025-03-17 10:14:55,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:55,821 INFO L471 AbstractCegarLoop]: Abstraction has 3432 states and 4472 transitions. [2025-03-17 10:14:55,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 5 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (29), 5 states have call predecessors, (29), 5 states have call successors, (29) [2025-03-17 10:14:55,821 INFO L276 IsEmpty]: Start isEmpty. Operand 3432 states and 4472 transitions. [2025-03-17 10:14:55,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-17 10:14:55,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:55,823 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:55,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 10:14:56,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-03-17 10:14:56,024 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2025-03-17 10:14:56,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:56,024 INFO L85 PathProgramCache]: Analyzing trace with hash -777157012, now seen corresponding path program 1 times [2025-03-17 10:14:56,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:56,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349798607] [2025-03-17 10:14:56,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:56,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:56,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-17 10:14:56,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-17 10:14:56,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:56,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:56,471 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-17 10:14:56,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:56,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349798607] [2025-03-17 10:14:56,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349798607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:56,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:56,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:14:56,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186844589] [2025-03-17 10:14:56,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:56,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:14:56,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:56,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:14:56,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:14:56,472 INFO L87 Difference]: Start difference. First operand 3432 states and 4472 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 3 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2025-03-17 10:14:57,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:57,087 INFO L93 Difference]: Finished difference Result 6361 states and 8190 transitions. [2025-03-17 10:14:57,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:14:57,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 3 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 231 [2025-03-17 10:14:57,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:57,101 INFO L225 Difference]: With dead ends: 6361 [2025-03-17 10:14:57,102 INFO L226 Difference]: Without dead ends: 3433 [2025-03-17 10:14:57,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:14:57,111 INFO L435 NwaCegarLoop]: 1164 mSDtfsCounter, 0 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2303 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:57,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2303 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 10:14:57,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3433 states. [2025-03-17 10:14:57,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3433 to 3433. [2025-03-17 10:14:57,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3433 states, 2244 states have (on average 1.1983065953654188) internal successors, (2689), 2322 states have internal predecessors, (2689), 862 states have call successors, (862), 318 states have call predecessors, (862), 320 states have return successors, (922), 828 states have call predecessors, (922), 858 states have call successors, (922) [2025-03-17 10:14:57,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3433 states to 3433 states and 4473 transitions. [2025-03-17 10:14:57,396 INFO L78 Accepts]: Start accepts. Automaton has 3433 states and 4473 transitions. Word has length 231 [2025-03-17 10:14:57,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:57,397 INFO L471 AbstractCegarLoop]: Abstraction has 3433 states and 4473 transitions. [2025-03-17 10:14:57,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 3 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2025-03-17 10:14:57,397 INFO L276 IsEmpty]: Start isEmpty. Operand 3433 states and 4473 transitions. [2025-03-17 10:14:57,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-03-17 10:14:57,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:57,399 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:57,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-17 10:14:57,399 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2025-03-17 10:14:57,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:57,399 INFO L85 PathProgramCache]: Analyzing trace with hash 506122127, now seen corresponding path program 1 times [2025-03-17 10:14:57,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:57,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731919885] [2025-03-17 10:14:57,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:57,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:57,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-17 10:14:57,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-17 10:14:57,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:57,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:58,403 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-17 10:14:58,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:58,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731919885] [2025-03-17 10:14:58,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731919885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:58,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:58,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:14:58,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605717775] [2025-03-17 10:14:58,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:58,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 10:14:58,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:58,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 10:14:58,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:14:58,405 INFO L87 Difference]: Start difference. First operand 3433 states and 4473 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2025-03-17 10:15:02,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 10:15:04,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:15:04,586 INFO L93 Difference]: Finished difference Result 9679 states and 12692 transitions. [2025-03-17 10:15:04,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:15:04,586 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 237 [2025-03-17 10:15:04,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:15:04,611 INFO L225 Difference]: With dead ends: 9679 [2025-03-17 10:15:04,611 INFO L226 Difference]: Without dead ends: 6752 [2025-03-17 10:15:04,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:15:04,622 INFO L435 NwaCegarLoop]: 2236 mSDtfsCounter, 2187 mSDsluCounter, 3554 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2187 SdHoareTripleChecker+Valid, 5790 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2025-03-17 10:15:04,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2187 Valid, 5790 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 970 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2025-03-17 10:15:04,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6752 states. [2025-03-17 10:15:05,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6752 to 6320. [2025-03-17 10:15:05,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6320 states, 4162 states have (on average 1.207352234502643) internal successors, (5025), 4308 states have internal predecessors, (5025), 1573 states have call successors, (1573), 572 states have call predecessors, (1573), 578 states have return successors, (1760), 1507 states have call predecessors, (1760), 1569 states have call successors, (1760) [2025-03-17 10:15:05,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6320 states to 6320 states and 8358 transitions. [2025-03-17 10:15:05,238 INFO L78 Accepts]: Start accepts. Automaton has 6320 states and 8358 transitions. Word has length 237 [2025-03-17 10:15:05,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:15:05,239 INFO L471 AbstractCegarLoop]: Abstraction has 6320 states and 8358 transitions. [2025-03-17 10:15:05,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2025-03-17 10:15:05,239 INFO L276 IsEmpty]: Start isEmpty. Operand 6320 states and 8358 transitions. [2025-03-17 10:15:05,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-03-17 10:15:05,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:15:05,241 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:15:05,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-17 10:15:05,241 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2025-03-17 10:15:05,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:15:05,242 INFO L85 PathProgramCache]: Analyzing trace with hash 57425488, now seen corresponding path program 1 times [2025-03-17 10:15:05,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:15:05,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885391606] [2025-03-17 10:15:05,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:15:05,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:15:05,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-17 10:15:05,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-17 10:15:05,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:15:05,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:15:06,283 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-17 10:15:06,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:15:06,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885391606] [2025-03-17 10:15:06,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885391606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:15:06,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:15:06,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 10:15:06,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265481752] [2025-03-17 10:15:06,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:15:06,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 10:15:06,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:15:06,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 10:15:06,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:15:06,284 INFO L87 Difference]: Start difference. First operand 6320 states and 8358 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 6 states have internal predecessors, (93), 3 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (26), 4 states have call predecessors, (26), 3 states have call successors, (26) [2025-03-17 10:15:07,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:15:07,125 INFO L93 Difference]: Finished difference Result 12538 states and 16577 transitions. [2025-03-17 10:15:07,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 10:15:07,126 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 6 states have internal predecessors, (93), 3 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (26), 4 states have call predecessors, (26), 3 states have call successors, (26) Word has length 237 [2025-03-17 10:15:07,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:15:07,156 INFO L225 Difference]: With dead ends: 12538 [2025-03-17 10:15:07,156 INFO L226 Difference]: Without dead ends: 6329 [2025-03-17 10:15:07,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:15:07,173 INFO L435 NwaCegarLoop]: 1159 mSDtfsCounter, 1 mSDsluCounter, 5768 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6927 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 10:15:07,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6927 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 10:15:07,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6329 states. [2025-03-17 10:15:07,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6329 to 6327. [2025-03-17 10:15:07,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6327 states, 4167 states have (on average 1.2071034317254619) internal successors, (5030), 4313 states have internal predecessors, (5030), 1574 states have call successors, (1574), 572 states have call predecessors, (1574), 579 states have return successors, (1762), 1509 states have call predecessors, (1762), 1570 states have call successors, (1762) [2025-03-17 10:15:07,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6327 states to 6327 states and 8366 transitions. [2025-03-17 10:15:07,839 INFO L78 Accepts]: Start accepts. Automaton has 6327 states and 8366 transitions. Word has length 237 [2025-03-17 10:15:07,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:15:07,839 INFO L471 AbstractCegarLoop]: Abstraction has 6327 states and 8366 transitions. [2025-03-17 10:15:07,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 6 states have internal predecessors, (93), 3 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (26), 4 states have call predecessors, (26), 3 states have call successors, (26) [2025-03-17 10:15:07,839 INFO L276 IsEmpty]: Start isEmpty. Operand 6327 states and 8366 transitions. [2025-03-17 10:15:07,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-03-17 10:15:07,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:15:07,842 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:15:07,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-17 10:15:07,842 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2025-03-17 10:15:07,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:15:07,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1961321570, now seen corresponding path program 1 times [2025-03-17 10:15:07,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:15:07,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938214492] [2025-03-17 10:15:07,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:15:07,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:15:08,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-03-17 10:15:08,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-03-17 10:15:08,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:15:08,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:15:08,984 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2025-03-17 10:15:08,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:15:08,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938214492] [2025-03-17 10:15:08,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938214492] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:15:08,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635125096] [2025-03-17 10:15:08,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:15:08,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:15:08,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:15:08,987 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:15:08,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 10:15:10,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-03-17 10:15:10,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-03-17 10:15:10,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:15:10,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:15:10,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 2763 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-17 10:15:10,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:15:10,700 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 289 proven. 3 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2025-03-17 10:15:10,700 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:15:11,107 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 18 proven. 45 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2025-03-17 10:15:11,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635125096] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:15:11,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:15:11,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 8] total 16 [2025-03-17 10:15:11,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011209080] [2025-03-17 10:15:11,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:15:11,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 10:15:11,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:15:11,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 10:15:11,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-03-17 10:15:11,109 INFO L87 Difference]: Start difference. First operand 6327 states and 8366 transitions. Second operand has 16 states, 15 states have (on average 11.6) internal successors, (174), 14 states have internal predecessors, (174), 6 states have call successors, (66), 2 states have call predecessors, (66), 5 states have return successors, (65), 7 states have call predecessors, (65), 6 states have call successors, (65)