./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--atm--fore_200e.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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--atm--fore_200e.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 6e98c668899fc19a628c1d936389b59135bc3426718905326099068187537de8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 05:48:43,258 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 05:48:43,311 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 05:48:43,316 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 05:48:43,316 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 05:48:43,334 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 05:48:43,334 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 05:48:43,334 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 05:48:43,335 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 05:48:43,335 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 05:48:43,335 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 05:48:43,335 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 05:48:43,335 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 05:48:43,335 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 05:48:43,335 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 05:48:43,335 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 05:48:43,335 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 05:48:43,336 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 05:48:43,336 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 05:48:43,336 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 05:48:43,336 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 05:48:43,336 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 05:48:43,336 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 05:48:43,336 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 05:48:43,336 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 05:48:43,336 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 05:48:43,336 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 05:48:43,336 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 05:48:43,336 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 05:48:43,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 05:48:43,336 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 05:48:43,336 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 05:48:43,336 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 05:48:43,336 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 05:48:43,336 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 05:48:43,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 05:48:43,336 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 05:48:43,336 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 05:48:43,336 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 05:48:43,337 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 05:48:43,337 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 -> 6e98c668899fc19a628c1d936389b59135bc3426718905326099068187537de8 [2025-03-04 05:48:43,579 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 05:48:43,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 05:48:43,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 05:48:43,588 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 05:48:43,588 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 05:48:43,589 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--atm--fore_200e.ko.cil.i [2025-03-04 05:48:44,876 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cac5aaa2/674bc45aca484331abd8677413e7038f/FLAGcdd7c3541 [2025-03-04 05:48:45,530 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 05:48:45,530 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i [2025-03-04 05:48:45,584 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cac5aaa2/674bc45aca484331abd8677413e7038f/FLAGcdd7c3541 [2025-03-04 05:48:45,599 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cac5aaa2/674bc45aca484331abd8677413e7038f [2025-03-04 05:48:45,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 05:48:45,602 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 05:48:45,603 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 05:48:45,603 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 05:48:45,606 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 05:48:45,608 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 05:48:45" (1/1) ... [2025-03-04 05:48:45,610 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53b94d1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:48:45, skipping insertion in model container [2025-03-04 05:48:45,610 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 05:48:45" (1/1) ... [2025-03-04 05:48:45,709 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 05:48:50,126 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--atm--fore_200e.ko.cil.i[477597,477610] [2025-03-04 05:48:50,129 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--atm--fore_200e.ko.cil.i[477742,477755] [2025-03-04 05:48:50,129 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--atm--fore_200e.ko.cil.i[477888,477901] [2025-03-04 05:48:50,130 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--atm--fore_200e.ko.cil.i[478053,478066] [2025-03-04 05:48:50,130 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--atm--fore_200e.ko.cil.i[478211,478224] [2025-03-04 05:48:50,130 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--atm--fore_200e.ko.cil.i[478369,478382] [2025-03-04 05:48:50,130 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--atm--fore_200e.ko.cil.i[478527,478540] [2025-03-04 05:48:50,131 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--atm--fore_200e.ko.cil.i[478687,478700] [2025-03-04 05:48:50,131 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--atm--fore_200e.ko.cil.i[478846,478859] [2025-03-04 05:48:50,131 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--atm--fore_200e.ko.cil.i[478985,478998] [2025-03-04 05:48:50,131 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--atm--fore_200e.ko.cil.i[479127,479140] [2025-03-04 05:48:50,131 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--atm--fore_200e.ko.cil.i[479276,479289] [2025-03-04 05:48:50,132 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--atm--fore_200e.ko.cil.i[479415,479428] [2025-03-04 05:48:50,132 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--atm--fore_200e.ko.cil.i[479570,479583] [2025-03-04 05:48:50,132 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--atm--fore_200e.ko.cil.i[479730,479743] [2025-03-04 05:48:50,132 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--atm--fore_200e.ko.cil.i[479881,479894] [2025-03-04 05:48:50,132 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--atm--fore_200e.ko.cil.i[480032,480045] [2025-03-04 05:48:50,133 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--atm--fore_200e.ko.cil.i[480184,480197] [2025-03-04 05:48:50,133 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--atm--fore_200e.ko.cil.i[480333,480346] [2025-03-04 05:48:50,133 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--atm--fore_200e.ko.cil.i[480481,480494] [2025-03-04 05:48:50,133 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--atm--fore_200e.ko.cil.i[480638,480651] [2025-03-04 05:48:50,133 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--atm--fore_200e.ko.cil.i[480787,480800] [2025-03-04 05:48:50,133 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--atm--fore_200e.ko.cil.i[480943,480956] [2025-03-04 05:48:50,134 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--atm--fore_200e.ko.cil.i[481096,481109] [2025-03-04 05:48:50,134 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--atm--fore_200e.ko.cil.i[481242,481255] [2025-03-04 05:48:50,134 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--atm--fore_200e.ko.cil.i[481385,481398] [2025-03-04 05:48:50,134 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--atm--fore_200e.ko.cil.i[481537,481550] [2025-03-04 05:48:50,134 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--atm--fore_200e.ko.cil.i[481683,481696] [2025-03-04 05:48:50,134 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--atm--fore_200e.ko.cil.i[481828,481841] [2025-03-04 05:48:50,135 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--atm--fore_200e.ko.cil.i[481982,481995] [2025-03-04 05:48:50,135 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--atm--fore_200e.ko.cil.i[482133,482146] [2025-03-04 05:48:50,135 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--atm--fore_200e.ko.cil.i[482288,482301] [2025-03-04 05:48:50,135 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--atm--fore_200e.ko.cil.i[482440,482453] [2025-03-04 05:48:50,136 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--atm--fore_200e.ko.cil.i[482595,482608] [2025-03-04 05:48:50,136 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--atm--fore_200e.ko.cil.i[482759,482772] [2025-03-04 05:48:50,136 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--atm--fore_200e.ko.cil.i[482915,482928] [2025-03-04 05:48:50,136 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--atm--fore_200e.ko.cil.i[483079,483092] [2025-03-04 05:48:50,136 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--atm--fore_200e.ko.cil.i[483221,483234] [2025-03-04 05:48:50,137 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--atm--fore_200e.ko.cil.i[483379,483392] [2025-03-04 05:48:50,137 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--atm--fore_200e.ko.cil.i[483546,483559] [2025-03-04 05:48:50,137 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--atm--fore_200e.ko.cil.i[483705,483718] [2025-03-04 05:48:50,137 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--atm--fore_200e.ko.cil.i[483864,483877] [2025-03-04 05:48:50,137 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--atm--fore_200e.ko.cil.i[484013,484026] [2025-03-04 05:48:50,138 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--atm--fore_200e.ko.cil.i[484160,484173] [2025-03-04 05:48:50,138 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--atm--fore_200e.ko.cil.i[484299,484312] [2025-03-04 05:48:50,138 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--atm--fore_200e.ko.cil.i[484462,484475] [2025-03-04 05:48:50,138 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--atm--fore_200e.ko.cil.i[484628,484641] [2025-03-04 05:48:50,138 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--atm--fore_200e.ko.cil.i[484792,484805] [2025-03-04 05:48:50,139 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--atm--fore_200e.ko.cil.i[484957,484970] [2025-03-04 05:48:50,139 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--atm--fore_200e.ko.cil.i[485122,485135] [2025-03-04 05:48:50,139 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--atm--fore_200e.ko.cil.i[485288,485301] [2025-03-04 05:48:50,139 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--atm--fore_200e.ko.cil.i[485453,485466] [2025-03-04 05:48:50,139 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--atm--fore_200e.ko.cil.i[485620,485633] [2025-03-04 05:48:50,140 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--atm--fore_200e.ko.cil.i[485780,485793] [2025-03-04 05:48:50,140 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--atm--fore_200e.ko.cil.i[485942,485955] [2025-03-04 05:48:50,140 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--atm--fore_200e.ko.cil.i[486101,486114] [2025-03-04 05:48:50,140 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--atm--fore_200e.ko.cil.i[486247,486260] [2025-03-04 05:48:50,140 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--atm--fore_200e.ko.cil.i[486390,486403] [2025-03-04 05:48:50,141 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--atm--fore_200e.ko.cil.i[486534,486547] [2025-03-04 05:48:50,141 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--atm--fore_200e.ko.cil.i[486677,486690] [2025-03-04 05:48:50,141 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--atm--fore_200e.ko.cil.i[486821,486834] [2025-03-04 05:48:50,141 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--atm--fore_200e.ko.cil.i[486962,486975] [2025-03-04 05:48:50,141 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--atm--fore_200e.ko.cil.i[487100,487113] [2025-03-04 05:48:50,142 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--atm--fore_200e.ko.cil.i[487258,487271] [2025-03-04 05:48:50,142 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--atm--fore_200e.ko.cil.i[487417,487430] [2025-03-04 05:48:50,142 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--atm--fore_200e.ko.cil.i[487573,487586] [2025-03-04 05:48:50,142 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--atm--fore_200e.ko.cil.i[487722,487735] [2025-03-04 05:48:50,142 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--atm--fore_200e.ko.cil.i[487874,487887] [2025-03-04 05:48:50,143 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--atm--fore_200e.ko.cil.i[488025,488038] [2025-03-04 05:48:50,143 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--atm--fore_200e.ko.cil.i[488174,488187] [2025-03-04 05:48:50,143 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--atm--fore_200e.ko.cil.i[488326,488339] [2025-03-04 05:48:50,143 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--atm--fore_200e.ko.cil.i[488474,488487] [2025-03-04 05:48:50,143 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--atm--fore_200e.ko.cil.i[488627,488640] [2025-03-04 05:48:50,143 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--atm--fore_200e.ko.cil.i[488778,488791] [2025-03-04 05:48:50,143 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--atm--fore_200e.ko.cil.i[488928,488941] [2025-03-04 05:48:50,144 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--atm--fore_200e.ko.cil.i[489075,489088] [2025-03-04 05:48:50,144 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--atm--fore_200e.ko.cil.i[489226,489239] [2025-03-04 05:48:50,144 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--atm--fore_200e.ko.cil.i[489377,489390] [2025-03-04 05:48:50,144 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--atm--fore_200e.ko.cil.i[489525,489538] [2025-03-04 05:48:50,144 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--atm--fore_200e.ko.cil.i[489691,489704] [2025-03-04 05:48:50,144 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--atm--fore_200e.ko.cil.i[489860,489873] [2025-03-04 05:48:50,144 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--atm--fore_200e.ko.cil.i[490027,490040] [2025-03-04 05:48:50,145 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--atm--fore_200e.ko.cil.i[490195,490208] [2025-03-04 05:48:50,145 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--atm--fore_200e.ko.cil.i[490345,490358] [2025-03-04 05:48:50,145 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--atm--fore_200e.ko.cil.i[490492,490505] [2025-03-04 05:48:50,145 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--atm--fore_200e.ko.cil.i[490653,490666] [2025-03-04 05:48:50,145 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--atm--fore_200e.ko.cil.i[490823,490836] [2025-03-04 05:48:50,145 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--atm--fore_200e.ko.cil.i[490985,490998] [2025-03-04 05:48:50,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 05:48:50,180 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 05:48:50,286 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; bts %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [7322] [2025-03-04 05:48:50,287 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [7329] [2025-03-04 05:48:50,288 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("":); [7336] [2025-03-04 05:48:50,289 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"./arch/x86/include/asm/paravirt.h"), "i" (804), "i" (12UL)); [7387-7388] [2025-03-04 05:48:50,289 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("771:\n\tcall *%c2;\n772:\n.pushsection .parainstructions,\"a\"\n .balign 8 \n .quad 771b\n .byte %c1\n .byte 772b-771b\n .short %c3\n.popsection\n": "=a" (__eax): [paravirt_typenum] "i" (44UL), [paravirt_opptr] "i" (& pv_irq_ops.save_fl.func), [paravirt_clobber] "i" (1): "memory", "cc"); [7393-7395] [2025-03-04 05:48:50,291 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("movl %1,%0": "=r" (ret): "m" (*((unsigned int volatile *)addr)): "memory"); [7482] [2025-03-04 05:48:50,292 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("movl %0,%1": : "r" (val), "m" (*((unsigned int volatile *)addr)): "memory"); [7489] [2025-03-04 05:48:50,300 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"include/asm-generic/dma-mapping-common.h"), "i" (19), "i" (12UL)); [7609-7610] [2025-03-04 05:48:50,302 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"include/asm-generic/dma-mapping-common.h"), "i" (36), "i" (12UL)); [7643-7644] [2025-03-04 05:48:50,303 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"include/asm-generic/dma-mapping-common.h"), "i" (103), "i" (12UL)); [7680-7681] [2025-03-04 05:48:50,304 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"include/asm-generic/dma-mapping-common.h"), "i" (115), "i" (12UL)); [7717-7718] [2025-03-04 05:48:50,324 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("mfence": : : "memory"); [8141] [2025-03-04 05:48:50,594 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [9885] [2025-03-04 05:48:50,595 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [9888] [2025-03-04 05:48:50,596 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [9891] [2025-03-04 05:48:50,596 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [9894] [2025-03-04 05:48:50,596 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [9897] [2025-03-04 05:48:50,597 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" ((int *)arg): "ebx"); [9932-9933] [2025-03-04 05:48:50,599 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" ((int *)arg): "ebx"); [9936-9937] [2025-03-04 05:48:50,599 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" ((int *)arg): "ebx"); [9940-9941] [2025-03-04 05:48:50,599 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" ((int *)arg): "ebx"); [9944-9945] [2025-03-04 05:48:50,599 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" ((int *)arg): "ebx"); [9948-9949] [2025-03-04 05:48:50,600 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" ((int *)arg): "ebx"); [9979-9980] [2025-03-04 05:48:50,600 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" ((int *)arg): "ebx"); [9983-9984] [2025-03-04 05:48:50,600 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" ((int *)arg): "ebx"); [9987-9988] [2025-03-04 05:48:50,600 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" ((int *)arg): "ebx"); [9991-9992] [2025-03-04 05:48:50,600 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" ((int *)arg): "ebx"); [9995-9996] [2025-03-04 05:48:50,779 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--atm--fore_200e.ko.cil.i[477597,477610] [2025-03-04 05:48:50,781 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--atm--fore_200e.ko.cil.i[477742,477755] [2025-03-04 05:48:50,781 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--atm--fore_200e.ko.cil.i[477888,477901] [2025-03-04 05:48:50,781 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--atm--fore_200e.ko.cil.i[478053,478066] [2025-03-04 05:48:50,782 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--atm--fore_200e.ko.cil.i[478211,478224] [2025-03-04 05:48:50,782 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--atm--fore_200e.ko.cil.i[478369,478382] [2025-03-04 05:48:50,782 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--atm--fore_200e.ko.cil.i[478527,478540] [2025-03-04 05:48:50,783 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--atm--fore_200e.ko.cil.i[478687,478700] [2025-03-04 05:48:50,783 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--atm--fore_200e.ko.cil.i[478846,478859] [2025-03-04 05:48:50,784 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--atm--fore_200e.ko.cil.i[478985,478998] [2025-03-04 05:48:50,784 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--atm--fore_200e.ko.cil.i[479127,479140] [2025-03-04 05:48:50,785 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--atm--fore_200e.ko.cil.i[479276,479289] [2025-03-04 05:48:50,785 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--atm--fore_200e.ko.cil.i[479415,479428] [2025-03-04 05:48:50,785 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--atm--fore_200e.ko.cil.i[479570,479583] [2025-03-04 05:48:50,785 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--atm--fore_200e.ko.cil.i[479730,479743] [2025-03-04 05:48:50,787 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--atm--fore_200e.ko.cil.i[479881,479894] [2025-03-04 05:48:50,787 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--atm--fore_200e.ko.cil.i[480032,480045] [2025-03-04 05:48:50,787 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--atm--fore_200e.ko.cil.i[480184,480197] [2025-03-04 05:48:50,787 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--atm--fore_200e.ko.cil.i[480333,480346] [2025-03-04 05:48:50,788 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--atm--fore_200e.ko.cil.i[480481,480494] [2025-03-04 05:48:50,788 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--atm--fore_200e.ko.cil.i[480638,480651] [2025-03-04 05:48:50,788 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--atm--fore_200e.ko.cil.i[480787,480800] [2025-03-04 05:48:50,788 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--atm--fore_200e.ko.cil.i[480943,480956] [2025-03-04 05:48:50,788 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--atm--fore_200e.ko.cil.i[481096,481109] [2025-03-04 05:48:50,789 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--atm--fore_200e.ko.cil.i[481242,481255] [2025-03-04 05:48:50,789 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--atm--fore_200e.ko.cil.i[481385,481398] [2025-03-04 05:48:50,789 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--atm--fore_200e.ko.cil.i[481537,481550] [2025-03-04 05:48:50,789 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--atm--fore_200e.ko.cil.i[481683,481696] [2025-03-04 05:48:50,789 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--atm--fore_200e.ko.cil.i[481828,481841] [2025-03-04 05:48:50,789 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--atm--fore_200e.ko.cil.i[481982,481995] [2025-03-04 05:48:50,790 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--atm--fore_200e.ko.cil.i[482133,482146] [2025-03-04 05:48:50,790 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--atm--fore_200e.ko.cil.i[482288,482301] [2025-03-04 05:48:50,790 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--atm--fore_200e.ko.cil.i[482440,482453] [2025-03-04 05:48:50,790 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--atm--fore_200e.ko.cil.i[482595,482608] [2025-03-04 05:48:50,790 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--atm--fore_200e.ko.cil.i[482759,482772] [2025-03-04 05:48:50,791 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--atm--fore_200e.ko.cil.i[482915,482928] [2025-03-04 05:48:50,791 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--atm--fore_200e.ko.cil.i[483079,483092] [2025-03-04 05:48:50,791 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--atm--fore_200e.ko.cil.i[483221,483234] [2025-03-04 05:48:50,791 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--atm--fore_200e.ko.cil.i[483379,483392] [2025-03-04 05:48:50,791 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--atm--fore_200e.ko.cil.i[483546,483559] [2025-03-04 05:48:50,791 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--atm--fore_200e.ko.cil.i[483705,483718] [2025-03-04 05:48:50,791 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--atm--fore_200e.ko.cil.i[483864,483877] [2025-03-04 05:48:50,792 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--atm--fore_200e.ko.cil.i[484013,484026] [2025-03-04 05:48:50,792 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--atm--fore_200e.ko.cil.i[484160,484173] [2025-03-04 05:48:50,792 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--atm--fore_200e.ko.cil.i[484299,484312] [2025-03-04 05:48:50,792 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--atm--fore_200e.ko.cil.i[484462,484475] [2025-03-04 05:48:50,792 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--atm--fore_200e.ko.cil.i[484628,484641] [2025-03-04 05:48:50,792 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--atm--fore_200e.ko.cil.i[484792,484805] [2025-03-04 05:48:50,792 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--atm--fore_200e.ko.cil.i[484957,484970] [2025-03-04 05:48:50,792 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--atm--fore_200e.ko.cil.i[485122,485135] [2025-03-04 05:48:50,793 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--atm--fore_200e.ko.cil.i[485288,485301] [2025-03-04 05:48:50,793 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--atm--fore_200e.ko.cil.i[485453,485466] [2025-03-04 05:48:50,793 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--atm--fore_200e.ko.cil.i[485620,485633] [2025-03-04 05:48:50,793 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--atm--fore_200e.ko.cil.i[485780,485793] [2025-03-04 05:48:50,793 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--atm--fore_200e.ko.cil.i[485942,485955] [2025-03-04 05:48:50,793 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--atm--fore_200e.ko.cil.i[486101,486114] [2025-03-04 05:48:50,794 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--atm--fore_200e.ko.cil.i[486247,486260] [2025-03-04 05:48:50,794 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--atm--fore_200e.ko.cil.i[486390,486403] [2025-03-04 05:48:50,794 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--atm--fore_200e.ko.cil.i[486534,486547] [2025-03-04 05:48:50,795 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--atm--fore_200e.ko.cil.i[486677,486690] [2025-03-04 05:48:50,795 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--atm--fore_200e.ko.cil.i[486821,486834] [2025-03-04 05:48:50,795 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--atm--fore_200e.ko.cil.i[486962,486975] [2025-03-04 05:48:50,795 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--atm--fore_200e.ko.cil.i[487100,487113] [2025-03-04 05:48:50,795 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--atm--fore_200e.ko.cil.i[487258,487271] [2025-03-04 05:48:50,795 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--atm--fore_200e.ko.cil.i[487417,487430] [2025-03-04 05:48:50,796 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--atm--fore_200e.ko.cil.i[487573,487586] [2025-03-04 05:48:50,796 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--atm--fore_200e.ko.cil.i[487722,487735] [2025-03-04 05:48:50,796 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--atm--fore_200e.ko.cil.i[487874,487887] [2025-03-04 05:48:50,796 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--atm--fore_200e.ko.cil.i[488025,488038] [2025-03-04 05:48:50,796 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--atm--fore_200e.ko.cil.i[488174,488187] [2025-03-04 05:48:50,797 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--atm--fore_200e.ko.cil.i[488326,488339] [2025-03-04 05:48:50,797 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--atm--fore_200e.ko.cil.i[488474,488487] [2025-03-04 05:48:50,797 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--atm--fore_200e.ko.cil.i[488627,488640] [2025-03-04 05:48:50,797 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--atm--fore_200e.ko.cil.i[488778,488791] [2025-03-04 05:48:50,797 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--atm--fore_200e.ko.cil.i[488928,488941] [2025-03-04 05:48:50,798 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--atm--fore_200e.ko.cil.i[489075,489088] [2025-03-04 05:48:50,798 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--atm--fore_200e.ko.cil.i[489226,489239] [2025-03-04 05:48:50,798 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--atm--fore_200e.ko.cil.i[489377,489390] [2025-03-04 05:48:50,798 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--atm--fore_200e.ko.cil.i[489525,489538] [2025-03-04 05:48:50,798 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--atm--fore_200e.ko.cil.i[489691,489704] [2025-03-04 05:48:50,800 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--atm--fore_200e.ko.cil.i[489860,489873] [2025-03-04 05:48:50,801 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--atm--fore_200e.ko.cil.i[490027,490040] [2025-03-04 05:48:50,801 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--atm--fore_200e.ko.cil.i[490195,490208] [2025-03-04 05:48:50,801 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--atm--fore_200e.ko.cil.i[490345,490358] [2025-03-04 05:48:50,801 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--atm--fore_200e.ko.cil.i[490492,490505] [2025-03-04 05:48:50,801 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--atm--fore_200e.ko.cil.i[490653,490666] [2025-03-04 05:48:50,802 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--atm--fore_200e.ko.cil.i[490823,490836] [2025-03-04 05:48:50,802 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--atm--fore_200e.ko.cil.i[490985,490998] [2025-03-04 05:48:50,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 05:48:50,960 INFO L204 MainTranslator]: Completed translation [2025-03-04 05:48:50,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:48:50 WrapperNode [2025-03-04 05:48:50,961 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 05:48:50,962 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 05:48:50,962 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 05:48:50,962 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 05:48:50,967 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:48:50" (1/1) ... [2025-03-04 05:48:51,052 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:48:50" (1/1) ... [2025-03-04 05:48:51,273 INFO L138 Inliner]: procedures = 673, calls = 2736, calls flagged for inlining = 296, calls inlined = 204, statements flattened = 6371 [2025-03-04 05:48:51,274 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 05:48:51,279 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 05:48:51,279 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 05:48:51,279 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 05:48:51,297 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:48:50" (1/1) ... [2025-03-04 05:48:51,297 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:48:50" (1/1) ... [2025-03-04 05:48:51,328 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:48:50" (1/1) ... [2025-03-04 05:48:52,257 INFO L175 MemorySlicer]: Split 1157 memory accesses to 38 slices as follows [3, 2, 4, 4, 4, 5, 3, 5, 6, 1, 5, 4, 3, 8, 4, 4, 3, 5, 8, 2, 2, 3, 7, 5, 963, 1, 4, 2, 4, 3, 7, 6, 5, 4, 9, 4, 44, 1]. 83 percent of accesses are in the largest equivalence class. The 123 initializations are split as follows [0, 0, 0, 0, 4, 0, 0, 5, 6, 0, 5, 0, 0, 8, 4, 0, 0, 0, 8, 0, 0, 3, 0, 5, 8, 1, 4, 2, 4, 0, 4, 4, 0, 0, 0, 4, 44, 0]. The 302 writes are split as follows [2, 0, 3, 0, 0, 4, 2, 0, 0, 1, 0, 0, 1, 0, 0, 2, 2, 4, 0, 1, 1, 0, 6, 0, 258, 0, 0, 0, 0, 0, 0, 0, 4, 2, 9, 0, 0, 0]. [2025-03-04 05:48:52,258 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:48:50" (1/1) ... [2025-03-04 05:48:52,258 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:48:50" (1/1) ... [2025-03-04 05:48:52,453 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:48:50" (1/1) ... [2025-03-04 05:48:52,470 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:48:50" (1/1) ... [2025-03-04 05:48:52,543 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:48:50" (1/1) ... [2025-03-04 05:48:52,576 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:48:50" (1/1) ... [2025-03-04 05:48:52,630 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 05:48:52,631 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 05:48:52,632 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 05:48:52,632 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 05:48:52,634 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:48:50" (1/1) ... [2025-03-04 05:48:52,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 05:48:52,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:48:52,668 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-04 05:48:52,674 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-04 05:48:52,695 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_io_instance_callback_2_25 [2025-03-04 05:48:52,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_io_instance_callback_2_25 [2025-03-04 05:48:52,695 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_supply [2025-03-04 05:48:52,695 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_supply [2025-03-04 05:48:52,695 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_sync_for_device [2025-03-04 05:48:52,695 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_sync_for_device [2025-03-04 05:48:52,695 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~u32~0~X~$Pointer$~TO~VOID [2025-03-04 05:48:52,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~u32~0~X~$Pointer$~TO~VOID [2025-03-04 05:48:52,695 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2025-03-04 05:48:52,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2025-03-04 05:48:52,695 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_register [2025-03-04 05:48:52,695 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_register [2025-03-04 05:48:52,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-03-04 05:48:52,696 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-03-04 05:48:52,696 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_unmap [2025-03-04 05:48:52,696 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_unmap [2025-03-04 05:48:52,696 INFO L130 BoogieDeclarations]: Found specification of procedure panic [2025-03-04 05:48:52,696 INFO L138 BoogieDeclarations]: Found implementation of procedure panic [2025-03-04 05:48:52,696 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-04 05:48:52,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-04 05:48:52,696 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_read [2025-03-04 05:48:52,696 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_read [2025-03-04 05:48:52,696 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-03-04 05:48:52,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-03-04 05:48:52,696 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_activate_vcin [2025-03-04 05:48:52,696 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_activate_vcin [2025-03-04 05:48:52,696 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_remove_one [2025-03-04 05:48:52,696 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_remove_one [2025-03-04 05:48:52,696 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_io_poll [2025-03-04 05:48:52,696 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_io_poll [2025-03-04 05:48:52,697 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-03-04 05:48:52,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-03-04 05:48:52,697 INFO L130 BoogieDeclarations]: Found specification of procedure valid_dma_direction [2025-03-04 05:48:52,697 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_dma_direction [2025-03-04 05:48:52,697 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2025-03-04 05:48:52,697 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2025-03-04 05:48:52,697 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2025-03-04 05:48:52,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2025-03-04 05:48:52,697 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2025-03-04 05:48:52,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2025-03-04 05:48:52,697 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2025-03-04 05:48:52,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2025-03-04 05:48:52,697 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_irq_check [2025-03-04 05:48:52,697 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_irq_check [2025-03-04 05:48:52,697 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_getstats [2025-03-04 05:48:52,697 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_getstats [2025-03-04 05:48:52,697 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-03-04 05:48:52,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-03-04 05:48:52,697 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2025-03-04 05:48:52,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2025-03-04 05:48:52,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 05:48:52,697 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_init [2025-03-04 05:48:52,697 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_init [2025-03-04 05:48:52,697 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_shutdown [2025-03-04 05:48:52,697 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_shutdown [2025-03-04 05:48:52,697 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_detect [2025-03-04 05:48:52,697 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_detect [2025-03-04 05:48:52,697 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2025-03-04 05:48:52,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2025-03-04 05:48:52,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-04 05:48:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-04 05:48:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-04 05:48:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-04 05:48:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-04 05:48:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-04 05:48:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-04 05:48:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-03-04 05:48:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-03-04 05:48:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-03-04 05:48:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-03-04 05:48:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-03-04 05:48:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-03-04 05:48:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-03-04 05:48:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-03-04 05:48:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-03-04 05:48:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#16 [2025-03-04 05:48:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#17 [2025-03-04 05:48:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#18 [2025-03-04 05:48:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#19 [2025-03-04 05:48:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#20 [2025-03-04 05:48:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#21 [2025-03-04 05:48:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#22 [2025-03-04 05:48:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#23 [2025-03-04 05:48:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#24 [2025-03-04 05:48:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#25 [2025-03-04 05:48:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#26 [2025-03-04 05:48:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#27 [2025-03-04 05:48:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#28 [2025-03-04 05:48:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#29 [2025-03-04 05:48:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#30 [2025-03-04 05:48:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#31 [2025-03-04 05:48:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#32 [2025-03-04 05:48:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#33 [2025-03-04 05:48:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#34 [2025-03-04 05:48:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#35 [2025-03-04 05:48:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#36 [2025-03-04 05:48:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#37 [2025-03-04 05:48:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2025-03-04 05:48:52,698 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2025-03-04 05:48:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 05:48:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 05:48:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 05:48:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 05:48:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 05:48:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 05:48:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 05:48:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 05:48:52,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 05:48:52,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-04 05:48:52,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-04 05:48:52,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-04 05:48:52,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#22 [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#23 [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#24 [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#25 [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#26 [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#27 [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#28 [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#29 [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#30 [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#31 [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#32 [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#33 [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#34 [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#35 [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#36 [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#37 [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2025-03-04 05:48:52,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2025-03-04 05:48:52,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~~u32~0 [2025-03-04 05:48:52,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~~u32~0 [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_map [2025-03-04 05:48:52,702 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_map [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-03-04 05:48:52,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-03-04 05:48:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#24 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#25 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#26 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#27 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#28 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#29 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#30 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#31 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#32 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#33 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#34 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#35 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#36 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#37 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2025-03-04 05:48:52,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure __phys_addr [2025-03-04 05:48:52,703 INFO L138 BoogieDeclarations]: Found implementation of procedure __phys_addr [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2025-03-04 05:48:52,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#9 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#10 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#11 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#12 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#13 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#14 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#15 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#16 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#17 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#18 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#19 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#20 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#21 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#22 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#23 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#24 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#25 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#26 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#27 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#28 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#29 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#30 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#31 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#32 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#33 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#34 [2025-03-04 05:48:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#35 [2025-03-04 05:48:52,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#36 [2025-03-04 05:48:52,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#37 [2025-03-04 05:48:52,704 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2025-03-04 05:48:52,704 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2025-03-04 05:48:52,704 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2025-03-04 05:48:52,704 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2025-03-04 05:48:52,704 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2025-03-04 05:48:52,704 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2025-03-04 05:48:52,704 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2025-03-04 05:48:52,704 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2025-03-04 05:48:52,704 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2025-03-04 05:48:52,704 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#9 [2025-03-04 05:48:52,704 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#10 [2025-03-04 05:48:52,704 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#11 [2025-03-04 05:48:52,704 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#12 [2025-03-04 05:48:52,704 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#13 [2025-03-04 05:48:52,704 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#14 [2025-03-04 05:48:52,704 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#15 [2025-03-04 05:48:52,704 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#16 [2025-03-04 05:48:52,704 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#17 [2025-03-04 05:48:52,704 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#18 [2025-03-04 05:48:52,704 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#19 [2025-03-04 05:48:52,704 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#20 [2025-03-04 05:48:52,704 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#21 [2025-03-04 05:48:52,704 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#22 [2025-03-04 05:48:52,704 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#23 [2025-03-04 05:48:52,704 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#24 [2025-03-04 05:48:52,704 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#25 [2025-03-04 05:48:52,704 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#26 [2025-03-04 05:48:52,704 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#27 [2025-03-04 05:48:52,704 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#28 [2025-03-04 05:48:52,704 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#29 [2025-03-04 05:48:52,704 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#30 [2025-03-04 05:48:52,704 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#31 [2025-03-04 05:48:52,704 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#32 [2025-03-04 05:48:52,704 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#33 [2025-03-04 05:48:52,704 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#34 [2025-03-04 05:48:52,704 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#35 [2025-03-04 05:48:52,704 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#36 [2025-03-04 05:48:52,704 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#37 [2025-03-04 05:48:52,704 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_proc_read [2025-03-04 05:48:52,704 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_proc_read [2025-03-04 05:48:52,704 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2025-03-04 05:48:52,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2025-03-04 05:48:52,704 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2025-03-04 05:48:52,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2025-03-04 05:48:52,704 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2025-03-04 05:48:52,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2025-03-04 05:48:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_open [2025-03-04 05:48:52,707 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_open [2025-03-04 05:48:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2025-03-04 05:48:52,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2025-03-04 05:48:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2025-03-04 05:48:52,707 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_device [2025-03-04 05:48:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-03-04 05:48:52,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-03-04 05:48:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 05:48:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 05:48:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_write [2025-03-04 05:48:52,707 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_write [2025-03-04 05:48:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-03-04 05:48:52,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-03-04 05:48:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 05:48:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 05:48:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 05:48:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 05:48:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 05:48:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 05:48:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 05:48:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 05:48:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 05:48:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 05:48:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-04 05:48:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-04 05:48:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-04 05:48:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-04 05:48:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-04 05:48:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-04 05:48:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-04 05:48:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-04 05:48:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-04 05:48:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-03-04 05:48:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-03-04 05:48:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-03-04 05:48:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#22 [2025-03-04 05:48:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#23 [2025-03-04 05:48:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#24 [2025-03-04 05:48:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#25 [2025-03-04 05:48:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#26 [2025-03-04 05:48:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#27 [2025-03-04 05:48:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#28 [2025-03-04 05:48:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#29 [2025-03-04 05:48:52,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#30 [2025-03-04 05:48:52,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#31 [2025-03-04 05:48:52,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#32 [2025-03-04 05:48:52,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#33 [2025-03-04 05:48:52,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#34 [2025-03-04 05:48:52,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#35 [2025-03-04 05:48:52,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#36 [2025-03-04 05:48:52,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#37 [2025-03-04 05:48:52,708 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-03-04 05:48:52,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-03-04 05:48:52,708 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2025-03-04 05:48:52,708 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2025-03-04 05:48:52,708 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~u32~0~X~int~X~int~TO~VOID [2025-03-04 05:48:52,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~u32~0~X~int~X~int~TO~VOID [2025-03-04 05:48:52,708 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2025-03-04 05:48:52,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2025-03-04 05:48:52,708 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_schedule [2025-03-04 05:48:52,708 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_schedule [2025-03-04 05:48:52,708 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atm_dev_register [2025-03-04 05:48:52,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atm_dev_register [2025-03-04 05:48:52,708 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_get_esi [2025-03-04 05:48:52,708 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_get_esi [2025-03-04 05:48:52,708 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_monitor_getc [2025-03-04 05:48:52,708 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_monitor_getc [2025-03-04 05:48:52,708 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~dma_addr_t~0~X~int~X~int~TO~VOID [2025-03-04 05:48:52,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~dma_addr_t~0~X~int~X~int~TO~VOID [2025-03-04 05:48:52,709 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_chunk_free [2025-03-04 05:48:52,709 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_chunk_free [2025-03-04 05:48:52,709 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~~u32~0 [2025-03-04 05:48:52,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~~u32~0 [2025-03-04 05:48:52,709 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2025-03-04 05:48:52,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2025-03-04 05:48:52,709 INFO L130 BoogieDeclarations]: Found specification of procedure writel [2025-03-04 05:48:52,709 INFO L138 BoogieDeclarations]: Found implementation of procedure writel [2025-03-04 05:48:52,709 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2025-03-04 05:48:52,709 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2025-03-04 05:48:52,709 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_close [2025-03-04 05:48:52,709 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_close [2025-03-04 05:48:52,709 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_reset [2025-03-04 05:48:52,709 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_reset [2025-03-04 05:48:52,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 05:48:52,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 05:48:52,709 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_rate_ctrl [2025-03-04 05:48:52,709 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_rate_ctrl [2025-03-04 05:48:52,709 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2025-03-04 05:48:52,710 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2025-03-04 05:48:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~X~int~TO~int [2025-03-04 05:48:52,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~X~int~TO~int [2025-03-04 05:48:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-04 05:48:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-04 05:48:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-04 05:48:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-04 05:48:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-04 05:48:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-04 05:48:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-04 05:48:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-03-04 05:48:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-03-04 05:48:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-03-04 05:48:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-03-04 05:48:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-03-04 05:48:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-03-04 05:48:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-03-04 05:48:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-03-04 05:48:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-03-04 05:48:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#16 [2025-03-04 05:48:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#17 [2025-03-04 05:48:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#18 [2025-03-04 05:48:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#19 [2025-03-04 05:48:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#20 [2025-03-04 05:48:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#21 [2025-03-04 05:48:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#22 [2025-03-04 05:48:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#23 [2025-03-04 05:48:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#24 [2025-03-04 05:48:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#25 [2025-03-04 05:48:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#26 [2025-03-04 05:48:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#27 [2025-03-04 05:48:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#28 [2025-03-04 05:48:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#29 [2025-03-04 05:48:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#30 [2025-03-04 05:48:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#31 [2025-03-04 05:48:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#32 [2025-03-04 05:48:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#33 [2025-03-04 05:48:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#34 [2025-03-04 05:48:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#35 [2025-03-04 05:48:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#36 [2025-03-04 05:48:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#37 [2025-03-04 05:48:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 05:48:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 05:48:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 05:48:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 05:48:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 05:48:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 05:48:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 05:48:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 05:48:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-04 05:48:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-04 05:48:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-04 05:48:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-04 05:48:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-04 05:48:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-04 05:48:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-04 05:48:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-04 05:48:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-03-04 05:48:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-03-04 05:48:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-03-04 05:48:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-03-04 05:48:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2025-03-04 05:48:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#21 [2025-03-04 05:48:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#22 [2025-03-04 05:48:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#23 [2025-03-04 05:48:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#24 [2025-03-04 05:48:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#25 [2025-03-04 05:48:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#26 [2025-03-04 05:48:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#27 [2025-03-04 05:48:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#28 [2025-03-04 05:48:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#29 [2025-03-04 05:48:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#30 [2025-03-04 05:48:52,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#31 [2025-03-04 05:48:52,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#32 [2025-03-04 05:48:52,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#33 [2025-03-04 05:48:52,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#34 [2025-03-04 05:48:52,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#35 [2025-03-04 05:48:52,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#36 [2025-03-04 05:48:52,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#37 [2025-03-04 05:48:52,712 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-04 05:48:52,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-04 05:48:52,712 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-03-04 05:48:52,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-03-04 05:48:52,712 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_irq_itoa [2025-03-04 05:48:52,712 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_irq_itoa [2025-03-04 05:48:52,712 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_init [2025-03-04 05:48:52,712 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_init [2025-03-04 05:48:52,712 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_struct_atmdev_ops_io_instance_2 [2025-03-04 05:48:52,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_struct_atmdev_ops_io_instance_2 [2025-03-04 05:48:52,712 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_irq_ack [2025-03-04 05:48:52,712 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_irq_ack [2025-03-04 05:48:52,712 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_130 [2025-03-04 05:48:52,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_130 [2025-03-04 05:48:52,712 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2025-03-04 05:48:52,712 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2025-03-04 05:48:52,712 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2025-03-04 05:48:52,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2025-03-04 05:48:52,712 INFO L130 BoogieDeclarations]: Found specification of procedure sk_atm [2025-03-04 05:48:52,712 INFO L138 BoogieDeclarations]: Found implementation of procedure sk_atm [2025-03-04 05:48:52,712 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2025-03-04 05:48:52,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2025-03-04 05:48:52,712 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_prom_read [2025-03-04 05:48:52,712 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_prom_read [2025-03-04 05:48:52,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 05:48:52,713 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2025-03-04 05:48:52,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2025-03-04 05:48:52,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 05:48:52,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 05:48:52,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 05:48:52,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 05:48:52,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 05:48:52,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 05:48:52,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 05:48:52,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 05:48:52,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 05:48:52,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 05:48:52,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-04 05:48:52,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-04 05:48:52,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-04 05:48:52,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-04 05:48:52,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-04 05:48:52,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-04 05:48:52,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-04 05:48:52,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-04 05:48:52,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-04 05:48:52,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-03-04 05:48:52,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-03-04 05:48:52,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-03-04 05:48:52,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#22 [2025-03-04 05:48:52,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#23 [2025-03-04 05:48:52,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#24 [2025-03-04 05:48:52,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#25 [2025-03-04 05:48:52,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#26 [2025-03-04 05:48:52,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#27 [2025-03-04 05:48:52,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#28 [2025-03-04 05:48:52,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#29 [2025-03-04 05:48:52,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#30 [2025-03-04 05:48:52,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#31 [2025-03-04 05:48:52,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#32 [2025-03-04 05:48:52,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#33 [2025-03-04 05:48:52,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#34 [2025-03-04 05:48:52,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#35 [2025-03-04 05:48:52,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#36 [2025-03-04 05:48:52,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#37 [2025-03-04 05:48:52,714 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_sync_for_cpu [2025-03-04 05:48:52,714 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_sync_for_cpu [2025-03-04 05:48:52,714 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_reset [2025-03-04 05:48:52,714 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_reset [2025-03-04 05:48:52,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 05:48:52,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 05:48:52,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 05:48:52,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 05:48:52,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 05:48:52,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-04 05:48:52,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-04 05:48:52,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-04 05:48:52,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-04 05:48:52,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-04 05:48:52,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-04 05:48:52,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-04 05:48:52,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-04 05:48:52,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-04 05:48:52,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-04 05:48:52,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-04 05:48:52,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-04 05:48:52,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-04 05:48:52,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-03-04 05:48:52,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-03-04 05:48:52,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-03-04 05:48:52,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2025-03-04 05:48:52,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#22 [2025-03-04 05:48:52,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#23 [2025-03-04 05:48:52,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#24 [2025-03-04 05:48:52,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#25 [2025-03-04 05:48:52,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#26 [2025-03-04 05:48:52,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#27 [2025-03-04 05:48:52,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#28 [2025-03-04 05:48:52,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#29 [2025-03-04 05:48:52,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#30 [2025-03-04 05:48:52,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#31 [2025-03-04 05:48:52,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#32 [2025-03-04 05:48:52,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#33 [2025-03-04 05:48:52,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#34 [2025-03-04 05:48:52,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#35 [2025-03-04 05:48:52,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#36 [2025-03-04 05:48:52,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#37 [2025-03-04 05:48:52,715 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2025-03-04 05:48:52,715 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2025-03-04 05:48:52,715 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-04 05:48:52,715 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-04 05:48:52,715 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2025-03-04 05:48:52,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2025-03-04 05:48:52,715 INFO L130 BoogieDeclarations]: Found specification of procedure pci_write_config_byte [2025-03-04 05:48:52,715 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_write_config_byte [2025-03-04 05:48:52,715 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-03-04 05:48:52,715 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-03-04 05:48:52,715 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_chunk_free [2025-03-04 05:48:52,715 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_chunk_free [2025-03-04 05:48:52,715 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2025-03-04 05:48:52,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2025-03-04 05:48:52,715 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2025-03-04 05:48:52,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2025-03-04 05:48:52,715 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_rate_mtx_of_fore200e [2025-03-04 05:48:52,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_rate_mtx_of_fore200e [2025-03-04 05:48:52,715 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-03-04 05:48:52,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-03-04 05:48:52,716 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_map [2025-03-04 05:48:52,716 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_map [2025-03-04 05:48:52,716 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_atm2fore_aal [2025-03-04 05:48:52,716 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_atm2fore_aal [2025-03-04 05:48:52,716 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_q_lock_of_fore200e [2025-03-04 05:48:52,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_q_lock_of_fore200e [2025-03-04 05:48:52,716 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-03-04 05:48:52,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-03-04 05:48:52,716 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-03-04 05:48:52,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-03-04 05:48:52,716 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2025-03-04 05:48:52,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2025-03-04 05:48:52,716 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2025-03-04 05:48:52,716 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2025-03-04 05:48:52,716 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2025-03-04 05:48:52,716 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2025-03-04 05:48:52,716 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atm_dev_register_150 [2025-03-04 05:48:52,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atm_dev_register_150 [2025-03-04 05:48:52,716 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-03-04 05:48:52,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-03-04 05:48:52,716 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-04 05:48:52,716 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-04 05:48:52,716 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-03-04 05:48:52,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-03-04 05:48:52,716 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dispatch_register_8_1 [2025-03-04 05:48:52,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dispatch_register_8_1 [2025-03-04 05:48:52,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 05:48:52,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 05:48:52,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 05:48:52,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 05:48:52,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 05:48:52,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 05:48:52,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 05:48:52,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 05:48:52,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 05:48:52,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 05:48:52,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 05:48:52,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 05:48:52,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 05:48:52,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-04 05:48:52,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-04 05:48:52,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-04 05:48:52,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-04 05:48:52,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-04 05:48:52,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-04 05:48:52,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-03-04 05:48:52,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-03-04 05:48:52,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-03-04 05:48:52,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-03-04 05:48:52,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2025-03-04 05:48:52,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#24 [2025-03-04 05:48:52,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#25 [2025-03-04 05:48:52,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#26 [2025-03-04 05:48:52,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#27 [2025-03-04 05:48:52,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#28 [2025-03-04 05:48:52,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#29 [2025-03-04 05:48:52,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#30 [2025-03-04 05:48:52,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#31 [2025-03-04 05:48:52,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#32 [2025-03-04 05:48:52,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#33 [2025-03-04 05:48:52,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#34 [2025-03-04 05:48:52,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#35 [2025-03-04 05:48:52,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#36 [2025-03-04 05:48:52,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#37 [2025-03-04 05:48:52,718 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2025-03-04 05:48:52,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2025-03-04 05:48:52,718 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_configure [2025-03-04 05:48:52,718 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_configure [2025-03-04 05:48:52,718 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-04 05:48:52,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-04 05:48:52,718 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2025-03-04 05:48:52,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2025-03-04 05:48:52,718 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_any [2025-03-04 05:48:52,718 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_any [2025-03-04 05:48:52,718 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_inc [2025-03-04 05:48:52,718 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_inc [2025-03-04 05:48:52,718 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_send [2025-03-04 05:48:52,718 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_send [2025-03-04 05:48:52,718 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_unmap [2025-03-04 05:48:52,718 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_unmap [2025-03-04 05:48:52,718 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_chunk_alloc [2025-03-04 05:48:52,718 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_chunk_alloc [2025-03-04 05:48:52,718 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2025-03-04 05:48:52,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2025-03-04 05:48:52,718 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-03-04 05:48:52,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-03-04 05:48:52,718 INFO L130 BoogieDeclarations]: Found specification of procedure msecs_to_jiffies [2025-03-04 05:48:52,718 INFO L138 BoogieDeclarations]: Found implementation of procedure msecs_to_jiffies [2025-03-04 05:48:52,718 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_proc_read [2025-03-04 05:48:52,718 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_proc_read [2025-03-04 05:48:52,718 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_poll [2025-03-04 05:48:52,719 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_poll [2025-03-04 05:48:52,719 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-03-04 05:48:52,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-03-04 05:48:52,719 INFO L130 BoogieDeclarations]: Found specification of procedure readl [2025-03-04 05:48:52,719 INFO L138 BoogieDeclarations]: Found implementation of procedure readl [2025-03-04 05:48:52,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 05:48:52,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 05:48:52,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 05:48:52,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 05:48:52,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 05:48:52,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 05:48:52,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 05:48:52,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 05:48:52,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 05:48:52,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 05:48:52,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 05:48:52,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 05:48:52,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 05:48:52,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-04 05:48:52,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-04 05:48:52,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-04 05:48:52,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-04 05:48:52,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-04 05:48:52,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-04 05:48:52,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-04 05:48:52,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-03-04 05:48:52,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-03-04 05:48:52,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-03-04 05:48:52,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2025-03-04 05:48:52,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#24 [2025-03-04 05:48:52,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#25 [2025-03-04 05:48:52,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#26 [2025-03-04 05:48:52,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#27 [2025-03-04 05:48:52,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#28 [2025-03-04 05:48:52,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#29 [2025-03-04 05:48:52,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#30 [2025-03-04 05:48:52,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#31 [2025-03-04 05:48:52,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#32 [2025-03-04 05:48:52,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#33 [2025-03-04 05:48:52,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#34 [2025-03-04 05:48:52,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#35 [2025-03-04 05:48:52,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#36 [2025-03-04 05:48:52,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#37 [2025-03-04 05:48:52,723 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~VOID [2025-03-04 05:48:52,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~VOID [2025-03-04 05:48:52,723 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_rate_mtx_of_fore200e [2025-03-04 05:48:52,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_rate_mtx_of_fore200e [2025-03-04 05:48:52,723 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_tx_irq [2025-03-04 05:48:52,723 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_tx_irq [2025-03-04 05:48:53,848 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 05:48:53,852 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 05:48:54,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9121: call ULTIMATE.dealloc(~#activ_opcode~0#1.base, ~#activ_opcode~0#1.offset);havoc ~#activ_opcode~0#1.base, ~#activ_opcode~0#1.offset;call ULTIMATE.dealloc(~#deactiv_opcode~0#1.base, ~#deactiv_opcode~0#1.offset);havoc ~#deactiv_opcode~0#1.base, ~#deactiv_opcode~0#1.offset;call ULTIMATE.dealloc(~#vpvc~0#1.base, ~#vpvc~0#1.offset);havoc ~#vpvc~0#1.base, ~#vpvc~0#1.offset; [2025-03-04 05:48:54,259 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7498: havoc dev_get_drvdata_#t~mem40#1.base, dev_get_drvdata_#t~mem40#1.offset; [2025-03-04 05:48:55,295 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9614: call ULTIMATE.dealloc(~#opcode~2.base, ~#opcode~2.offset);havoc ~#opcode~2.base, ~#opcode~2.offset; [2025-03-04 05:48:55,477 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18150: havoc dma_set_mask_#t~nondet1959#1; [2025-03-04 05:48:55,477 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18154: havoc dma_supported_#t~nondet1960#1; [2025-03-04 05:48:55,477 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18194: havoc pci_enable_device_#t~nondet1966#1; [2025-03-04 05:48:55,494 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7585: havoc #t~mem99.base, #t~mem99.offset; [2025-03-04 05:48:55,530 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18101: havoc #t~nondet1954; [2025-03-04 05:48:55,871 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10985: call ULTIMATE.dealloc(~#media_name~0#1.base, ~#media_name~0#1.offset);havoc ~#media_name~0#1.base, ~#media_name~0#1.offset;call ULTIMATE.dealloc(~#oc3_mode~0#1.base, ~#oc3_mode~0#1.offset);havoc ~#oc3_mode~0#1.base, ~#oc3_mode~0#1.offset; [2025-03-04 05:48:56,076 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18111: havoc #t~nondet1955; [2025-03-04 05:48:56,102 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7338-1: test_and_set_bit_#res#1 := 1; [2025-03-04 05:48:56,107 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11574: #res.base, #res.offset := ~arg0.base, ~arg0.offset; [2025-03-04 05:48:56,180 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7403: havoc arch_irqs_disabled_flags_#t~bitwise25#1; [2025-03-04 05:49:00,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12127-2: call ULTIMATE.dealloc(ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0#1.base, ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0#1.offset);havoc ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0#1.base, ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0#1.offset; [2025-03-04 05:49:00,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12127-1: call ULTIMATE.dealloc(ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0#1.base, ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0#1.offset);havoc ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0#1.base, ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0#1.offset; [2025-03-04 05:49:00,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12127: call ULTIMATE.dealloc(ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0#1.base, ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0#1.offset);havoc ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0#1.base, ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0#1.offset; [2025-03-04 05:49:00,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12101: call ULTIMATE.dealloc(ldv_pci_instance_suspend_1_8_~#arg2#1.base, ldv_pci_instance_suspend_1_8_~#arg2#1.offset);havoc ldv_pci_instance_suspend_1_8_~#arg2#1.base, ldv_pci_instance_suspend_1_8_~#arg2#1.offset; [2025-03-04 05:49:00,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12112: call ULTIMATE.dealloc(ldv_pci_instance_suspend_late_1_7_~#arg2#1.base, ldv_pci_instance_suspend_late_1_7_~#arg2#1.offset);havoc ldv_pci_instance_suspend_late_1_7_~#arg2#1.base, ldv_pci_instance_suspend_late_1_7_~#arg2#1.offset; [2025-03-04 05:49:00,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13103-1: ldv___pci_register_driver_151_#res#1 := ldv___pci_register_driver_151_~ldv_func_res~2#1; [2025-03-04 05:49:00,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18097: havoc __pci_register_driver_#t~nondet1953#1; [2025-03-04 05:49:00,724 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11561-1: ldv___pci_register_driver_#res#1 := ldv___pci_register_driver_~arg0#1; [2025-03-04 05:49:01,691 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-04 05:49:02,883 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8059: call ULTIMATE.dealloc(~#str~0.base, ~#str~0.offset);havoc ~#str~0.base, ~#str~0.offset; [2025-03-04 05:49:03,714 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10457: call ULTIMATE.dealloc(fore200e_initialize_~#__key~0#1.base, fore200e_initialize_~#__key~0#1.offset);havoc fore200e_initialize_~#__key~0#1.base, fore200e_initialize_~#__key~0#1.offset;call ULTIMATE.dealloc(fore200e_initialize_~#__key___0~0#1.base, fore200e_initialize_~#__key___0~0#1.offset);havoc fore200e_initialize_~#__key___0~0#1.base, fore200e_initialize_~#__key___0~0#1.offset; [2025-03-04 05:49:03,714 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18211: havoc request_firmware_#t~nondet1968#1; [2025-03-04 05:49:03,714 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10614: call ULTIMATE.dealloc(fore200e_load_and_start_fw_~#firmware~0#1.base, fore200e_load_and_start_fw_~#firmware~0#1.offset);havoc fore200e_load_and_start_fw_~#firmware~0#1.base, fore200e_load_and_start_fw_~#firmware~0#1.offset;call ULTIMATE.dealloc(fore200e_load_and_start_fw_~#buf~0#1.base, fore200e_load_and_start_fw_~#buf~0#1.offset);havoc fore200e_load_and_start_fw_~#buf~0#1.base, fore200e_load_and_start_fw_~#buf~0#1.offset; [2025-03-04 05:49:03,714 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12302-1: ldv_request_irq_#res#1 := ldv_request_irq_~arg0#1; [2025-03-04 05:49:03,714 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18215: havoc request_threaded_irq_#t~nondet1969#1; [2025-03-04 05:49:03,714 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13066-1: ldv_request_irq_149_#res#1 := ldv_request_irq_149_~ldv_func_res~0#1; [2025-03-04 05:49:04,253 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18128: havoc capable_#t~nondet1958#1; [2025-03-04 05:49:04,253 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9673: call ULTIMATE.dealloc(fore200e_set_oc3_~#opcode~3#1.base, fore200e_set_oc3_~#opcode~3#1.offset);havoc fore200e_set_oc3_~#opcode~3#1.base, fore200e_set_oc3_~#opcode~3#1.offset; [2025-03-04 05:49:04,254 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9763: call ULTIMATE.dealloc(fore200e_fetch_stats_~#tmp~41#1.base, fore200e_fetch_stats_~#tmp~41#1.offset);havoc fore200e_fetch_stats_~#tmp~41#1.base, fore200e_fetch_stats_~#tmp~41#1.offset; [2025-03-04 05:49:05,146 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7411: havoc #t~mem26; [2025-03-04 05:49:05,208 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8633: call ULTIMATE.dealloc(~#opcode~1.base, ~#opcode~1.offset);havoc ~#opcode~1.base, ~#opcode~1.offset; [2025-03-04 05:49:05,281 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18204: havoc #t~nondet1967; [2025-03-04 05:49:05,296 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18187: havoc pci_bus_write_config_byte_#t~nondet1965#1; [2025-03-04 05:49:05,461 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7344: havoc #t~mem5;havoc #t~bitwise6; [2025-03-04 05:49:05,474 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13086: #res#1.base, #res#1.offset := ~ldv_func_res~1#1.base, ~ldv_func_res~1#1.offset; [2025-03-04 05:49:05,474 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18124: havoc atm_dev_register_#t~ret1957#1.base, atm_dev_register_#t~ret1957#1.offset; [2025-03-04 05:49:05,556 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8607: call ULTIMATE.dealloc(~#master_ctrl~0#1.base, ~#master_ctrl~0#1.offset);havoc ~#master_ctrl~0#1.base, ~#master_ctrl~0#1.offset; [2025-03-04 05:49:05,556 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18183: havoc pci_bus_read_config_byte_#t~nondet1964#1; [2025-03-04 05:49:05,944 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9390: call ULTIMATE.dealloc(~#tpd_haddr~0#1.base, ~#tpd_haddr~0#1.offset);havoc ~#tpd_haddr~0#1.base, ~#tpd_haddr~0#1.offset; [2025-03-04 05:49:06,057 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7553: havoc is_device_dma_capable_#t~mem64#1.base, is_device_dma_capable_#t~mem64#1.offset;havoc is_device_dma_capable_#t~mem65#1.base, is_device_dma_capable_#t~mem65#1.offset;havoc is_device_dma_capable_#t~mem66#1;havoc is_device_dma_capable_#t~short67#1; [2025-03-04 05:49:06,065 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18176: havoc #t~nondet1963; [2025-03-04 05:49:07,158 INFO L? ?]: Removed 3638 outVars from TransFormulas that were not future-live. [2025-03-04 05:49:07,158 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 05:49:07,238 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 05:49:07,238 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 05:49:07,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 05:49:07 BoogieIcfgContainer [2025-03-04 05:49:07,239 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 05:49:07,241 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 05:49:07,241 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 05:49:07,246 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 05:49:07,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 05:48:45" (1/3) ... [2025-03-04 05:49:07,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6960ab5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 05:49:07, skipping insertion in model container [2025-03-04 05:49:07,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:48:50" (2/3) ... [2025-03-04 05:49:07,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6960ab5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 05:49:07, skipping insertion in model container [2025-03-04 05:49:07,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 05:49:07" (3/3) ... [2025-03-04 05:49:07,248 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i [2025-03-04 05:49:07,264 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 05:49:07,268 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i that has 163 procedures, 2326 locations, 1 initial locations, 101 loop locations, and 30 error locations. [2025-03-04 05:49:07,381 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 05:49:07,393 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;@16c8d2af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 05:49:07,394 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-03-04 05:49:07,405 INFO L276 IsEmpty]: Start isEmpty. Operand has 2140 states, 1444 states have (on average 1.299168975069252) internal successors, (1876), 1519 states have internal predecessors, (1876), 541 states have call successors, (541), 125 states have call predecessors, (541), 124 states have return successors, (536), 527 states have call predecessors, (536), 536 states have call successors, (536) [2025-03-04 05:49:07,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 05:49:07,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:49:07,416 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2025-03-04 05:49:07,416 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-04 05:49:07,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:49:07,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1954485232, now seen corresponding path program 1 times [2025-03-04 05:49:07,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:49:07,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035758993] [2025-03-04 05:49:07,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:49:07,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:49:08,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 05:49:08,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 05:49:08,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:49:08,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:49:09,063 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:49:09,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:49:09,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035758993] [2025-03-04 05:49:09,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035758993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:49:09,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:49:09,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:49:09,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416524053] [2025-03-04 05:49:09,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:49:09,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:49:09,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:49:09,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:49:09,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:49:09,096 INFO L87 Difference]: Start difference. First operand has 2140 states, 1444 states have (on average 1.299168975069252) internal successors, (1876), 1519 states have internal predecessors, (1876), 541 states have call successors, (541), 125 states have call predecessors, (541), 124 states have return successors, (536), 527 states have call predecessors, (536), 536 states have call successors, (536) Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-04 05:49:09,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:49:09,556 INFO L93 Difference]: Finished difference Result 6349 states and 9110 transitions. [2025-03-04 05:49:09,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:49:09,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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 69 [2025-03-04 05:49:09,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:49:09,605 INFO L225 Difference]: With dead ends: 6349 [2025-03-04 05:49:09,605 INFO L226 Difference]: Without dead ends: 4213 [2025-03-04 05:49:09,625 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-04 05:49:09,627 INFO L435 NwaCegarLoop]: 2960 mSDtfsCounter, 2860 mSDsluCounter, 5812 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2860 SdHoareTripleChecker+Valid, 8772 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:49:09,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2860 Valid, 8772 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:49:09,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4213 states. [2025-03-04 05:49:09,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4213 to 4021. [2025-03-04 05:49:09,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4021 states, 2738 states have (on average 1.2669831994156318) internal successors, (3469), 2853 states have internal predecessors, (3469), 1025 states have call successors, (1025), 229 states have call predecessors, (1025), 228 states have return successors, (1056), 1003 states have call predecessors, (1056), 1023 states have call successors, (1056) [2025-03-04 05:49:09,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4021 states to 4021 states and 5550 transitions. [2025-03-04 05:49:09,973 INFO L78 Accepts]: Start accepts. Automaton has 4021 states and 5550 transitions. Word has length 69 [2025-03-04 05:49:09,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:49:09,973 INFO L471 AbstractCegarLoop]: Abstraction has 4021 states and 5550 transitions. [2025-03-04 05:49:09,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-04 05:49:09,974 INFO L276 IsEmpty]: Start isEmpty. Operand 4021 states and 5550 transitions. [2025-03-04 05:49:09,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-04 05:49:09,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:49:09,978 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2025-03-04 05:49:09,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 05:49:09,978 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-04 05:49:09,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:49:09,979 INFO L85 PathProgramCache]: Analyzing trace with hash -2038614424, now seen corresponding path program 1 times [2025-03-04 05:49:09,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:49:09,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819481303] [2025-03-04 05:49:09,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:49:09,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:49:10,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-04 05:49:10,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 05:49:10,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:49:10,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:49:10,886 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:49:10,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:49:10,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819481303] [2025-03-04 05:49:10,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819481303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:49:10,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:49:10,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:49:10,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642214242] [2025-03-04 05:49:10,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:49:10,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:49:10,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:49:10,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:49:10,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:49:10,890 INFO L87 Difference]: Start difference. First operand 4021 states and 5550 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-04 05:49:11,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:49:11,235 INFO L93 Difference]: Finished difference Result 4021 states and 5550 transitions. [2025-03-04 05:49:11,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:49:11,236 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 75 [2025-03-04 05:49:11,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:49:11,261 INFO L225 Difference]: With dead ends: 4021 [2025-03-04 05:49:11,262 INFO L226 Difference]: Without dead ends: 4019 [2025-03-04 05:49:11,266 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-04 05:49:11,267 INFO L435 NwaCegarLoop]: 2858 mSDtfsCounter, 2845 mSDsluCounter, 2857 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2845 SdHoareTripleChecker+Valid, 5715 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:49:11,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2845 Valid, 5715 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:49:11,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4019 states. [2025-03-04 05:49:11,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4019 to 4019. [2025-03-04 05:49:11,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4019 states, 2737 states have (on average 1.266715381804896) internal successors, (3467), 2851 states have internal predecessors, (3467), 1025 states have call successors, (1025), 229 states have call predecessors, (1025), 228 states have return successors, (1056), 1003 states have call predecessors, (1056), 1023 states have call successors, (1056) [2025-03-04 05:49:11,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4019 states to 4019 states and 5548 transitions. [2025-03-04 05:49:11,462 INFO L78 Accepts]: Start accepts. Automaton has 4019 states and 5548 transitions. Word has length 75 [2025-03-04 05:49:11,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:49:11,464 INFO L471 AbstractCegarLoop]: Abstraction has 4019 states and 5548 transitions. [2025-03-04 05:49:11,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-04 05:49:11,464 INFO L276 IsEmpty]: Start isEmpty. Operand 4019 states and 5548 transitions. [2025-03-04 05:49:11,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-04 05:49:11,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:49:11,469 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2025-03-04 05:49:11,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 05:49:11,469 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-04 05:49:11,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:49:11,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1090792899, now seen corresponding path program 1 times [2025-03-04 05:49:11,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:49:11,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338035378] [2025-03-04 05:49:11,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:49:11,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:49:11,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 05:49:11,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 05:49:11,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:49:11,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:49:12,196 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:49:12,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:49:12,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338035378] [2025-03-04 05:49:12,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338035378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:49:12,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:49:12,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:49:12,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301080115] [2025-03-04 05:49:12,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:49:12,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:49:12,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:49:12,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:49:12,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:49:12,198 INFO L87 Difference]: Start difference. First operand 4019 states and 5548 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-04 05:49:12,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:49:12,411 INFO L93 Difference]: Finished difference Result 4019 states and 5548 transitions. [2025-03-04 05:49:12,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:49:12,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 81 [2025-03-04 05:49:12,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:49:12,435 INFO L225 Difference]: With dead ends: 4019 [2025-03-04 05:49:12,436 INFO L226 Difference]: Without dead ends: 4017 [2025-03-04 05:49:12,439 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-04 05:49:12,439 INFO L435 NwaCegarLoop]: 2856 mSDtfsCounter, 2842 mSDsluCounter, 2855 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2842 SdHoareTripleChecker+Valid, 5711 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:49:12,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2842 Valid, 5711 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:49:12,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4017 states. [2025-03-04 05:49:12,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4017 to 4017. [2025-03-04 05:49:12,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4017 states, 2736 states have (on average 1.2664473684210527) internal successors, (3465), 2849 states have internal predecessors, (3465), 1025 states have call successors, (1025), 229 states have call predecessors, (1025), 228 states have return successors, (1056), 1003 states have call predecessors, (1056), 1023 states have call successors, (1056) [2025-03-04 05:49:12,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4017 states to 4017 states and 5546 transitions. [2025-03-04 05:49:12,625 INFO L78 Accepts]: Start accepts. Automaton has 4017 states and 5546 transitions. Word has length 81 [2025-03-04 05:49:12,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:49:12,627 INFO L471 AbstractCegarLoop]: Abstraction has 4017 states and 5546 transitions. [2025-03-04 05:49:12,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-04 05:49:12,627 INFO L276 IsEmpty]: Start isEmpty. Operand 4017 states and 5546 transitions. [2025-03-04 05:49:12,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-04 05:49:12,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:49:12,630 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2025-03-04 05:49:12,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 05:49:12,630 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-04 05:49:12,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:49:12,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1858761302, now seen corresponding path program 1 times [2025-03-04 05:49:12,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:49:12,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514441763] [2025-03-04 05:49:12,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:49:12,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:49:13,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-04 05:49:13,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 05:49:13,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:49:13,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:49:13,618 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:49:13,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:49:13,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514441763] [2025-03-04 05:49:13,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514441763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:49:13,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:49:13,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:49:13,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765321615] [2025-03-04 05:49:13,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:49:13,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:49:13,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:49:13,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:49:13,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:49:13,620 INFO L87 Difference]: Start difference. First operand 4017 states and 5546 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-04 05:49:13,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:49:13,801 INFO L93 Difference]: Finished difference Result 4017 states and 5546 transitions. [2025-03-04 05:49:13,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:49:13,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 87 [2025-03-04 05:49:13,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:49:13,824 INFO L225 Difference]: With dead ends: 4017 [2025-03-04 05:49:13,824 INFO L226 Difference]: Without dead ends: 4015 [2025-03-04 05:49:13,827 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-04 05:49:13,827 INFO L435 NwaCegarLoop]: 2854 mSDtfsCounter, 2839 mSDsluCounter, 2853 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2839 SdHoareTripleChecker+Valid, 5707 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:49:13,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2839 Valid, 5707 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:49:13,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4015 states. [2025-03-04 05:49:13,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4015 to 4015. [2025-03-04 05:49:13,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4015 states, 2735 states have (on average 1.26617915904936) internal successors, (3463), 2847 states have internal predecessors, (3463), 1025 states have call successors, (1025), 229 states have call predecessors, (1025), 228 states have return successors, (1056), 1003 states have call predecessors, (1056), 1023 states have call successors, (1056) [2025-03-04 05:49:14,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4015 states to 4015 states and 5544 transitions. [2025-03-04 05:49:14,017 INFO L78 Accepts]: Start accepts. Automaton has 4015 states and 5544 transitions. Word has length 87 [2025-03-04 05:49:14,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:49:14,017 INFO L471 AbstractCegarLoop]: Abstraction has 4015 states and 5544 transitions. [2025-03-04 05:49:14,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-04 05:49:14,017 INFO L276 IsEmpty]: Start isEmpty. Operand 4015 states and 5544 transitions. [2025-03-04 05:49:14,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-04 05:49:14,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:49:14,019 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2025-03-04 05:49:14,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 05:49:14,019 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-04 05:49:14,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:49:14,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1637011576, now seen corresponding path program 1 times [2025-03-04 05:49:14,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:49:14,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626147499] [2025-03-04 05:49:14,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:49:14,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:49:14,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 05:49:14,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 05:49:14,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:49:14,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:49:14,849 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:49:14,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:49:14,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626147499] [2025-03-04 05:49:14,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626147499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:49:14,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:49:14,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:49:14,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945639996] [2025-03-04 05:49:14,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:49:14,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:49:14,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:49:14,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:49:14,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:49:14,851 INFO L87 Difference]: Start difference. First operand 4015 states and 5544 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-04 05:49:15,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:49:15,051 INFO L93 Difference]: Finished difference Result 4015 states and 5544 transitions. [2025-03-04 05:49:15,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:49:15,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 93 [2025-03-04 05:49:15,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:49:15,076 INFO L225 Difference]: With dead ends: 4015 [2025-03-04 05:49:15,076 INFO L226 Difference]: Without dead ends: 4013 [2025-03-04 05:49:15,079 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-04 05:49:15,080 INFO L435 NwaCegarLoop]: 2852 mSDtfsCounter, 2836 mSDsluCounter, 2851 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2836 SdHoareTripleChecker+Valid, 5703 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:49:15,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2836 Valid, 5703 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:49:15,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4013 states. [2025-03-04 05:49:15,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4013 to 4013. [2025-03-04 05:49:15,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4013 states, 2734 states have (on average 1.2659107534747622) internal successors, (3461), 2845 states have internal predecessors, (3461), 1025 states have call successors, (1025), 229 states have call predecessors, (1025), 228 states have return successors, (1056), 1003 states have call predecessors, (1056), 1023 states have call successors, (1056) [2025-03-04 05:49:15,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4013 states to 4013 states and 5542 transitions. [2025-03-04 05:49:15,246 INFO L78 Accepts]: Start accepts. Automaton has 4013 states and 5542 transitions. Word has length 93 [2025-03-04 05:49:15,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:49:15,247 INFO L471 AbstractCegarLoop]: Abstraction has 4013 states and 5542 transitions. [2025-03-04 05:49:15,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-04 05:49:15,248 INFO L276 IsEmpty]: Start isEmpty. Operand 4013 states and 5542 transitions. [2025-03-04 05:49:15,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 05:49:15,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:49:15,249 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 05:49:15,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 05:49:15,249 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-04 05:49:15,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:49:15,250 INFO L85 PathProgramCache]: Analyzing trace with hash -663449669, now seen corresponding path program 1 times [2025-03-04 05:49:15,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:49:15,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812128951] [2025-03-04 05:49:15,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:49:15,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:49:15,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 05:49:16,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 05:49:16,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:49:16,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:49:17,315 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-04 05:49:17,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:49:17,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812128951] [2025-03-04 05:49:17,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812128951] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:49:17,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081929716] [2025-03-04 05:49:17,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:49:17,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:49:17,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:49:17,318 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-04 05:49:17,320 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-04 05:49:18,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 05:49:18,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 05:49:18,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:49:18,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:49:18,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 2133 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-04 05:49:18,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 05:49:18,935 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 53 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 05:49:18,935 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 05:49:19,204 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-04 05:49:19,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081929716] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 05:49:19,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 05:49:19,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 20 [2025-03-04 05:49:19,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122371557] [2025-03-04 05:49:19,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 05:49:19,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 05:49:19,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:49:19,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 05:49:19,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2025-03-04 05:49:19,206 INFO L87 Difference]: Start difference. First operand 4013 states and 5542 transitions. Second operand has 20 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 18 states have internal predecessors, (69), 7 states have call successors, (24), 2 states have call predecessors, (24), 5 states have return successors, (24), 8 states have call predecessors, (24), 7 states have call successors, (24) [2025-03-04 05:49:20,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:49:20,403 INFO L93 Difference]: Finished difference Result 4993 states and 6721 transitions. [2025-03-04 05:49:20,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 05:49:20,403 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 18 states have internal predecessors, (69), 7 states have call successors, (24), 2 states have call predecessors, (24), 5 states have return successors, (24), 8 states have call predecessors, (24), 7 states have call successors, (24) Word has length 104 [2025-03-04 05:49:20,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:49:20,424 INFO L225 Difference]: With dead ends: 4993 [2025-03-04 05:49:20,425 INFO L226 Difference]: Without dead ends: 4030 [2025-03-04 05:49:20,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2025-03-04 05:49:20,431 INFO L435 NwaCegarLoop]: 2818 mSDtfsCounter, 4 mSDsluCounter, 47795 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 50613 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 05:49:20,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 50613 Invalid, 1045 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 05:49:20,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4030 states. [2025-03-04 05:49:20,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4030 to 4027. [2025-03-04 05:49:20,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4027 states, 2744 states have (on average 1.2649416909620992) internal successors, (3471), 2855 states have internal predecessors, (3471), 1029 states have call successors, (1029), 229 states have call predecessors, (1029), 228 states have return successors, (1060), 1007 states have call predecessors, (1060), 1027 states have call successors, (1060) [2025-03-04 05:49:20,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4027 states to 4027 states and 5560 transitions. [2025-03-04 05:49:20,627 INFO L78 Accepts]: Start accepts. Automaton has 4027 states and 5560 transitions. Word has length 104 [2025-03-04 05:49:20,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:49:20,627 INFO L471 AbstractCegarLoop]: Abstraction has 4027 states and 5560 transitions. [2025-03-04 05:49:20,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 18 states have internal predecessors, (69), 7 states have call successors, (24), 2 states have call predecessors, (24), 5 states have return successors, (24), 8 states have call predecessors, (24), 7 states have call successors, (24) [2025-03-04 05:49:20,628 INFO L276 IsEmpty]: Start isEmpty. Operand 4027 states and 5560 transitions. [2025-03-04 05:49:20,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 05:49:20,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:49:20,629 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2025-03-04 05:49:20,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 05:49:20,830 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,SelfDestructingSolverStorable5 [2025-03-04 05:49:20,830 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-04 05:49:20,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:49:20,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1686495696, now seen corresponding path program 1 times [2025-03-04 05:49:20,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:49:20,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118834013] [2025-03-04 05:49:20,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:49:20,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:49:21,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 05:49:21,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 05:49:21,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:49:21,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:49:21,727 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:49:21,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:49:21,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118834013] [2025-03-04 05:49:21,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118834013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:49:21,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:49:21,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:49:21,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149082280] [2025-03-04 05:49:21,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:49:21,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:49:21,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:49:21,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:49:21,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:49:21,730 INFO L87 Difference]: Start difference. First operand 4027 states and 5560 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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-04 05:49:21,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:49:21,914 INFO L93 Difference]: Finished difference Result 4027 states and 5560 transitions. [2025-03-04 05:49:21,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:49:21,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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 99 [2025-03-04 05:49:21,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:49:21,950 INFO L225 Difference]: With dead ends: 4027 [2025-03-04 05:49:21,953 INFO L226 Difference]: Without dead ends: 4025 [2025-03-04 05:49:21,957 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-04 05:49:21,958 INFO L435 NwaCegarLoop]: 2850 mSDtfsCounter, 2833 mSDsluCounter, 2849 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2833 SdHoareTripleChecker+Valid, 5699 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:49:21,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2833 Valid, 5699 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:49:21,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4025 states. [2025-03-04 05:49:22,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4025 to 4025. [2025-03-04 05:49:22,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4025 states, 2743 states have (on average 1.2646737149106817) internal successors, (3469), 2853 states have internal predecessors, (3469), 1029 states have call successors, (1029), 229 states have call predecessors, (1029), 228 states have return successors, (1060), 1007 states have call predecessors, (1060), 1027 states have call successors, (1060) [2025-03-04 05:49:22,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4025 states to 4025 states and 5558 transitions. [2025-03-04 05:49:22,153 INFO L78 Accepts]: Start accepts. Automaton has 4025 states and 5558 transitions. Word has length 99 [2025-03-04 05:49:22,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:49:22,154 INFO L471 AbstractCegarLoop]: Abstraction has 4025 states and 5558 transitions. [2025-03-04 05:49:22,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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-04 05:49:22,154 INFO L276 IsEmpty]: Start isEmpty. Operand 4025 states and 5558 transitions. [2025-03-04 05:49:22,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 05:49:22,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:49:22,155 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2025-03-04 05:49:22,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 05:49:22,156 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-04 05:49:22,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:49:22,158 INFO L85 PathProgramCache]: Analyzing trace with hash -931741421, now seen corresponding path program 1 times [2025-03-04 05:49:22,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:49:22,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372488568] [2025-03-04 05:49:22,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:49:22,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:49:22,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 05:49:22,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 05:49:22,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:49:22,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:49:22,755 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-04 05:49:22,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:49:22,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372488568] [2025-03-04 05:49:22,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372488568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:49:22,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:49:22,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 05:49:22,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301461378] [2025-03-04 05:49:22,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:49:22,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 05:49:22,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:49:22,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 05:49:22,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 05:49:22,757 INFO L87 Difference]: Start difference. First operand 4025 states and 5558 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 05:49:23,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:49:23,074 INFO L93 Difference]: Finished difference Result 8007 states and 11057 transitions. [2025-03-04 05:49:23,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 05:49:23,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 120 [2025-03-04 05:49:23,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:49:23,111 INFO L225 Difference]: With dead ends: 8007 [2025-03-04 05:49:23,111 INFO L226 Difference]: Without dead ends: 4019 [2025-03-04 05:49:23,124 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-04 05:49:23,125 INFO L435 NwaCegarLoop]: 2846 mSDtfsCounter, 2852 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2852 SdHoareTripleChecker+Valid, 2846 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:49:23,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2852 Valid, 2846 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:49:23,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4019 states. [2025-03-04 05:49:23,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4019 to 4019. [2025-03-04 05:49:23,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4019 states, 2738 states have (on average 1.2636961285609933) internal successors, (3460), 2847 states have internal predecessors, (3460), 1029 states have call successors, (1029), 229 states have call predecessors, (1029), 228 states have return successors, (1060), 1007 states have call predecessors, (1060), 1027 states have call successors, (1060) [2025-03-04 05:49:23,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4019 states to 4019 states and 5549 transitions. [2025-03-04 05:49:23,408 INFO L78 Accepts]: Start accepts. Automaton has 4019 states and 5549 transitions. Word has length 120 [2025-03-04 05:49:23,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:49:23,409 INFO L471 AbstractCegarLoop]: Abstraction has 4019 states and 5549 transitions. [2025-03-04 05:49:23,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 05:49:23,409 INFO L276 IsEmpty]: Start isEmpty. Operand 4019 states and 5549 transitions. [2025-03-04 05:49:23,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-04 05:49:23,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:49:23,410 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2025-03-04 05:49:23,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 05:49:23,410 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-04 05:49:23,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:49:23,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1842703019, now seen corresponding path program 1 times [2025-03-04 05:49:23,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:49:23,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934261928] [2025-03-04 05:49:23,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:49:23,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:49:23,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 05:49:23,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 05:49:23,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:49:23,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:49:24,053 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:49:24,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:49:24,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934261928] [2025-03-04 05:49:24,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934261928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:49:24,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:49:24,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:49:24,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103079384] [2025-03-04 05:49:24,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:49:24,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:49:24,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:49:24,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:49:24,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:49:24,056 INFO L87 Difference]: Start difference. First operand 4019 states and 5549 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, (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-04 05:49:24,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:49:24,250 INFO L93 Difference]: Finished difference Result 4019 states and 5549 transitions. [2025-03-04 05:49:24,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:49:24,251 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, (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 105 [2025-03-04 05:49:24,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:49:24,268 INFO L225 Difference]: With dead ends: 4019 [2025-03-04 05:49:24,269 INFO L226 Difference]: Without dead ends: 4017 [2025-03-04 05:49:24,273 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-04 05:49:24,274 INFO L435 NwaCegarLoop]: 2843 mSDtfsCounter, 2825 mSDsluCounter, 2842 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2825 SdHoareTripleChecker+Valid, 5685 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:49:24,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2825 Valid, 5685 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:49:24,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4017 states. [2025-03-04 05:49:24,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4017 to 4017. [2025-03-04 05:49:24,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4017 states, 2737 states have (on average 1.2634271099744245) internal successors, (3458), 2845 states have internal predecessors, (3458), 1029 states have call successors, (1029), 229 states have call predecessors, (1029), 228 states have return successors, (1060), 1007 states have call predecessors, (1060), 1027 states have call successors, (1060) [2025-03-04 05:49:24,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4017 states to 4017 states and 5547 transitions. [2025-03-04 05:49:24,517 INFO L78 Accepts]: Start accepts. Automaton has 4017 states and 5547 transitions. Word has length 105 [2025-03-04 05:49:24,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:49:24,521 INFO L471 AbstractCegarLoop]: Abstraction has 4017 states and 5547 transitions. [2025-03-04 05:49:24,522 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, (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-04 05:49:24,522 INFO L276 IsEmpty]: Start isEmpty. Operand 4017 states and 5547 transitions. [2025-03-04 05:49:24,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-04 05:49:24,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:49:24,529 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-04 05:49:24,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 05:49:24,529 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-04 05:49:24,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:49:24,529 INFO L85 PathProgramCache]: Analyzing trace with hash 2077155890, now seen corresponding path program 1 times [2025-03-04 05:49:24,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:49:24,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852164011] [2025-03-04 05:49:24,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:49:24,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:49:25,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-04 05:49:25,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 05:49:25,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:49:25,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:49:25,195 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-03-04 05:49:25,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:49:25,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852164011] [2025-03-04 05:49:25,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852164011] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:49:25,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198810882] [2025-03-04 05:49:25,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:49:25,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:49:25,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:49:25,199 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-04 05:49:25,200 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-04 05:49:26,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-04 05:49:26,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 05:49:26,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:49:26,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:49:26,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 2391 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 05:49:26,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 05:49:26,854 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-04 05:49:26,855 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 05:49:26,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198810882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:49:26,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 05:49:26,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-04 05:49:26,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524485555] [2025-03-04 05:49:26,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:49:26,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 05:49:26,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:49:26,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 05:49:26,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 05:49:26,856 INFO L87 Difference]: Start difference. First operand 4017 states and 5547 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 05:49:27,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:49:27,296 INFO L93 Difference]: Finished difference Result 7991 states and 11035 transitions. [2025-03-04 05:49:27,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 05:49:27,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 126 [2025-03-04 05:49:27,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:49:27,316 INFO L225 Difference]: With dead ends: 7991 [2025-03-04 05:49:27,316 INFO L226 Difference]: Without dead ends: 4011 [2025-03-04 05:49:27,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 126 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-04 05:49:27,331 INFO L435 NwaCegarLoop]: 2839 mSDtfsCounter, 2834 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2834 SdHoareTripleChecker+Valid, 2839 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:49:27,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2834 Valid, 2839 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:49:27,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4011 states. [2025-03-04 05:49:27,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4011 to 4011. [2025-03-04 05:49:27,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4011 states, 2732 states have (on average 1.2624450951683748) internal successors, (3449), 2839 states have internal predecessors, (3449), 1029 states have call successors, (1029), 229 states have call predecessors, (1029), 228 states have return successors, (1060), 1007 states have call predecessors, (1060), 1027 states have call successors, (1060) [2025-03-04 05:49:27,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4011 states to 4011 states and 5538 transitions. [2025-03-04 05:49:27,531 INFO L78 Accepts]: Start accepts. Automaton has 4011 states and 5538 transitions. Word has length 126 [2025-03-04 05:49:27,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:49:27,531 INFO L471 AbstractCegarLoop]: Abstraction has 4011 states and 5538 transitions. [2025-03-04 05:49:27,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 05:49:27,532 INFO L276 IsEmpty]: Start isEmpty. Operand 4011 states and 5538 transitions. [2025-03-04 05:49:27,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 05:49:27,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:49:27,533 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2025-03-04 05:49:27,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 05:49:27,737 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,SelfDestructingSolverStorable9 [2025-03-04 05:49:27,737 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_check_alloc_flagsErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-04 05:49:27,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:49:27,738 INFO L85 PathProgramCache]: Analyzing trace with hash -272033981, now seen corresponding path program 1 times [2025-03-04 05:49:27,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:49:27,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464428132] [2025-03-04 05:49:27,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:49:27,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:49:28,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 05:49:28,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 05:49:28,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:49:28,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:49:28,297 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-04 05:49:28,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:49:28,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464428132] [2025-03-04 05:49:28,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464428132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:49:28,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:49:28,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 05:49:28,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043869839] [2025-03-04 05:49:28,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:49:28,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 05:49:28,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:49:28,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 05:49:28,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:49:28,299 INFO L87 Difference]: Start difference. First operand 4011 states and 5538 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 05:49:28,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:49:28,710 INFO L93 Difference]: Finished difference Result 7991 states and 11071 transitions. [2025-03-04 05:49:28,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 05:49:28,711 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2025-03-04 05:49:28,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:49:28,748 INFO L225 Difference]: With dead ends: 7991 [2025-03-04 05:49:28,752 INFO L226 Difference]: Without dead ends: 4017 [2025-03-04 05:49:28,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:49:28,780 INFO L435 NwaCegarLoop]: 2837 mSDtfsCounter, 0 mSDsluCounter, 8504 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11341 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:49:28,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11341 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:49:28,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4017 states. [2025-03-04 05:49:28,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4017 to 4017. [2025-03-04 05:49:28,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4017 states, 2738 states have (on average 1.2618699780861944) internal successors, (3455), 2845 states have internal predecessors, (3455), 1029 states have call successors, (1029), 229 states have call predecessors, (1029), 228 states have return successors, (1060), 1007 states have call predecessors, (1060), 1027 states have call successors, (1060) [2025-03-04 05:49:29,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4017 states to 4017 states and 5544 transitions. [2025-03-04 05:49:29,020 INFO L78 Accepts]: Start accepts. Automaton has 4017 states and 5544 transitions. Word has length 130 [2025-03-04 05:49:29,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:49:29,021 INFO L471 AbstractCegarLoop]: Abstraction has 4017 states and 5544 transitions. [2025-03-04 05:49:29,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 05:49:29,021 INFO L276 IsEmpty]: Start isEmpty. Operand 4017 states and 5544 transitions. [2025-03-04 05:49:29,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 05:49:29,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:49:29,022 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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-04 05:49:29,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 05:49:29,022 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-04 05:49:29,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:49:29,023 INFO L85 PathProgramCache]: Analyzing trace with hash -17075403, now seen corresponding path program 1 times [2025-03-04 05:49:29,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:49:29,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751952027] [2025-03-04 05:49:29,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:49:29,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:49:29,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 05:49:29,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 05:49:29,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:49:29,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:49:29,607 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:49:29,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:49:29,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751952027] [2025-03-04 05:49:29,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751952027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:49:29,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:49:29,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:49:29,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062565122] [2025-03-04 05:49:29,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:49:29,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:49:29,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:49:29,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:49:29,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:49:29,608 INFO L87 Difference]: Start difference. First operand 4017 states and 5544 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, (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-04 05:49:29,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:49:29,800 INFO L93 Difference]: Finished difference Result 4017 states and 5544 transitions. [2025-03-04 05:49:29,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:49:29,830 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, (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 111 [2025-03-04 05:49:29,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:49:29,844 INFO L225 Difference]: With dead ends: 4017 [2025-03-04 05:49:29,844 INFO L226 Difference]: Without dead ends: 4015 [2025-03-04 05:49:29,845 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-04 05:49:29,846 INFO L435 NwaCegarLoop]: 2836 mSDtfsCounter, 2817 mSDsluCounter, 2835 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2817 SdHoareTripleChecker+Valid, 5671 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:49:29,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2817 Valid, 5671 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:49:29,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4015 states. [2025-03-04 05:49:30,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4015 to 4015. [2025-03-04 05:49:30,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4015 states, 2737 states have (on average 1.2616002922908294) internal successors, (3453), 2843 states have internal predecessors, (3453), 1029 states have call successors, (1029), 229 states have call predecessors, (1029), 228 states have return successors, (1060), 1007 states have call predecessors, (1060), 1027 states have call successors, (1060) [2025-03-04 05:49:30,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4015 states to 4015 states and 5542 transitions. [2025-03-04 05:49:30,318 INFO L78 Accepts]: Start accepts. Automaton has 4015 states and 5542 transitions. Word has length 111 [2025-03-04 05:49:30,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:49:30,322 INFO L471 AbstractCegarLoop]: Abstraction has 4015 states and 5542 transitions. [2025-03-04 05:49:30,323 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, (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-04 05:49:30,323 INFO L276 IsEmpty]: Start isEmpty. Operand 4015 states and 5542 transitions. [2025-03-04 05:49:30,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-04 05:49:30,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:49:30,325 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2025-03-04 05:49:30,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 05:49:30,325 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_check_alloc_flagsErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-04 05:49:30,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:49:30,325 INFO L85 PathProgramCache]: Analyzing trace with hash 665390423, now seen corresponding path program 1 times [2025-03-04 05:49:30,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:49:30,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466287713] [2025-03-04 05:49:30,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:49:30,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:49:30,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 05:49:30,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 05:49:30,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:49:30,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:49:31,511 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-04 05:49:31,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:49:31,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466287713] [2025-03-04 05:49:31,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466287713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:49:31,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:49:31,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 05:49:31,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684297106] [2025-03-04 05:49:31,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:49:31,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 05:49:31,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:49:31,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 05:49:31,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 05:49:31,513 INFO L87 Difference]: Start difference. First operand 4015 states and 5542 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 05:49:35,538 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-04 05:49:38,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:49:38,987 INFO L93 Difference]: Finished difference Result 9273 states and 12744 transitions. [2025-03-04 05:49:38,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 05:49:38,988 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 133 [2025-03-04 05:49:38,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:49:39,006 INFO L225 Difference]: With dead ends: 9273 [2025-03-04 05:49:39,006 INFO L226 Difference]: Without dead ends: 5295 [2025-03-04 05:49:39,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-04 05:49:39,018 INFO L435 NwaCegarLoop]: 2835 mSDtfsCounter, 2785 mSDsluCounter, 8268 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2786 SdHoareTripleChecker+Valid, 11103 SdHoareTripleChecker+Invalid, 1155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2025-03-04 05:49:39,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2786 Valid, 11103 Invalid, 1155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1153 Invalid, 1 Unknown, 0 Unchecked, 7.0s Time] [2025-03-04 05:49:39,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5295 states. [2025-03-04 05:49:39,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5295 to 5281. [2025-03-04 05:49:39,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5281 states, 3595 states have (on average 1.25452016689847) internal successors, (4510), 3731 states have internal predecessors, (4510), 1311 states have call successors, (1311), 355 states have call predecessors, (1311), 354 states have return successors, (1349), 1277 states have call predecessors, (1349), 1309 states have call successors, (1349) [2025-03-04 05:49:39,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5281 states to 5281 states and 7170 transitions. [2025-03-04 05:49:39,282 INFO L78 Accepts]: Start accepts. Automaton has 5281 states and 7170 transitions. Word has length 133 [2025-03-04 05:49:39,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:49:39,283 INFO L471 AbstractCegarLoop]: Abstraction has 5281 states and 7170 transitions. [2025-03-04 05:49:39,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 05:49:39,283 INFO L276 IsEmpty]: Start isEmpty. Operand 5281 states and 7170 transitions. [2025-03-04 05:49:39,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-04 05:49:39,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:49:39,285 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2025-03-04 05:49:39,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 05:49:39,285 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_check_alloc_flagsErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-04 05:49:39,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:49:39,286 INFO L85 PathProgramCache]: Analyzing trace with hash 665420214, now seen corresponding path program 1 times [2025-03-04 05:49:39,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:49:39,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777805147] [2025-03-04 05:49:39,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:49:39,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:49:39,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 05:49:39,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 05:49:39,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:49:39,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:49:39,944 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-04 05:49:39,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:49:39,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777805147] [2025-03-04 05:49:39,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777805147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:49:39,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:49:39,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:49:39,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118152794] [2025-03-04 05:49:39,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:49:39,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:49:39,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:49:39,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:49:39,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:49:39,947 INFO L87 Difference]: Start difference. First operand 5281 states and 7170 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 05:49:40,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:49:40,337 INFO L93 Difference]: Finished difference Result 5287 states and 7177 transitions. [2025-03-04 05:49:40,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:49:40,338 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), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 133 [2025-03-04 05:49:40,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:49:40,362 INFO L225 Difference]: With dead ends: 5287 [2025-03-04 05:49:40,362 INFO L226 Difference]: Without dead ends: 5285 [2025-03-04 05:49:40,365 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-04 05:49:40,366 INFO L435 NwaCegarLoop]: 2836 mSDtfsCounter, 0 mSDsluCounter, 5666 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8502 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:49:40,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8502 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:49:40,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5285 states. [2025-03-04 05:49:40,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5285 to 5285. [2025-03-04 05:49:40,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5285 states, 3599 states have (on average 1.2536815782161712) internal successors, (4512), 3735 states have internal predecessors, (4512), 1311 states have call successors, (1311), 355 states have call predecessors, (1311), 354 states have return successors, (1349), 1277 states have call predecessors, (1349), 1309 states have call successors, (1349) [2025-03-04 05:49:40,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5285 states to 5285 states and 7172 transitions. [2025-03-04 05:49:40,736 INFO L78 Accepts]: Start accepts. Automaton has 5285 states and 7172 transitions. Word has length 133 [2025-03-04 05:49:40,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:49:40,737 INFO L471 AbstractCegarLoop]: Abstraction has 5285 states and 7172 transitions. [2025-03-04 05:49:40,737 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), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 05:49:40,737 INFO L276 IsEmpty]: Start isEmpty. Operand 5285 states and 7172 transitions. [2025-03-04 05:49:40,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 05:49:40,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:49:40,738 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2025-03-04 05:49:40,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 05:49:40,738 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-04 05:49:40,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:49:40,739 INFO L85 PathProgramCache]: Analyzing trace with hash 770530896, now seen corresponding path program 1 times [2025-03-04 05:49:40,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:49:40,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893651522] [2025-03-04 05:49:40,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:49:40,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:49:41,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 05:49:41,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 05:49:41,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:49:41,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:49:41,239 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:49:41,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:49:41,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893651522] [2025-03-04 05:49:41,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893651522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:49:41,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:49:41,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:49:41,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956676285] [2025-03-04 05:49:41,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:49:41,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:49:41,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:49:41,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:49:41,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:49:41,241 INFO L87 Difference]: Start difference. First operand 5285 states and 7172 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-04 05:49:41,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:49:41,502 INFO L93 Difference]: Finished difference Result 5285 states and 7172 transitions. [2025-03-04 05:49:41,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:49:41,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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 113 [2025-03-04 05:49:41,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:49:41,523 INFO L225 Difference]: With dead ends: 5285 [2025-03-04 05:49:41,523 INFO L226 Difference]: Without dead ends: 5283 [2025-03-04 05:49:41,526 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-04 05:49:41,526 INFO L435 NwaCegarLoop]: 2834 mSDtfsCounter, 2813 mSDsluCounter, 2833 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2813 SdHoareTripleChecker+Valid, 5667 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 05:49:41,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2813 Valid, 5667 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 05:49:41,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5283 states. [2025-03-04 05:49:41,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5283 to 5283. [2025-03-04 05:49:41,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5283 states, 3598 states have (on average 1.2534741523068371) internal successors, (4510), 3733 states have internal predecessors, (4510), 1311 states have call successors, (1311), 355 states have call predecessors, (1311), 354 states have return successors, (1349), 1277 states have call predecessors, (1349), 1309 states have call successors, (1349) [2025-03-04 05:49:41,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5283 states to 5283 states and 7170 transitions. [2025-03-04 05:49:41,758 INFO L78 Accepts]: Start accepts. Automaton has 5283 states and 7170 transitions. Word has length 113 [2025-03-04 05:49:41,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:49:41,759 INFO L471 AbstractCegarLoop]: Abstraction has 5283 states and 7170 transitions. [2025-03-04 05:49:41,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-04 05:49:41,759 INFO L276 IsEmpty]: Start isEmpty. Operand 5283 states and 7170 transitions. [2025-03-04 05:49:41,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-04 05:49:41,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:49:41,761 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2025-03-04 05:49:41,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 05:49:41,761 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-04 05:49:41,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:49:41,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1379582927, now seen corresponding path program 1 times [2025-03-04 05:49:41,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:49:41,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348356521] [2025-03-04 05:49:41,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:49:41,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:49:42,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-04 05:49:42,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-04 05:49:42,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:49:42,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:49:42,272 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-04 05:49:42,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:49:42,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348356521] [2025-03-04 05:49:42,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348356521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:49:42,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:49:42,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 05:49:42,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179461556] [2025-03-04 05:49:42,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:49:42,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 05:49:42,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:49:42,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 05:49:42,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 05:49:42,275 INFO L87 Difference]: Start difference. First operand 5283 states and 7170 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 05:49:42,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:49:42,510 INFO L93 Difference]: Finished difference Result 10519 states and 14358 transitions. [2025-03-04 05:49:42,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 05:49:42,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 137 [2025-03-04 05:49:42,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:49:42,531 INFO L225 Difference]: With dead ends: 10519 [2025-03-04 05:49:42,532 INFO L226 Difference]: Without dead ends: 5273 [2025-03-04 05:49:42,550 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-04 05:49:42,551 INFO L435 NwaCegarLoop]: 2830 mSDtfsCounter, 2796 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2796 SdHoareTripleChecker+Valid, 2830 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 05:49:42,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2796 Valid, 2830 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 05:49:42,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5273 states. [2025-03-04 05:49:42,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5273 to 5273. [2025-03-04 05:49:42,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5273 states, 3589 states have (on average 1.2518807467261075) internal successors, (4493), 3723 states have internal predecessors, (4493), 1311 states have call successors, (1311), 355 states have call predecessors, (1311), 354 states have return successors, (1349), 1277 states have call predecessors, (1349), 1309 states have call successors, (1349) [2025-03-04 05:49:43,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5273 states to 5273 states and 7153 transitions. [2025-03-04 05:49:43,020 INFO L78 Accepts]: Start accepts. Automaton has 5273 states and 7153 transitions. Word has length 137 [2025-03-04 05:49:43,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:49:43,022 INFO L471 AbstractCegarLoop]: Abstraction has 5273 states and 7153 transitions. [2025-03-04 05:49:43,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 05:49:43,022 INFO L276 IsEmpty]: Start isEmpty. Operand 5273 states and 7153 transitions. [2025-03-04 05:49:43,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 05:49:43,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:49:43,023 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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-04 05:49:43,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 05:49:43,024 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-04 05:49:43,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:49:43,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1237142651, now seen corresponding path program 1 times [2025-03-04 05:49:43,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:49:43,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476432141] [2025-03-04 05:49:43,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:49:43,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:49:43,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 05:49:43,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 05:49:43,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:49:43,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:49:43,776 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:49:43,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:49:43,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476432141] [2025-03-04 05:49:43,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476432141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:49:43,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:49:43,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:49:43,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37697556] [2025-03-04 05:49:43,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:49:43,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:49:43,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:49:43,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:49:43,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:49:43,779 INFO L87 Difference]: Start difference. First operand 5273 states and 7153 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-04 05:49:44,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:49:44,145 INFO L93 Difference]: Finished difference Result 5273 states and 7153 transitions. [2025-03-04 05:49:44,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:49:44,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 119 [2025-03-04 05:49:44,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:49:44,165 INFO L225 Difference]: With dead ends: 5273 [2025-03-04 05:49:44,165 INFO L226 Difference]: Without dead ends: 5271 [2025-03-04 05:49:44,167 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-04 05:49:44,168 INFO L435 NwaCegarLoop]: 2827 mSDtfsCounter, 2807 mSDsluCounter, 2826 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2807 SdHoareTripleChecker+Valid, 5653 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:49:44,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2807 Valid, 5653 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:49:44,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5271 states. [2025-03-04 05:49:44,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5271 to 5271. [2025-03-04 05:49:44,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5271 states, 3588 states have (on average 1.2516722408026757) internal successors, (4491), 3721 states have internal predecessors, (4491), 1311 states have call successors, (1311), 355 states have call predecessors, (1311), 354 states have return successors, (1349), 1277 states have call predecessors, (1349), 1309 states have call successors, (1349) [2025-03-04 05:49:44,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5271 states to 5271 states and 7151 transitions. [2025-03-04 05:49:44,432 INFO L78 Accepts]: Start accepts. Automaton has 5271 states and 7151 transitions. Word has length 119 [2025-03-04 05:49:44,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:49:44,432 INFO L471 AbstractCegarLoop]: Abstraction has 5271 states and 7151 transitions. [2025-03-04 05:49:44,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-04 05:49:44,433 INFO L276 IsEmpty]: Start isEmpty. Operand 5271 states and 7151 transitions. [2025-03-04 05:49:44,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-04 05:49:44,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:49:44,434 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2025-03-04 05:49:44,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 05:49:44,434 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-04 05:49:44,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:49:44,435 INFO L85 PathProgramCache]: Analyzing trace with hash 401703587, now seen corresponding path program 1 times [2025-03-04 05:49:44,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:49:44,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257463914] [2025-03-04 05:49:44,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:49:44,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:49:44,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 05:49:44,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 05:49:44,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:49:44,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:49:44,986 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:49:44,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:49:44,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257463914] [2025-03-04 05:49:44,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257463914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:49:44,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:49:44,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:49:44,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479877537] [2025-03-04 05:49:44,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:49:44,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:49:44,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:49:44,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:49:44,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:49:44,988 INFO L87 Difference]: Start difference. First operand 5271 states and 7151 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-04 05:49:45,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:49:45,317 INFO L93 Difference]: Finished difference Result 5271 states and 7151 transitions. [2025-03-04 05:49:45,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:49:45,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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 125 [2025-03-04 05:49:45,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:49:45,342 INFO L225 Difference]: With dead ends: 5271 [2025-03-04 05:49:45,342 INFO L226 Difference]: Without dead ends: 5269 [2025-03-04 05:49:45,345 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-04 05:49:45,346 INFO L435 NwaCegarLoop]: 2825 mSDtfsCounter, 2804 mSDsluCounter, 2824 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2804 SdHoareTripleChecker+Valid, 5649 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:49:45,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2804 Valid, 5649 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:49:45,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5269 states. [2025-03-04 05:49:45,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5269 to 5269. [2025-03-04 05:49:45,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5269 states, 3587 states have (on average 1.2514636186228045) internal successors, (4489), 3719 states have internal predecessors, (4489), 1311 states have call successors, (1311), 355 states have call predecessors, (1311), 354 states have return successors, (1349), 1277 states have call predecessors, (1349), 1309 states have call successors, (1349) [2025-03-04 05:49:45,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5269 states to 5269 states and 7149 transitions. [2025-03-04 05:49:45,625 INFO L78 Accepts]: Start accepts. Automaton has 5269 states and 7149 transitions. Word has length 125 [2025-03-04 05:49:45,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:49:45,626 INFO L471 AbstractCegarLoop]: Abstraction has 5269 states and 7149 transitions. [2025-03-04 05:49:45,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-04 05:49:45,626 INFO L276 IsEmpty]: Start isEmpty. Operand 5269 states and 7149 transitions. [2025-03-04 05:49:45,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-04 05:49:45,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:49:45,627 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2025-03-04 05:49:45,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 05:49:45,627 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-04 05:49:45,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:49:45,627 INFO L85 PathProgramCache]: Analyzing trace with hash -441113452, now seen corresponding path program 1 times [2025-03-04 05:49:45,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:49:45,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199317283] [2025-03-04 05:49:45,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:49:45,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:49:45,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 05:49:45,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 05:49:45,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:49:45,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:49:46,166 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:49:46,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:49:46,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199317283] [2025-03-04 05:49:46,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199317283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:49:46,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:49:46,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:49:46,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507983640] [2025-03-04 05:49:46,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:49:46,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:49:46,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:49:46,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:49:46,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:49:46,168 INFO L87 Difference]: Start difference. First operand 5269 states and 7149 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-04 05:49:46,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:49:46,503 INFO L93 Difference]: Finished difference Result 5269 states and 7149 transitions. [2025-03-04 05:49:46,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:49:46,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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 131 [2025-03-04 05:49:46,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:49:46,528 INFO L225 Difference]: With dead ends: 5269 [2025-03-04 05:49:46,528 INFO L226 Difference]: Without dead ends: 5267 [2025-03-04 05:49:46,531 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-04 05:49:46,532 INFO L435 NwaCegarLoop]: 2823 mSDtfsCounter, 2801 mSDsluCounter, 2822 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2801 SdHoareTripleChecker+Valid, 5645 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:49:46,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2801 Valid, 5645 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:49:46,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5267 states. [2025-03-04 05:49:46,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5267 to 5267. [2025-03-04 05:49:46,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5267 states, 3586 states have (on average 1.251254880089236) internal successors, (4487), 3717 states have internal predecessors, (4487), 1311 states have call successors, (1311), 355 states have call predecessors, (1311), 354 states have return successors, (1349), 1277 states have call predecessors, (1349), 1309 states have call successors, (1349) [2025-03-04 05:49:46,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5267 states to 5267 states and 7147 transitions. [2025-03-04 05:49:46,818 INFO L78 Accepts]: Start accepts. Automaton has 5267 states and 7147 transitions. Word has length 131 [2025-03-04 05:49:46,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:49:46,819 INFO L471 AbstractCegarLoop]: Abstraction has 5267 states and 7147 transitions. [2025-03-04 05:49:46,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-04 05:49:46,819 INFO L276 IsEmpty]: Start isEmpty. Operand 5267 states and 7147 transitions. [2025-03-04 05:49:46,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-04 05:49:46,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:49:46,821 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1] [2025-03-04 05:49:46,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 05:49:46,822 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-04 05:49:46,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:49:46,822 INFO L85 PathProgramCache]: Analyzing trace with hash -256511468, now seen corresponding path program 1 times [2025-03-04 05:49:46,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:49:46,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122807406] [2025-03-04 05:49:46,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:49:46,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:49:47,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-04 05:49:47,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-04 05:49:47,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:49:47,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:49:47,479 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:49:47,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:49:47,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122807406] [2025-03-04 05:49:47,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122807406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:49:47,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:49:47,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:49:47,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888708348] [2025-03-04 05:49:47,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:49:47,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:49:47,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:49:47,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:49:47,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:49:47,481 INFO L87 Difference]: Start difference. First operand 5267 states and 7147 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-04 05:49:48,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:49:48,033 INFO L93 Difference]: Finished difference Result 5267 states and 7147 transitions. [2025-03-04 05:49:48,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:49:48,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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 137 [2025-03-04 05:49:48,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:49:48,060 INFO L225 Difference]: With dead ends: 5267 [2025-03-04 05:49:48,060 INFO L226 Difference]: Without dead ends: 5265 [2025-03-04 05:49:48,064 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-04 05:49:48,064 INFO L435 NwaCegarLoop]: 2821 mSDtfsCounter, 2798 mSDsluCounter, 2820 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2798 SdHoareTripleChecker+Valid, 5641 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:49:48,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2798 Valid, 5641 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:49:48,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5265 states. [2025-03-04 05:49:48,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5265 to 5265. [2025-03-04 05:49:48,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5265 states, 3585 states have (on average 1.2510460251046025) internal successors, (4485), 3715 states have internal predecessors, (4485), 1311 states have call successors, (1311), 355 states have call predecessors, (1311), 354 states have return successors, (1349), 1277 states have call predecessors, (1349), 1309 states have call successors, (1349) [2025-03-04 05:49:48,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5265 states to 5265 states and 7145 transitions. [2025-03-04 05:49:48,457 INFO L78 Accepts]: Start accepts. Automaton has 5265 states and 7145 transitions. Word has length 137 [2025-03-04 05:49:48,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:49:48,457 INFO L471 AbstractCegarLoop]: Abstraction has 5265 states and 7145 transitions. [2025-03-04 05:49:48,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-04 05:49:48,458 INFO L276 IsEmpty]: Start isEmpty. Operand 5265 states and 7145 transitions. [2025-03-04 05:49:48,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-04 05:49:48,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:49:48,461 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:49:48,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 05:49:48,461 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-04 05:49:48,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:49:48,462 INFO L85 PathProgramCache]: Analyzing trace with hash 947933692, now seen corresponding path program 1 times [2025-03-04 05:49:48,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:49:48,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521138276] [2025-03-04 05:49:48,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:49:48,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:49:48,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 05:49:48,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 05:49:48,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:49:48,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:49:48,990 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:49:48,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:49:48,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521138276] [2025-03-04 05:49:48,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521138276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:49:48,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:49:48,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:49:48,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96544597] [2025-03-04 05:49:48,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:49:48,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:49:48,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:49:48,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:49:48,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:49:48,991 INFO L87 Difference]: Start difference. First operand 5265 states and 7145 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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-04 05:49:49,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:49:49,271 INFO L93 Difference]: Finished difference Result 5265 states and 7145 transitions. [2025-03-04 05:49:49,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:49:49,272 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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 143 [2025-03-04 05:49:49,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:49:49,291 INFO L225 Difference]: With dead ends: 5265 [2025-03-04 05:49:49,291 INFO L226 Difference]: Without dead ends: 5263 [2025-03-04 05:49:49,295 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-04 05:49:49,296 INFO L435 NwaCegarLoop]: 2819 mSDtfsCounter, 2795 mSDsluCounter, 2818 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2795 SdHoareTripleChecker+Valid, 5637 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 05:49:49,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2795 Valid, 5637 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 05:49:49,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5263 states. [2025-03-04 05:49:49,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5263 to 5263. [2025-03-04 05:49:49,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5263 states, 3584 states have (on average 1.2508370535714286) internal successors, (4483), 3713 states have internal predecessors, (4483), 1311 states have call successors, (1311), 355 states have call predecessors, (1311), 354 states have return successors, (1349), 1277 states have call predecessors, (1349), 1309 states have call successors, (1349) [2025-03-04 05:49:49,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5263 states to 5263 states and 7143 transitions. [2025-03-04 05:49:49,590 INFO L78 Accepts]: Start accepts. Automaton has 5263 states and 7143 transitions. Word has length 143 [2025-03-04 05:49:49,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:49:49,591 INFO L471 AbstractCegarLoop]: Abstraction has 5263 states and 7143 transitions. [2025-03-04 05:49:49,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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-04 05:49:49,591 INFO L276 IsEmpty]: Start isEmpty. Operand 5263 states and 7143 transitions. [2025-03-04 05:49:49,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-04 05:49:49,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:49:49,592 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-04 05:49:49,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 05:49:49,592 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-04 05:49:49,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:49:49,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1963627135, now seen corresponding path program 1 times [2025-03-04 05:49:49,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:49:49,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929318666] [2025-03-04 05:49:49,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:49:49,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:49:49,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-04 05:49:50,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-04 05:49:50,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:49:50,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:49:51,031 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2025-03-04 05:49:51,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:49:51,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929318666] [2025-03-04 05:49:51,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929318666] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:49:51,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438902027] [2025-03-04 05:49:51,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:49:51,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:49:51,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:49:51,035 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-04 05:49:51,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process