./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 c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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-?-c00e63d-m [2025-02-06 08:20:10,282 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 08:20:10,335 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-06 08:20:10,341 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 08:20:10,341 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 08:20:10,364 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 08:20:10,365 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 08:20:10,365 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 08:20:10,365 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 08:20:10,366 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 08:20:10,366 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 08:20:10,366 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 08:20:10,366 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 08:20:10,367 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 08:20:10,367 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 08:20:10,367 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 08:20:10,367 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 08:20:10,367 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 08:20:10,367 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 08:20:10,367 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 08:20:10,367 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 08:20:10,368 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 08:20:10,368 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 08:20:10,368 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 08:20:10,368 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 08:20:10,368 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 08:20:10,368 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 08:20:10,368 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 08:20:10,368 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 08:20:10,368 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:20:10,368 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 08:20:10,368 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 08:20:10,368 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 08:20:10,369 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 08:20:10,369 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 08:20:10,369 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 08:20:10,369 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 08:20:10,369 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 08:20:10,370 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 08:20:10,370 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 08:20:10,370 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-jdk21/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-02-06 08:20:10,592 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 08:20:10,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 08:20:10,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 08:20:10,611 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 08:20:10,611 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 08:20:10,612 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/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-02-06 08:20:11,805 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/76a393c85/00f15a65df4e4a0f8ae10a0c2b7b0448/FLAGa36ff4acf [2025-02-06 08:20:12,427 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 08:20:12,428 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i [2025-02-06 08:20:12,487 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/76a393c85/00f15a65df4e4a0f8ae10a0c2b7b0448/FLAGa36ff4acf [2025-02-06 08:20:12,873 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/76a393c85/00f15a65df4e4a0f8ae10a0c2b7b0448 [2025-02-06 08:20:12,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 08:20:12,876 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 08:20:12,877 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 08:20:12,877 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 08:20:12,880 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 08:20:12,881 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:20:12" (1/1) ... [2025-02-06 08:20:12,882 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@402bf811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:20:12, skipping insertion in model container [2025-02-06 08:20:12,882 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:20:12" (1/1) ... [2025-02-06 08:20:13,023 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 08:20:16,134 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,136 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,137 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,137 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,137 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,137 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,138 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,138 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,138 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,138 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,139 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,139 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,139 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,139 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,139 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,140 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,140 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,140 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,140 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,141 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,141 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,141 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,141 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,142 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,142 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,142 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,142 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,143 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,143 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,143 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,143 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,144 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,144 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,144 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,144 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,144 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,145 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,145 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,145 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,145 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,145 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,146 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,146 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,146 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,146 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,147 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,147 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,147 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,147 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,148 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,148 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,148 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,148 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,148 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,148 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,148 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,149 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,149 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,150 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,150 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,151 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,151 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,151 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,151 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,151 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,152 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,152 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,152 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,152 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,152 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,152 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,153 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,153 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,153 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,153 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,153 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,153 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,153 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,153 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,154 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,154 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,154 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,154 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,154 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,156 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,156 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,157 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,157 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:20:16,194 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 08:20:16,317 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-02-06 08:20:16,319 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-02-06 08:20:16,319 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("":); [7336] [2025-02-06 08:20:16,320 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-02-06 08:20:16,320 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-02-06 08:20:16,322 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-02-06 08:20:16,322 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-02-06 08:20:16,327 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-02-06 08:20:16,328 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-02-06 08:20:16,329 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-02-06 08:20:16,329 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-02-06 08:20:16,341 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("mfence": : : "memory"); [8141] [2025-02-06 08:20:16,575 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-02-06 08:20:16,575 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-02-06 08:20:16,575 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-02-06 08:20:16,576 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-02-06 08:20:16,576 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-02-06 08:20:16,576 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-02-06 08:20:16,576 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-02-06 08:20:16,577 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-02-06 08:20:16,577 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-02-06 08:20:16,577 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-02-06 08:20:16,577 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-02-06 08:20:16,577 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-02-06 08:20:16,577 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-02-06 08:20:16,578 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-02-06 08:20:16,578 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-02-06 08:20:16,711 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,711 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,711 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,711 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,712 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,712 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,712 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,712 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,712 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,712 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,713 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,713 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,713 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,713 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,714 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,714 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,714 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,714 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,714 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,714 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,715 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,715 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,715 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,715 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,716 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,716 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,716 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,716 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,716 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,716 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,717 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,717 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,717 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,717 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,717 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,718 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,718 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,718 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,718 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,718 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,718 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,718 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,718 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,719 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,719 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,719 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,719 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,719 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,719 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,719 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,720 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,720 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,720 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,720 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,720 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,720 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,721 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,721 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,721 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,721 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,722 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,722 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,722 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,722 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,722 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,723 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,723 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,723 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,723 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,723 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,723 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,724 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,724 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,724 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,724 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,725 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,725 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,725 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,725 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,725 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,726 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,726 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,726 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,726 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,726 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,727 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,727 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,727 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 08:20:16,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:20:16,931 INFO L204 MainTranslator]: Completed translation [2025-02-06 08:20:16,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:20:16 WrapperNode [2025-02-06 08:20:16,932 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 08:20:16,933 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 08:20:16,933 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 08:20:16,933 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 08:20:16,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:20:16" (1/1) ... [2025-02-06 08:20:17,019 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:20:16" (1/1) ... [2025-02-06 08:20:17,192 INFO L138 Inliner]: procedures = 673, calls = 2736, calls flagged for inlining = 296, calls inlined = 204, statements flattened = 6371 [2025-02-06 08:20:17,192 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 08:20:17,193 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 08:20:17,193 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 08:20:17,193 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 08:20:17,200 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:20:16" (1/1) ... [2025-02-06 08:20:17,200 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:20:16" (1/1) ... [2025-02-06 08:20:17,228 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:20:16" (1/1) ... [2025-02-06 08:20:18,426 INFO L175 MemorySlicer]: Split 1157 memory accesses to 38 slices as follows [5, 4, 4, 5, 6, 5, 3, 7, 3, 2, 8, 4, 1, 4, 5, 9, 8, 5, 3, 5, 3, 1, 4, 2, 4, 4, 3, 963, 1, 7, 3, 2, 6, 4, 4, 44, 4, 2]. 83 percent of accesses are in the largest equivalence class. The 123 initializations are split as follows [0, 4, 0, 5, 6, 5, 0, 0, 0, 0, 8, 4, 0, 0, 0, 0, 8, 0, 3, 5, 0, 1, 4, 2, 4, 0, 0, 8, 0, 4, 0, 0, 4, 4, 0, 44, 0, 0]. The 302 writes are split as follows [4, 0, 0, 0, 0, 0, 1, 6, 2, 1, 0, 0, 0, 2, 4, 9, 0, 4, 0, 0, 0, 0, 0, 0, 0, 3, 2, 258, 1, 0, 2, 0, 0, 0, 0, 0, 2, 1]. [2025-02-06 08:20:18,427 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:20:16" (1/1) ... [2025-02-06 08:20:18,427 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:20:16" (1/1) ... [2025-02-06 08:20:18,533 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:20:16" (1/1) ... [2025-02-06 08:20:18,545 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:20:16" (1/1) ... [2025-02-06 08:20:18,576 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:20:16" (1/1) ... [2025-02-06 08:20:18,603 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:20:16" (1/1) ... [2025-02-06 08:20:18,643 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 08:20:18,644 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 08:20:18,644 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 08:20:18,645 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 08:20:18,645 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:20:16" (1/1) ... [2025-02-06 08:20:18,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:20:18,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:20:18,671 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 08:20:18,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 08:20:18,689 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_io_instance_callback_2_25 [2025-02-06 08:20:18,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_io_instance_callback_2_25 [2025-02-06 08:20:18,689 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_supply [2025-02-06 08:20:18,689 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_supply [2025-02-06 08:20:18,689 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_sync_for_device [2025-02-06 08:20:18,689 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_sync_for_device [2025-02-06 08:20:18,689 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~u32~0~X~$Pointer$~TO~VOID [2025-02-06 08:20:18,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~u32~0~X~$Pointer$~TO~VOID [2025-02-06 08:20:18,689 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2025-02-06 08:20:18,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2025-02-06 08:20:18,689 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_register [2025-02-06 08:20:18,689 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_register [2025-02-06 08:20:18,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-02-06 08:20:18,689 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-02-06 08:20:18,689 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_unmap [2025-02-06 08:20:18,690 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_unmap [2025-02-06 08:20:18,690 INFO L130 BoogieDeclarations]: Found specification of procedure panic [2025-02-06 08:20:18,690 INFO L138 BoogieDeclarations]: Found implementation of procedure panic [2025-02-06 08:20:18,690 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-02-06 08:20:18,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-02-06 08:20:18,690 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_read [2025-02-06 08:20:18,690 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_read [2025-02-06 08:20:18,690 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-02-06 08:20:18,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-02-06 08:20:18,690 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_activate_vcin [2025-02-06 08:20:18,690 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_activate_vcin [2025-02-06 08:20:18,690 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_remove_one [2025-02-06 08:20:18,690 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_remove_one [2025-02-06 08:20:18,690 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_io_poll [2025-02-06 08:20:18,690 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_io_poll [2025-02-06 08:20:18,690 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-02-06 08:20:18,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-02-06 08:20:18,690 INFO L130 BoogieDeclarations]: Found specification of procedure valid_dma_direction [2025-02-06 08:20:18,691 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_dma_direction [2025-02-06 08:20:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2025-02-06 08:20:18,691 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2025-02-06 08:20:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2025-02-06 08:20:18,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2025-02-06 08:20:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2025-02-06 08:20:18,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2025-02-06 08:20:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2025-02-06 08:20:18,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2025-02-06 08:20:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_irq_check [2025-02-06 08:20:18,691 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_irq_check [2025-02-06 08:20:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_getstats [2025-02-06 08:20:18,691 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_getstats [2025-02-06 08:20:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-02-06 08:20:18,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-02-06 08:20:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2025-02-06 08:20:18,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2025-02-06 08:20:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 08:20:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_init [2025-02-06 08:20:18,691 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_init [2025-02-06 08:20:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_shutdown [2025-02-06 08:20:18,691 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_shutdown [2025-02-06 08:20:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_detect [2025-02-06 08:20:18,691 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_detect [2025-02-06 08:20:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2025-02-06 08:20:18,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2025-02-06 08:20:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-02-06 08:20:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-02-06 08:20:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-02-06 08:20:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-02-06 08:20:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-02-06 08:20:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-02-06 08:20:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-02-06 08:20:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-02-06 08:20:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-02-06 08:20:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-02-06 08:20:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-02-06 08:20:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-02-06 08:20:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-02-06 08:20:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-02-06 08:20:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-02-06 08:20:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-02-06 08:20:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#16 [2025-02-06 08:20:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#17 [2025-02-06 08:20:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#18 [2025-02-06 08:20:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#19 [2025-02-06 08:20:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#20 [2025-02-06 08:20:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#21 [2025-02-06 08:20:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#22 [2025-02-06 08:20:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#23 [2025-02-06 08:20:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#24 [2025-02-06 08:20:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#25 [2025-02-06 08:20:18,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#26 [2025-02-06 08:20:18,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#27 [2025-02-06 08:20:18,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#28 [2025-02-06 08:20:18,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#29 [2025-02-06 08:20:18,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#30 [2025-02-06 08:20:18,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#31 [2025-02-06 08:20:18,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#32 [2025-02-06 08:20:18,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#33 [2025-02-06 08:20:18,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#34 [2025-02-06 08:20:18,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#35 [2025-02-06 08:20:18,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#36 [2025-02-06 08:20:18,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#37 [2025-02-06 08:20:18,692 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2025-02-06 08:20:18,692 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2025-02-06 08:20:18,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-06 08:20:18,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-06 08:20:18,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-06 08:20:18,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-06 08:20:18,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-06 08:20:18,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-06 08:20:18,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-06 08:20:18,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-02-06 08:20:18,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-02-06 08:20:18,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-02-06 08:20:18,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-02-06 08:20:18,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-02-06 08:20:18,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-02-06 08:20:18,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-02-06 08:20:18,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-02-06 08:20:18,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-02-06 08:20:18,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-02-06 08:20:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-02-06 08:20:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-02-06 08:20:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-02-06 08:20:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-02-06 08:20:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-02-06 08:20:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#22 [2025-02-06 08:20:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#23 [2025-02-06 08:20:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#24 [2025-02-06 08:20:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#25 [2025-02-06 08:20:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#26 [2025-02-06 08:20:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#27 [2025-02-06 08:20:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#28 [2025-02-06 08:20:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#29 [2025-02-06 08:20:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#30 [2025-02-06 08:20:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#31 [2025-02-06 08:20:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#32 [2025-02-06 08:20:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#33 [2025-02-06 08:20:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#34 [2025-02-06 08:20:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#35 [2025-02-06 08:20:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#36 [2025-02-06 08:20:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#37 [2025-02-06 08:20:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2025-02-06 08:20:18,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2025-02-06 08:20:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2025-02-06 08:20:18,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2025-02-06 08:20:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~~u32~0 [2025-02-06 08:20:18,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~~u32~0 [2025-02-06 08:20:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_map [2025-02-06 08:20:18,694 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_map [2025-02-06 08:20:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-02-06 08:20:18,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-02-06 08:20:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 08:20:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 08:20:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 08:20:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 08:20:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 08:20:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 08:20:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 08:20:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-06 08:20:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-06 08:20:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-06 08:20:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-06 08:20:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-06 08:20:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-06 08:20:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-06 08:20:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-06 08:20:18,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-06 08:20:18,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-06 08:20:18,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-02-06 08:20:18,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-02-06 08:20:18,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-02-06 08:20:18,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-02-06 08:20:18,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-02-06 08:20:18,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-02-06 08:20:18,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2025-02-06 08:20:18,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#24 [2025-02-06 08:20:18,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#25 [2025-02-06 08:20:18,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#26 [2025-02-06 08:20:18,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#27 [2025-02-06 08:20:18,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#28 [2025-02-06 08:20:18,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#29 [2025-02-06 08:20:18,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#30 [2025-02-06 08:20:18,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#31 [2025-02-06 08:20:18,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#32 [2025-02-06 08:20:18,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#33 [2025-02-06 08:20:18,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#34 [2025-02-06 08:20:18,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#35 [2025-02-06 08:20:18,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#36 [2025-02-06 08:20:18,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#37 [2025-02-06 08:20:18,696 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2025-02-06 08:20:18,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2025-02-06 08:20:18,696 INFO L130 BoogieDeclarations]: Found specification of procedure __phys_addr [2025-02-06 08:20:18,696 INFO L138 BoogieDeclarations]: Found implementation of procedure __phys_addr [2025-02-06 08:20:18,696 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2025-02-06 08:20:18,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2025-02-06 08:20:18,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2025-02-06 08:20:18,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2025-02-06 08:20:18,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2025-02-06 08:20:18,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2025-02-06 08:20:18,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2025-02-06 08:20:18,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2025-02-06 08:20:18,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2025-02-06 08:20:18,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2025-02-06 08:20:18,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2025-02-06 08:20:18,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#9 [2025-02-06 08:20:18,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#10 [2025-02-06 08:20:18,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#11 [2025-02-06 08:20:18,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#12 [2025-02-06 08:20:18,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#13 [2025-02-06 08:20:18,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#14 [2025-02-06 08:20:18,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#15 [2025-02-06 08:20:18,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#16 [2025-02-06 08:20:18,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#17 [2025-02-06 08:20:18,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#18 [2025-02-06 08:20:18,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#19 [2025-02-06 08:20:18,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#20 [2025-02-06 08:20:18,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#21 [2025-02-06 08:20:18,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#22 [2025-02-06 08:20:18,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#23 [2025-02-06 08:20:18,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#24 [2025-02-06 08:20:18,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#25 [2025-02-06 08:20:18,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#26 [2025-02-06 08:20:18,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#27 [2025-02-06 08:20:18,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#28 [2025-02-06 08:20:18,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#29 [2025-02-06 08:20:18,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#30 [2025-02-06 08:20:18,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#31 [2025-02-06 08:20:18,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#32 [2025-02-06 08:20:18,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#33 [2025-02-06 08:20:18,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#34 [2025-02-06 08:20:18,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#35 [2025-02-06 08:20:18,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#36 [2025-02-06 08:20:18,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#37 [2025-02-06 08:20:18,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2025-02-06 08:20:18,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2025-02-06 08:20:18,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2025-02-06 08:20:18,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2025-02-06 08:20:18,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2025-02-06 08:20:18,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2025-02-06 08:20:18,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2025-02-06 08:20:18,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2025-02-06 08:20:18,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2025-02-06 08:20:18,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#9 [2025-02-06 08:20:18,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#10 [2025-02-06 08:20:18,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#11 [2025-02-06 08:20:18,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#12 [2025-02-06 08:20:18,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#13 [2025-02-06 08:20:18,698 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#14 [2025-02-06 08:20:18,698 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#15 [2025-02-06 08:20:18,698 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#16 [2025-02-06 08:20:18,698 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#17 [2025-02-06 08:20:18,698 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#18 [2025-02-06 08:20:18,698 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#19 [2025-02-06 08:20:18,698 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#20 [2025-02-06 08:20:18,698 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#21 [2025-02-06 08:20:18,698 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#22 [2025-02-06 08:20:18,698 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#23 [2025-02-06 08:20:18,699 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#24 [2025-02-06 08:20:18,699 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#25 [2025-02-06 08:20:18,699 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#26 [2025-02-06 08:20:18,699 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#27 [2025-02-06 08:20:18,699 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#28 [2025-02-06 08:20:18,699 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#29 [2025-02-06 08:20:18,699 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#30 [2025-02-06 08:20:18,699 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#31 [2025-02-06 08:20:18,699 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#32 [2025-02-06 08:20:18,699 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#33 [2025-02-06 08:20:18,699 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#34 [2025-02-06 08:20:18,699 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#35 [2025-02-06 08:20:18,699 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#36 [2025-02-06 08:20:18,699 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#37 [2025-02-06 08:20:18,699 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_proc_read [2025-02-06 08:20:18,699 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_proc_read [2025-02-06 08:20:18,699 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2025-02-06 08:20:18,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2025-02-06 08:20:18,699 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2025-02-06 08:20:18,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2025-02-06 08:20:18,699 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2025-02-06 08:20:18,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2025-02-06 08:20:18,699 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_open [2025-02-06 08:20:18,699 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_open [2025-02-06 08:20:18,699 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2025-02-06 08:20:18,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2025-02-06 08:20:18,699 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2025-02-06 08:20:18,699 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_device [2025-02-06 08:20:18,699 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-02-06 08:20:18,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-02-06 08:20:18,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 08:20:18,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 08:20:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_write [2025-02-06 08:20:18,700 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_write [2025-02-06 08:20:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-02-06 08:20:18,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-02-06 08:20:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 08:20:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 08:20:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 08:20:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 08:20:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-06 08:20:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-06 08:20:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-06 08:20:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-06 08:20:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-06 08:20:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-06 08:20:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-06 08:20:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-06 08:20:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-06 08:20:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-06 08:20:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-06 08:20:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-02-06 08:20:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-02-06 08:20:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-02-06 08:20:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-02-06 08:20:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-02-06 08:20:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-02-06 08:20:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-02-06 08:20:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#22 [2025-02-06 08:20:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#23 [2025-02-06 08:20:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#24 [2025-02-06 08:20:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#25 [2025-02-06 08:20:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#26 [2025-02-06 08:20:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#27 [2025-02-06 08:20:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#28 [2025-02-06 08:20:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#29 [2025-02-06 08:20:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#30 [2025-02-06 08:20:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#31 [2025-02-06 08:20:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#32 [2025-02-06 08:20:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#33 [2025-02-06 08:20:18,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#34 [2025-02-06 08:20:18,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#35 [2025-02-06 08:20:18,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#36 [2025-02-06 08:20:18,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#37 [2025-02-06 08:20:18,701 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-02-06 08:20:18,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-02-06 08:20:18,701 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2025-02-06 08:20:18,701 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2025-02-06 08:20:18,701 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~u32~0~X~int~X~int~TO~VOID [2025-02-06 08:20:18,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~u32~0~X~int~X~int~TO~VOID [2025-02-06 08:20:18,701 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2025-02-06 08:20:18,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2025-02-06 08:20:18,701 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_schedule [2025-02-06 08:20:18,701 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_schedule [2025-02-06 08:20:18,701 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atm_dev_register [2025-02-06 08:20:18,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atm_dev_register [2025-02-06 08:20:18,701 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_get_esi [2025-02-06 08:20:18,701 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_get_esi [2025-02-06 08:20:18,701 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_monitor_getc [2025-02-06 08:20:18,701 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_monitor_getc [2025-02-06 08:20:18,701 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~dma_addr_t~0~X~int~X~int~TO~VOID [2025-02-06 08:20:18,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~dma_addr_t~0~X~int~X~int~TO~VOID [2025-02-06 08:20:18,701 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_chunk_free [2025-02-06 08:20:18,701 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_chunk_free [2025-02-06 08:20:18,701 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~~u32~0 [2025-02-06 08:20:18,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~~u32~0 [2025-02-06 08:20:18,701 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2025-02-06 08:20:18,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2025-02-06 08:20:18,701 INFO L130 BoogieDeclarations]: Found specification of procedure writel [2025-02-06 08:20:18,701 INFO L138 BoogieDeclarations]: Found implementation of procedure writel [2025-02-06 08:20:18,701 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2025-02-06 08:20:18,701 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2025-02-06 08:20:18,701 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_close [2025-02-06 08:20:18,701 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_close [2025-02-06 08:20:18,701 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_reset [2025-02-06 08:20:18,701 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_reset [2025-02-06 08:20:18,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 08:20:18,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 08:20:18,701 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_rate_ctrl [2025-02-06 08:20:18,701 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_rate_ctrl [2025-02-06 08:20:18,702 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2025-02-06 08:20:18,702 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2025-02-06 08:20:18,702 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~X~int~TO~int [2025-02-06 08:20:18,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~X~int~TO~int [2025-02-06 08:20:18,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-02-06 08:20:18,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-02-06 08:20:18,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#16 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#17 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#18 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#19 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#20 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#21 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#22 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#23 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#24 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#25 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#26 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#27 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#28 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#29 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#30 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#31 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#32 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#33 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#34 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#35 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#36 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#37 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-02-06 08:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-02-06 08:20:18,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-02-06 08:20:18,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-02-06 08:20:18,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-02-06 08:20:18,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-02-06 08:20:18,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-02-06 08:20:18,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2025-02-06 08:20:18,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#21 [2025-02-06 08:20:18,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#22 [2025-02-06 08:20:18,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#23 [2025-02-06 08:20:18,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#24 [2025-02-06 08:20:18,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#25 [2025-02-06 08:20:18,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#26 [2025-02-06 08:20:18,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#27 [2025-02-06 08:20:18,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#28 [2025-02-06 08:20:18,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#29 [2025-02-06 08:20:18,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#30 [2025-02-06 08:20:18,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#31 [2025-02-06 08:20:18,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#32 [2025-02-06 08:20:18,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#33 [2025-02-06 08:20:18,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#34 [2025-02-06 08:20:18,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#35 [2025-02-06 08:20:18,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#36 [2025-02-06 08:20:18,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#37 [2025-02-06 08:20:18,705 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-02-06 08:20:18,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-02-06 08:20:18,705 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-02-06 08:20:18,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-02-06 08:20:18,705 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_irq_itoa [2025-02-06 08:20:18,705 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_irq_itoa [2025-02-06 08:20:18,705 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_init [2025-02-06 08:20:18,705 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_init [2025-02-06 08:20:18,705 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_struct_atmdev_ops_io_instance_2 [2025-02-06 08:20:18,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_struct_atmdev_ops_io_instance_2 [2025-02-06 08:20:18,705 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_irq_ack [2025-02-06 08:20:18,705 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_irq_ack [2025-02-06 08:20:18,705 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_130 [2025-02-06 08:20:18,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_130 [2025-02-06 08:20:18,705 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2025-02-06 08:20:18,705 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2025-02-06 08:20:18,705 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2025-02-06 08:20:18,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure sk_atm [2025-02-06 08:20:18,706 INFO L138 BoogieDeclarations]: Found implementation of procedure sk_atm [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2025-02-06 08:20:18,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_prom_read [2025-02-06 08:20:18,706 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_prom_read [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2025-02-06 08:20:18,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#22 [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#23 [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#24 [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#25 [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#26 [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#27 [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#28 [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#29 [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#30 [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#31 [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#32 [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#33 [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#34 [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#35 [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#36 [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#37 [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_sync_for_cpu [2025-02-06 08:20:18,706 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_sync_for_cpu [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_reset [2025-02-06 08:20:18,706 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_reset [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-06 08:20:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-06 08:20:18,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-06 08:20:18,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-06 08:20:18,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-06 08:20:18,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-06 08:20:18,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-06 08:20:18,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-06 08:20:18,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-02-06 08:20:18,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-02-06 08:20:18,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-02-06 08:20:18,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-02-06 08:20:18,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-02-06 08:20:18,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-02-06 08:20:18,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-02-06 08:20:18,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-02-06 08:20:18,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-02-06 08:20:18,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-02-06 08:20:18,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2025-02-06 08:20:18,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#22 [2025-02-06 08:20:18,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#23 [2025-02-06 08:20:18,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#24 [2025-02-06 08:20:18,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#25 [2025-02-06 08:20:18,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#26 [2025-02-06 08:20:18,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#27 [2025-02-06 08:20:18,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#28 [2025-02-06 08:20:18,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#29 [2025-02-06 08:20:18,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#30 [2025-02-06 08:20:18,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#31 [2025-02-06 08:20:18,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#32 [2025-02-06 08:20:18,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#33 [2025-02-06 08:20:18,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#34 [2025-02-06 08:20:18,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#35 [2025-02-06 08:20:18,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#36 [2025-02-06 08:20:18,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#37 [2025-02-06 08:20:18,709 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2025-02-06 08:20:18,709 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2025-02-06 08:20:18,709 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-02-06 08:20:18,709 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-02-06 08:20:18,709 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2025-02-06 08:20:18,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2025-02-06 08:20:18,709 INFO L130 BoogieDeclarations]: Found specification of procedure pci_write_config_byte [2025-02-06 08:20:18,709 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_write_config_byte [2025-02-06 08:20:18,709 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-02-06 08:20:18,709 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-02-06 08:20:18,709 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_chunk_free [2025-02-06 08:20:18,709 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_chunk_free [2025-02-06 08:20:18,709 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2025-02-06 08:20:18,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2025-02-06 08:20:18,709 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2025-02-06 08:20:18,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2025-02-06 08:20:18,709 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_rate_mtx_of_fore200e [2025-02-06 08:20:18,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_rate_mtx_of_fore200e [2025-02-06 08:20:18,709 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-02-06 08:20:18,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-02-06 08:20:18,709 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_map [2025-02-06 08:20:18,709 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_map [2025-02-06 08:20:18,709 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_atm2fore_aal [2025-02-06 08:20:18,709 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_atm2fore_aal [2025-02-06 08:20:18,709 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_q_lock_of_fore200e [2025-02-06 08:20:18,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_q_lock_of_fore200e [2025-02-06 08:20:18,709 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-02-06 08:20:18,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-02-06 08:20:18,709 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-02-06 08:20:18,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-02-06 08:20:18,709 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2025-02-06 08:20:18,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2025-02-06 08:20:18,709 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2025-02-06 08:20:18,709 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2025-02-06 08:20:18,709 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2025-02-06 08:20:18,709 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2025-02-06 08:20:18,709 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atm_dev_register_150 [2025-02-06 08:20:18,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atm_dev_register_150 [2025-02-06 08:20:18,709 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-02-06 08:20:18,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-02-06 08:20:18,709 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-02-06 08:20:18,709 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-02-06 08:20:18,709 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-02-06 08:20:18,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-02-06 08:20:18,709 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dispatch_register_8_1 [2025-02-06 08:20:18,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dispatch_register_8_1 [2025-02-06 08:20:18,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 08:20:18,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 08:20:18,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 08:20:18,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 08:20:18,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 08:20:18,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 08:20:18,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 08:20:18,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 08:20:18,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-06 08:20:18,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-06 08:20:18,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-06 08:20:18,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-06 08:20:18,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-06 08:20:18,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-06 08:20:18,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-06 08:20:18,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-06 08:20:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-06 08:20:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-02-06 08:20:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-02-06 08:20:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-02-06 08:20:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-02-06 08:20:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-02-06 08:20:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-02-06 08:20:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2025-02-06 08:20:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#24 [2025-02-06 08:20:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#25 [2025-02-06 08:20:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#26 [2025-02-06 08:20:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#27 [2025-02-06 08:20:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#28 [2025-02-06 08:20:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#29 [2025-02-06 08:20:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#30 [2025-02-06 08:20:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#31 [2025-02-06 08:20:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#32 [2025-02-06 08:20:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#33 [2025-02-06 08:20:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#34 [2025-02-06 08:20:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#35 [2025-02-06 08:20:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#36 [2025-02-06 08:20:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#37 [2025-02-06 08:20:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2025-02-06 08:20:18,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2025-02-06 08:20:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_configure [2025-02-06 08:20:18,711 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_configure [2025-02-06 08:20:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-02-06 08:20:18,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-02-06 08:20:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2025-02-06 08:20:18,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2025-02-06 08:20:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_any [2025-02-06 08:20:18,711 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_any [2025-02-06 08:20:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_inc [2025-02-06 08:20:18,711 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_inc [2025-02-06 08:20:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_send [2025-02-06 08:20:18,711 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_send [2025-02-06 08:20:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_unmap [2025-02-06 08:20:18,711 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_unmap [2025-02-06 08:20:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_chunk_alloc [2025-02-06 08:20:18,711 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_chunk_alloc [2025-02-06 08:20:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2025-02-06 08:20:18,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2025-02-06 08:20:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-02-06 08:20:18,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-02-06 08:20:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure msecs_to_jiffies [2025-02-06 08:20:18,711 INFO L138 BoogieDeclarations]: Found implementation of procedure msecs_to_jiffies [2025-02-06 08:20:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_proc_read [2025-02-06 08:20:18,712 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_proc_read [2025-02-06 08:20:18,712 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_poll [2025-02-06 08:20:18,712 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_poll [2025-02-06 08:20:18,712 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-02-06 08:20:18,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-02-06 08:20:18,712 INFO L130 BoogieDeclarations]: Found specification of procedure readl [2025-02-06 08:20:18,712 INFO L138 BoogieDeclarations]: Found implementation of procedure readl [2025-02-06 08:20:18,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 08:20:18,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 08:20:18,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 08:20:18,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 08:20:18,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 08:20:18,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 08:20:18,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 08:20:18,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 08:20:18,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-06 08:20:18,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-06 08:20:18,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-06 08:20:18,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-06 08:20:18,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-06 08:20:18,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-06 08:20:18,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-06 08:20:18,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-06 08:20:18,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-06 08:20:18,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-06 08:20:18,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-06 08:20:18,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-06 08:20:18,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-02-06 08:20:18,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-02-06 08:20:18,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-02-06 08:20:18,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2025-02-06 08:20:18,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#24 [2025-02-06 08:20:18,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#25 [2025-02-06 08:20:18,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#26 [2025-02-06 08:20:18,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#27 [2025-02-06 08:20:18,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#28 [2025-02-06 08:20:18,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#29 [2025-02-06 08:20:18,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#30 [2025-02-06 08:20:18,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#31 [2025-02-06 08:20:18,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#32 [2025-02-06 08:20:18,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#33 [2025-02-06 08:20:18,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#34 [2025-02-06 08:20:18,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#35 [2025-02-06 08:20:18,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#36 [2025-02-06 08:20:18,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#37 [2025-02-06 08:20:18,714 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~VOID [2025-02-06 08:20:18,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~VOID [2025-02-06 08:20:18,714 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_rate_mtx_of_fore200e [2025-02-06 08:20:18,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_rate_mtx_of_fore200e [2025-02-06 08:20:18,714 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_tx_irq [2025-02-06 08:20:18,714 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_tx_irq [2025-02-06 08:20:19,661 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 08:20:19,665 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 08:20:19,919 INFO L1309 $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-02-06 08:20:19,927 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7498: havoc dev_get_drvdata_#t~mem40#1.base, dev_get_drvdata_#t~mem40#1.offset; [2025-02-06 08:20:20,668 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9614: call ULTIMATE.dealloc(~#opcode~2.base, ~#opcode~2.offset);havoc ~#opcode~2.base, ~#opcode~2.offset; [2025-02-06 08:20:20,757 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint fore200e_shutdownFINAL: assume true; [2025-02-06 08:20:20,802 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L18150: havoc dma_set_mask_#t~nondet1959#1; [2025-02-06 08:20:20,802 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L18154: havoc dma_supported_#t~nondet1960#1; [2025-02-06 08:20:20,802 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L18194: havoc pci_enable_device_#t~nondet1966#1; [2025-02-06 08:20:20,821 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7585: havoc #t~mem99.base, #t~mem99.offset; [2025-02-06 08:20:20,865 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L18101: havoc #t~nondet1954; [2025-02-06 08:20:21,209 INFO L1309 $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-02-06 08:20:21,343 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L18111: havoc #t~nondet1955; [2025-02-06 08:20:21,365 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7338-1: test_and_set_bit_#res#1 := 1; [2025-02-06 08:20:21,371 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11574: #res.base, #res.offset := ~arg0.base, ~arg0.offset; [2025-02-06 08:20:21,441 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7403: havoc arch_irqs_disabled_flags_#t~bitwise25#1; [2025-02-06 08:20:25,912 INFO L1309 $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-02-06 08:20:25,913 INFO L1309 $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-02-06 08:20:25,913 INFO L1309 $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-02-06 08:20:25,913 INFO L1309 $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-02-06 08:20:25,913 INFO L1309 $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-02-06 08:20:25,913 INFO L1309 $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-02-06 08:20:25,913 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L18097: havoc __pci_register_driver_#t~nondet1953#1; [2025-02-06 08:20:25,913 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11561-1: ldv___pci_register_driver_#res#1 := ldv___pci_register_driver_~arg0#1; [2025-02-06 08:20:26,958 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-02-06 08:20:27,714 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8059: call ULTIMATE.dealloc(~#str~0.base, ~#str~0.offset);havoc ~#str~0.base, ~#str~0.offset; [2025-02-06 08:20:28,305 INFO L1309 $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-02-06 08:20:28,306 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L18211: havoc request_firmware_#t~nondet1968#1; [2025-02-06 08:20:28,306 INFO L1309 $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-02-06 08:20:28,306 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L12302-1: ldv_request_irq_#res#1 := ldv_request_irq_~arg0#1; [2025-02-06 08:20:28,306 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L18215: havoc request_threaded_irq_#t~nondet1969#1; [2025-02-06 08:20:28,306 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L13066-1: ldv_request_irq_149_#res#1 := ldv_request_irq_149_~ldv_func_res~0#1; [2025-02-06 08:20:28,610 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L18128: havoc capable_#t~nondet1958#1; [2025-02-06 08:20:28,610 INFO L1309 $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-02-06 08:20:28,610 INFO L1309 $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-02-06 08:20:29,190 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7411: havoc #t~mem26; [2025-02-06 08:20:29,220 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8633: call ULTIMATE.dealloc(~#opcode~1.base, ~#opcode~1.offset);havoc ~#opcode~1.base, ~#opcode~1.offset; [2025-02-06 08:20:29,250 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L18204: havoc #t~nondet1967; [2025-02-06 08:20:29,257 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L18187: havoc pci_bus_write_config_byte_#t~nondet1965#1; [2025-02-06 08:20:29,341 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7344: havoc #t~mem5;havoc #t~bitwise6; [2025-02-06 08:20:29,350 INFO L1309 $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-02-06 08:20:29,350 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L18124: havoc atm_dev_register_#t~ret1957#1.base, atm_dev_register_#t~ret1957#1.offset; [2025-02-06 08:20:29,393 INFO L1309 $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-02-06 08:20:29,393 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L18183: havoc pci_bus_read_config_byte_#t~nondet1964#1; [2025-02-06 08:20:29,599 INFO L1309 $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-02-06 08:20:29,669 INFO L1309 $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-02-06 08:20:29,678 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L18176: havoc #t~nondet1963; [2025-02-06 08:20:30,769 INFO L? ?]: Removed 3638 outVars from TransFormulas that were not future-live. [2025-02-06 08:20:30,770 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 08:20:30,840 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 08:20:30,840 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-06 08:20:30,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:20:30 BoogieIcfgContainer [2025-02-06 08:20:30,840 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 08:20:30,842 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 08:20:30,842 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 08:20:30,847 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 08:20:30,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 08:20:12" (1/3) ... [2025-02-06 08:20:30,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d135f8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:20:30, skipping insertion in model container [2025-02-06 08:20:30,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:20:16" (2/3) ... [2025-02-06 08:20:30,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d135f8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:20:30, skipping insertion in model container [2025-02-06 08:20:30,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:20:30" (3/3) ... [2025-02-06 08:20:30,850 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i [2025-02-06 08:20:30,861 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 08:20:30,864 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i that has 163 procedures, 2327 locations, 1 initial locations, 101 loop locations, and 30 error locations. [2025-02-06 08:20:30,940 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 08:20:30,947 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;@13bdf849, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 08:20:30,947 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-02-06 08:20:30,954 INFO L276 IsEmpty]: Start isEmpty. Operand has 2140 states, 1443 states have (on average 1.2993762993762994) internal successors, (1875), 1519 states have internal predecessors, (1875), 541 states have call successors, (541), 125 states have call predecessors, (541), 123 states have return successors, (534), 525 states have call predecessors, (534), 534 states have call successors, (534) [2025-02-06 08:20:30,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-06 08:20:30,960 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:20:30,961 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-02-06 08:20:30,961 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-02-06 08:20:30,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:20:30,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1954485232, now seen corresponding path program 1 times [2025-02-06 08:20:30,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:20:30,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131644573] [2025-02-06 08:20:30,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:20:30,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:20:31,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 08:20:31,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 08:20:31,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:20:31,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:20:32,510 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:20:32,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:20:32,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131644573] [2025-02-06 08:20:32,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131644573] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:20:32,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:20:32,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:20:32,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392318785] [2025-02-06 08:20:32,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:20:32,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:20:32,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:20:32,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:20:32,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:20:32,540 INFO L87 Difference]: Start difference. First operand has 2140 states, 1443 states have (on average 1.2993762993762994) internal successors, (1875), 1519 states have internal predecessors, (1875), 541 states have call successors, (541), 125 states have call predecessors, (541), 123 states have return successors, (534), 525 states have call predecessors, (534), 534 states have call successors, (534) 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-02-06 08:20:32,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:20:32,980 INFO L93 Difference]: Finished difference Result 6331 states and 9057 transitions. [2025-02-06 08:20:32,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:20:32,982 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-02-06 08:20:32,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:20:33,024 INFO L225 Difference]: With dead ends: 6331 [2025-02-06 08:20:33,024 INFO L226 Difference]: Without dead ends: 4079 [2025-02-06 08:20:33,041 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-02-06 08:20:33,044 INFO L435 NwaCegarLoop]: 2947 mSDtfsCounter, 2847 mSDsluCounter, 5782 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2847 SdHoareTripleChecker+Valid, 8729 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-02-06 08:20:33,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2847 Valid, 8729 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:20:33,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4079 states. [2025-02-06 08:20:33,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4079 to 3887. [2025-02-06 08:20:33,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3887 states, 2648 states have (on average 1.2624622356495467) internal successors, (3343), 2760 states have internal predecessors, (3343), 985 states have call successors, (985), 229 states have call predecessors, (985), 224 states have return successors, (1001), 955 states have call predecessors, (1001), 973 states have call successors, (1001) [2025-02-06 08:20:33,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3887 states to 3887 states and 5329 transitions. [2025-02-06 08:20:33,305 INFO L78 Accepts]: Start accepts. Automaton has 3887 states and 5329 transitions. Word has length 69 [2025-02-06 08:20:33,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:20:33,306 INFO L471 AbstractCegarLoop]: Abstraction has 3887 states and 5329 transitions. [2025-02-06 08:20:33,307 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-02-06 08:20:33,307 INFO L276 IsEmpty]: Start isEmpty. Operand 3887 states and 5329 transitions. [2025-02-06 08:20:33,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-06 08:20:33,310 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:20:33,310 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-02-06 08:20:33,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 08:20:33,311 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-02-06 08:20:33,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:20:33,311 INFO L85 PathProgramCache]: Analyzing trace with hash -2038614424, now seen corresponding path program 1 times [2025-02-06 08:20:33,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:20:33,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400006864] [2025-02-06 08:20:33,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:20:33,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:20:33,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-06 08:20:33,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-06 08:20:33,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:20:33,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:20:34,367 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:20:34,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:20:34,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400006864] [2025-02-06 08:20:34,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400006864] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:20:34,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:20:34,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:20:34,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407221616] [2025-02-06 08:20:34,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:20:34,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:20:34,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:20:34,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:20:34,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:20:34,370 INFO L87 Difference]: Start difference. First operand 3887 states and 5329 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-02-06 08:20:34,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:20:34,536 INFO L93 Difference]: Finished difference Result 3887 states and 5329 transitions. [2025-02-06 08:20:34,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:20:34,536 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-02-06 08:20:34,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:20:34,558 INFO L225 Difference]: With dead ends: 3887 [2025-02-06 08:20:34,558 INFO L226 Difference]: Without dead ends: 3885 [2025-02-06 08:20:34,561 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-02-06 08:20:34,561 INFO L435 NwaCegarLoop]: 2752 mSDtfsCounter, 2737 mSDsluCounter, 2751 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2737 SdHoareTripleChecker+Valid, 5503 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:20:34,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2737 Valid, 5503 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:20:34,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3885 states. [2025-02-06 08:20:34,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3885 to 3885. [2025-02-06 08:20:34,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3885 states, 2647 states have (on average 1.2621836040800907) internal successors, (3341), 2758 states have internal predecessors, (3341), 985 states have call successors, (985), 229 states have call predecessors, (985), 224 states have return successors, (1001), 955 states have call predecessors, (1001), 973 states have call successors, (1001) [2025-02-06 08:20:34,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3885 states to 3885 states and 5327 transitions. [2025-02-06 08:20:34,725 INFO L78 Accepts]: Start accepts. Automaton has 3885 states and 5327 transitions. Word has length 75 [2025-02-06 08:20:34,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:20:34,725 INFO L471 AbstractCegarLoop]: Abstraction has 3885 states and 5327 transitions. [2025-02-06 08:20:34,725 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-02-06 08:20:34,725 INFO L276 IsEmpty]: Start isEmpty. Operand 3885 states and 5327 transitions. [2025-02-06 08:20:34,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-06 08:20:34,727 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:20:34,727 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-02-06 08:20:34,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 08:20:34,727 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-02-06 08:20:34,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:20:34,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1090792899, now seen corresponding path program 1 times [2025-02-06 08:20:34,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:20:34,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805399018] [2025-02-06 08:20:34,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:20:34,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:20:35,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-06 08:20:35,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-06 08:20:35,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:20:35,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:20:35,503 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:20:35,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:20:35,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805399018] [2025-02-06 08:20:35,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805399018] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:20:35,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:20:35,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:20:35,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060527454] [2025-02-06 08:20:35,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:20:35,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:20:35,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:20:35,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:20:35,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:20:35,505 INFO L87 Difference]: Start difference. First operand 3885 states and 5327 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-02-06 08:20:35,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:20:35,662 INFO L93 Difference]: Finished difference Result 3885 states and 5327 transitions. [2025-02-06 08:20:35,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:20:35,662 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-02-06 08:20:35,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:20:35,681 INFO L225 Difference]: With dead ends: 3885 [2025-02-06 08:20:35,681 INFO L226 Difference]: Without dead ends: 3883 [2025-02-06 08:20:35,684 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-02-06 08:20:35,684 INFO L435 NwaCegarLoop]: 2750 mSDtfsCounter, 2734 mSDsluCounter, 2749 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2734 SdHoareTripleChecker+Valid, 5499 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:20:35,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2734 Valid, 5499 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:20:35,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3883 states. [2025-02-06 08:20:35,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3883 to 3883. [2025-02-06 08:20:35,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3883 states, 2646 states have (on average 1.2619047619047619) internal successors, (3339), 2756 states have internal predecessors, (3339), 985 states have call successors, (985), 229 states have call predecessors, (985), 224 states have return successors, (1001), 955 states have call predecessors, (1001), 973 states have call successors, (1001) [2025-02-06 08:20:35,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3883 states to 3883 states and 5325 transitions. [2025-02-06 08:20:35,978 INFO L78 Accepts]: Start accepts. Automaton has 3883 states and 5325 transitions. Word has length 81 [2025-02-06 08:20:35,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:20:35,982 INFO L471 AbstractCegarLoop]: Abstraction has 3883 states and 5325 transitions. [2025-02-06 08:20:35,982 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-02-06 08:20:35,982 INFO L276 IsEmpty]: Start isEmpty. Operand 3883 states and 5325 transitions. [2025-02-06 08:20:35,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-06 08:20:35,983 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:20:35,984 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-02-06 08:20:35,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 08:20:35,984 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-02-06 08:20:35,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:20:35,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1858761302, now seen corresponding path program 1 times [2025-02-06 08:20:35,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:20:35,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349489898] [2025-02-06 08:20:35,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:20:35,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:20:36,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-06 08:20:36,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-06 08:20:36,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:20:36,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:20:36,992 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:20:36,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:20:36,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349489898] [2025-02-06 08:20:36,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349489898] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:20:36,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:20:36,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:20:36,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840962612] [2025-02-06 08:20:36,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:20:36,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:20:36,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:20:36,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:20:36,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:20:36,994 INFO L87 Difference]: Start difference. First operand 3883 states and 5325 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-02-06 08:20:37,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:20:37,185 INFO L93 Difference]: Finished difference Result 3883 states and 5325 transitions. [2025-02-06 08:20:37,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:20:37,185 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-02-06 08:20:37,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:20:37,201 INFO L225 Difference]: With dead ends: 3883 [2025-02-06 08:20:37,202 INFO L226 Difference]: Without dead ends: 3881 [2025-02-06 08:20:37,203 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-02-06 08:20:37,203 INFO L435 NwaCegarLoop]: 2748 mSDtfsCounter, 2731 mSDsluCounter, 2747 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2731 SdHoareTripleChecker+Valid, 5495 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:20:37,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2731 Valid, 5495 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:20:37,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3881 states. [2025-02-06 08:20:37,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3881 to 3881. [2025-02-06 08:20:37,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3881 states, 2645 states have (on average 1.261625708884688) internal successors, (3337), 2754 states have internal predecessors, (3337), 985 states have call successors, (985), 229 states have call predecessors, (985), 224 states have return successors, (1001), 955 states have call predecessors, (1001), 973 states have call successors, (1001) [2025-02-06 08:20:37,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3881 states to 3881 states and 5323 transitions. [2025-02-06 08:20:37,350 INFO L78 Accepts]: Start accepts. Automaton has 3881 states and 5323 transitions. Word has length 87 [2025-02-06 08:20:37,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:20:37,350 INFO L471 AbstractCegarLoop]: Abstraction has 3881 states and 5323 transitions. [2025-02-06 08:20:37,351 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-02-06 08:20:37,351 INFO L276 IsEmpty]: Start isEmpty. Operand 3881 states and 5323 transitions. [2025-02-06 08:20:37,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-06 08:20:37,352 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:20:37,352 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-02-06 08:20:37,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 08:20:37,352 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-02-06 08:20:37,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:20:37,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1637011576, now seen corresponding path program 1 times [2025-02-06 08:20:37,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:20:37,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185865928] [2025-02-06 08:20:37,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:20:37,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:20:37,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-06 08:20:37,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-06 08:20:37,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:20:37,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:20:38,272 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:20:38,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:20:38,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185865928] [2025-02-06 08:20:38,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185865928] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:20:38,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:20:38,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:20:38,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292124252] [2025-02-06 08:20:38,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:20:38,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:20:38,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:20:38,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:20:38,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:20:38,274 INFO L87 Difference]: Start difference. First operand 3881 states and 5323 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-02-06 08:20:38,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:20:38,498 INFO L93 Difference]: Finished difference Result 3881 states and 5323 transitions. [2025-02-06 08:20:38,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:20:38,499 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-02-06 08:20:38,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:20:38,515 INFO L225 Difference]: With dead ends: 3881 [2025-02-06 08:20:38,516 INFO L226 Difference]: Without dead ends: 3879 [2025-02-06 08:20:38,517 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-02-06 08:20:38,518 INFO L435 NwaCegarLoop]: 2746 mSDtfsCounter, 2728 mSDsluCounter, 2745 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2728 SdHoareTripleChecker+Valid, 5491 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:20:38,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2728 Valid, 5491 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:20:38,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3879 states. [2025-02-06 08:20:38,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3879 to 3879. [2025-02-06 08:20:38,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3879 states, 2644 states have (on average 1.2613464447806355) internal successors, (3335), 2752 states have internal predecessors, (3335), 985 states have call successors, (985), 229 states have call predecessors, (985), 224 states have return successors, (1001), 955 states have call predecessors, (1001), 973 states have call successors, (1001) [2025-02-06 08:20:38,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3879 states to 3879 states and 5321 transitions. [2025-02-06 08:20:38,694 INFO L78 Accepts]: Start accepts. Automaton has 3879 states and 5321 transitions. Word has length 93 [2025-02-06 08:20:38,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:20:38,694 INFO L471 AbstractCegarLoop]: Abstraction has 3879 states and 5321 transitions. [2025-02-06 08:20:38,695 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-02-06 08:20:38,695 INFO L276 IsEmpty]: Start isEmpty. Operand 3879 states and 5321 transitions. [2025-02-06 08:20:38,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-06 08:20:38,696 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:20:38,696 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-02-06 08:20:38,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 08:20:38,696 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-02-06 08:20:38,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:20:38,696 INFO L85 PathProgramCache]: Analyzing trace with hash -663449669, now seen corresponding path program 1 times [2025-02-06 08:20:38,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:20:38,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918901854] [2025-02-06 08:20:38,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:20:38,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:20:39,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 08:20:39,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 08:20:39,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:20:39,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:20:40,917 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-02-06 08:20:40,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:20:40,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918901854] [2025-02-06 08:20:40,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918901854] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:20:40,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291952109] [2025-02-06 08:20:40,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:20:40,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:20:40,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:20:40,920 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:20:40,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 08:20:42,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 08:20:42,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 08:20:42,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:20:42,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:20:42,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 2133 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-02-06 08:20:42,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:20:42,532 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 53 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 08:20:42,532 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:20:42,955 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-02-06 08:20:42,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291952109] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:20:42,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:20:42,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 20 [2025-02-06 08:20:42,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722719104] [2025-02-06 08:20:42,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:20:42,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 08:20:42,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:20:42,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 08:20:42,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2025-02-06 08:20:42,957 INFO L87 Difference]: Start difference. First operand 3879 states and 5321 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-02-06 08:20:43,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:20:43,973 INFO L93 Difference]: Finished difference Result 4859 states and 6500 transitions. [2025-02-06 08:20:43,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 08:20:43,974 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-02-06 08:20:43,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:20:43,991 INFO L225 Difference]: With dead ends: 4859 [2025-02-06 08:20:43,991 INFO L226 Difference]: Without dead ends: 3896 [2025-02-06 08:20:43,995 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-02-06 08:20:43,995 INFO L435 NwaCegarLoop]: 2712 mSDtfsCounter, 4 mSDsluCounter, 43285 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 45997 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 08:20:43,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 45997 Invalid, 955 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 08:20:43,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3896 states. [2025-02-06 08:20:44,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3896 to 3893. [2025-02-06 08:20:44,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3893 states, 2654 states have (on average 1.260361718161266) internal successors, (3345), 2762 states have internal predecessors, (3345), 989 states have call successors, (989), 229 states have call predecessors, (989), 224 states have return successors, (1005), 959 states have call predecessors, (1005), 977 states have call successors, (1005) [2025-02-06 08:20:44,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3893 states to 3893 states and 5339 transitions. [2025-02-06 08:20:44,136 INFO L78 Accepts]: Start accepts. Automaton has 3893 states and 5339 transitions. Word has length 104 [2025-02-06 08:20:44,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:20:44,136 INFO L471 AbstractCegarLoop]: Abstraction has 3893 states and 5339 transitions. [2025-02-06 08:20:44,137 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-02-06 08:20:44,137 INFO L276 IsEmpty]: Start isEmpty. Operand 3893 states and 5339 transitions. [2025-02-06 08:20:44,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-06 08:20:44,138 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:20:44,138 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-02-06 08:20:44,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 08:20:44,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:20:44,343 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-02-06 08:20:44,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:20:44,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1686495696, now seen corresponding path program 1 times [2025-02-06 08:20:44,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:20:44,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917293715] [2025-02-06 08:20:44,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:20:44,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:20:44,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 08:20:44,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 08:20:44,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:20:44,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:20:45,077 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:20:45,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:20:45,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917293715] [2025-02-06 08:20:45,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917293715] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:20:45,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:20:45,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:20:45,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790420537] [2025-02-06 08:20:45,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:20:45,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:20:45,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:20:45,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:20:45,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:20:45,079 INFO L87 Difference]: Start difference. First operand 3893 states and 5339 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-02-06 08:20:45,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:20:45,365 INFO L93 Difference]: Finished difference Result 3893 states and 5339 transitions. [2025-02-06 08:20:45,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:20:45,366 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-02-06 08:20:45,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:20:45,383 INFO L225 Difference]: With dead ends: 3893 [2025-02-06 08:20:45,384 INFO L226 Difference]: Without dead ends: 3891 [2025-02-06 08:20:45,386 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-02-06 08:20:45,386 INFO L435 NwaCegarLoop]: 2744 mSDtfsCounter, 2725 mSDsluCounter, 2743 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2725 SdHoareTripleChecker+Valid, 5487 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:20:45,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2725 Valid, 5487 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:20:45,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3891 states. [2025-02-06 08:20:45,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3891 to 3891. [2025-02-06 08:20:45,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3891 states, 2653 states have (on average 1.2600829249905767) internal successors, (3343), 2760 states have internal predecessors, (3343), 989 states have call successors, (989), 229 states have call predecessors, (989), 224 states have return successors, (1005), 959 states have call predecessors, (1005), 977 states have call successors, (1005) [2025-02-06 08:20:45,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3891 states to 3891 states and 5337 transitions. [2025-02-06 08:20:45,598 INFO L78 Accepts]: Start accepts. Automaton has 3891 states and 5337 transitions. Word has length 99 [2025-02-06 08:20:45,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:20:45,598 INFO L471 AbstractCegarLoop]: Abstraction has 3891 states and 5337 transitions. [2025-02-06 08:20:45,598 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-02-06 08:20:45,598 INFO L276 IsEmpty]: Start isEmpty. Operand 3891 states and 5337 transitions. [2025-02-06 08:20:45,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-06 08:20:45,599 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:20:45,599 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-02-06 08:20:45,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 08:20:45,600 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-02-06 08:20:45,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:20:45,600 INFO L85 PathProgramCache]: Analyzing trace with hash -931741421, now seen corresponding path program 1 times [2025-02-06 08:20:45,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:20:45,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436474704] [2025-02-06 08:20:45,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:20:45,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:20:45,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-06 08:20:45,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-06 08:20:45,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:20:45,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:20:46,100 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-06 08:20:46,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:20:46,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436474704] [2025-02-06 08:20:46,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436474704] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:20:46,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:20:46,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:20:46,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040653079] [2025-02-06 08:20:46,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:20:46,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:20:46,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:20:46,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:20:46,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:20:46,102 INFO L87 Difference]: Start difference. First operand 3891 states and 5337 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-02-06 08:20:46,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:20:46,271 INFO L93 Difference]: Finished difference Result 7739 states and 10615 transitions. [2025-02-06 08:20:46,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:20:46,272 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-02-06 08:20:46,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:20:46,289 INFO L225 Difference]: With dead ends: 7739 [2025-02-06 08:20:46,289 INFO L226 Difference]: Without dead ends: 3885 [2025-02-06 08:20:46,300 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-02-06 08:20:46,300 INFO L435 NwaCegarLoop]: 2740 mSDtfsCounter, 2744 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2744 SdHoareTripleChecker+Valid, 2740 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:20:46,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2744 Valid, 2740 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:20:46,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3885 states. [2025-02-06 08:20:46,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3885 to 3885. [2025-02-06 08:20:46,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3885 states, 2648 states have (on average 1.2590634441087614) internal successors, (3334), 2754 states have internal predecessors, (3334), 989 states have call successors, (989), 229 states have call predecessors, (989), 224 states have return successors, (1005), 959 states have call predecessors, (1005), 977 states have call successors, (1005) [2025-02-06 08:20:46,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3885 states to 3885 states and 5328 transitions. [2025-02-06 08:20:46,669 INFO L78 Accepts]: Start accepts. Automaton has 3885 states and 5328 transitions. Word has length 120 [2025-02-06 08:20:46,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:20:46,669 INFO L471 AbstractCegarLoop]: Abstraction has 3885 states and 5328 transitions. [2025-02-06 08:20:46,669 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-02-06 08:20:46,669 INFO L276 IsEmpty]: Start isEmpty. Operand 3885 states and 5328 transitions. [2025-02-06 08:20:46,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-06 08:20:46,674 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:20:46,674 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-02-06 08:20:46,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 08:20:46,674 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-02-06 08:20:46,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:20:46,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1842703019, now seen corresponding path program 1 times [2025-02-06 08:20:46,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:20:46,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449620668] [2025-02-06 08:20:46,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:20:46,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:20:47,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 08:20:47,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 08:20:47,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:20:47,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:20:47,360 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:20:47,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:20:47,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449620668] [2025-02-06 08:20:47,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449620668] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:20:47,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:20:47,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:20:47,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865336943] [2025-02-06 08:20:47,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:20:47,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:20:47,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:20:47,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:20:47,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:20:47,362 INFO L87 Difference]: Start difference. First operand 3885 states and 5328 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-02-06 08:20:47,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:20:47,546 INFO L93 Difference]: Finished difference Result 3885 states and 5328 transitions. [2025-02-06 08:20:47,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:20:47,546 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-02-06 08:20:47,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:20:47,565 INFO L225 Difference]: With dead ends: 3885 [2025-02-06 08:20:47,566 INFO L226 Difference]: Without dead ends: 3883 [2025-02-06 08:20:47,568 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-02-06 08:20:47,568 INFO L435 NwaCegarLoop]: 2737 mSDtfsCounter, 2717 mSDsluCounter, 2736 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2717 SdHoareTripleChecker+Valid, 5473 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:20:47,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2717 Valid, 5473 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:20:47,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3883 states. [2025-02-06 08:20:47,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3883 to 3883. [2025-02-06 08:20:47,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3883 states, 2647 states have (on average 1.2587835285228561) internal successors, (3332), 2752 states have internal predecessors, (3332), 989 states have call successors, (989), 229 states have call predecessors, (989), 224 states have return successors, (1005), 959 states have call predecessors, (1005), 977 states have call successors, (1005) [2025-02-06 08:20:47,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3883 states to 3883 states and 5326 transitions. [2025-02-06 08:20:47,793 INFO L78 Accepts]: Start accepts. Automaton has 3883 states and 5326 transitions. Word has length 105 [2025-02-06 08:20:47,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:20:47,793 INFO L471 AbstractCegarLoop]: Abstraction has 3883 states and 5326 transitions. [2025-02-06 08:20:47,793 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-02-06 08:20:47,793 INFO L276 IsEmpty]: Start isEmpty. Operand 3883 states and 5326 transitions. [2025-02-06 08:20:47,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-06 08:20:47,797 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:20:47,797 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-02-06 08:20:47,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 08:20:47,797 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-02-06 08:20:47,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:20:47,798 INFO L85 PathProgramCache]: Analyzing trace with hash 2077155890, now seen corresponding path program 1 times [2025-02-06 08:20:47,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:20:47,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146513136] [2025-02-06 08:20:47,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:20:47,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:20:48,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-06 08:20:48,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-06 08:20:48,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:20:48,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:20:48,511 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-02-06 08:20:48,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:20:48,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146513136] [2025-02-06 08:20:48,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146513136] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:20:48,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035717785] [2025-02-06 08:20:48,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:20:48,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:20:48,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:20:48,519 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:20:48,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 08:20:49,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-06 08:20:49,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-06 08:20:49,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:20:49,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:20:49,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 2391 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 08:20:49,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:20:50,014 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-06 08:20:50,014 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:20:50,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035717785] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:20:50,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:20:50,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-06 08:20:50,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712007547] [2025-02-06 08:20:50,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:20:50,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:20:50,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:20:50,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:20:50,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:20:50,016 INFO L87 Difference]: Start difference. First operand 3883 states and 5326 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-02-06 08:20:50,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:20:50,299 INFO L93 Difference]: Finished difference Result 7723 states and 10593 transitions. [2025-02-06 08:20:50,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:20:50,299 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-02-06 08:20:50,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:20:50,315 INFO L225 Difference]: With dead ends: 7723 [2025-02-06 08:20:50,316 INFO L226 Difference]: Without dead ends: 3877 [2025-02-06 08:20:50,329 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-02-06 08:20:50,329 INFO L435 NwaCegarLoop]: 2733 mSDtfsCounter, 2726 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2726 SdHoareTripleChecker+Valid, 2733 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:20:50,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2726 Valid, 2733 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:20:50,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3877 states. [2025-02-06 08:20:50,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3877 to 3877. [2025-02-06 08:20:50,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3877 states, 2642 states have (on average 1.2577592732778198) internal successors, (3323), 2746 states have internal predecessors, (3323), 989 states have call successors, (989), 229 states have call predecessors, (989), 224 states have return successors, (1005), 959 states have call predecessors, (1005), 977 states have call successors, (1005) [2025-02-06 08:20:50,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3877 states to 3877 states and 5317 transitions. [2025-02-06 08:20:50,579 INFO L78 Accepts]: Start accepts. Automaton has 3877 states and 5317 transitions. Word has length 126 [2025-02-06 08:20:50,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:20:50,580 INFO L471 AbstractCegarLoop]: Abstraction has 3877 states and 5317 transitions. [2025-02-06 08:20:50,580 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-02-06 08:20:50,580 INFO L276 IsEmpty]: Start isEmpty. Operand 3877 states and 5317 transitions. [2025-02-06 08:20:50,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-06 08:20:50,582 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:20:50,582 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-02-06 08:20:50,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 08:20:50,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:20:50,787 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-02-06 08:20:50,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:20:50,788 INFO L85 PathProgramCache]: Analyzing trace with hash -272033981, now seen corresponding path program 1 times [2025-02-06 08:20:50,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:20:50,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508299558] [2025-02-06 08:20:50,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:20:50,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:20:51,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-06 08:20:51,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-06 08:20:51,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:20:51,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:20:51,329 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-06 08:20:51,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:20:51,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508299558] [2025-02-06 08:20:51,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508299558] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:20:51,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:20:51,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:20:51,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536755893] [2025-02-06 08:20:51,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:20:51,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 08:20:51,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:20:51,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 08:20:51,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:20:51,331 INFO L87 Difference]: Start difference. First operand 3877 states and 5317 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-02-06 08:20:51,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:20:51,593 INFO L93 Difference]: Finished difference Result 7723 states and 10629 transitions. [2025-02-06 08:20:51,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:20:51,594 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-02-06 08:20:51,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:20:51,608 INFO L225 Difference]: With dead ends: 7723 [2025-02-06 08:20:51,608 INFO L226 Difference]: Without dead ends: 3883 [2025-02-06 08:20:51,620 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-02-06 08:20:51,621 INFO L435 NwaCegarLoop]: 2731 mSDtfsCounter, 0 mSDsluCounter, 8186 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10917 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:20:51,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10917 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:20:51,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3883 states. [2025-02-06 08:20:51,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3883 to 3883. [2025-02-06 08:20:51,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3883 states, 2648 states have (on average 1.2571752265861027) internal successors, (3329), 2752 states have internal predecessors, (3329), 989 states have call successors, (989), 229 states have call predecessors, (989), 224 states have return successors, (1005), 959 states have call predecessors, (1005), 977 states have call successors, (1005) [2025-02-06 08:20:51,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3883 states to 3883 states and 5323 transitions. [2025-02-06 08:20:51,905 INFO L78 Accepts]: Start accepts. Automaton has 3883 states and 5323 transitions. Word has length 130 [2025-02-06 08:20:51,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:20:51,906 INFO L471 AbstractCegarLoop]: Abstraction has 3883 states and 5323 transitions. [2025-02-06 08:20:51,907 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-02-06 08:20:51,907 INFO L276 IsEmpty]: Start isEmpty. Operand 3883 states and 5323 transitions. [2025-02-06 08:20:51,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-06 08:20:51,908 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:20:51,909 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-02-06 08:20:51,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 08:20:51,909 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-02-06 08:20:51,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:20:51,909 INFO L85 PathProgramCache]: Analyzing trace with hash -17075403, now seen corresponding path program 1 times [2025-02-06 08:20:51,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:20:51,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254070495] [2025-02-06 08:20:51,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:20:51,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:20:52,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 08:20:52,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 08:20:52,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:20:52,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:20:52,708 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:20:52,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:20:52,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254070495] [2025-02-06 08:20:52,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254070495] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:20:52,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:20:52,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:20:52,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717759913] [2025-02-06 08:20:52,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:20:52,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:20:52,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:20:52,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:20:52,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:20:52,710 INFO L87 Difference]: Start difference. First operand 3883 states and 5323 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-02-06 08:20:52,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:20:52,879 INFO L93 Difference]: Finished difference Result 3883 states and 5323 transitions. [2025-02-06 08:20:52,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:20:52,880 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-02-06 08:20:52,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:20:52,894 INFO L225 Difference]: With dead ends: 3883 [2025-02-06 08:20:52,895 INFO L226 Difference]: Without dead ends: 3881 [2025-02-06 08:20:52,896 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-02-06 08:20:52,897 INFO L435 NwaCegarLoop]: 2730 mSDtfsCounter, 2709 mSDsluCounter, 2729 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2709 SdHoareTripleChecker+Valid, 5459 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:20:52,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2709 Valid, 5459 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:20:52,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3881 states. [2025-02-06 08:20:53,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3881 to 3881. [2025-02-06 08:20:53,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3881 states, 2647 states have (on average 1.2568945976577257) internal successors, (3327), 2750 states have internal predecessors, (3327), 989 states have call successors, (989), 229 states have call predecessors, (989), 224 states have return successors, (1005), 959 states have call predecessors, (1005), 977 states have call successors, (1005) [2025-02-06 08:20:53,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3881 states to 3881 states and 5321 transitions. [2025-02-06 08:20:53,056 INFO L78 Accepts]: Start accepts. Automaton has 3881 states and 5321 transitions. Word has length 111 [2025-02-06 08:20:53,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:20:53,056 INFO L471 AbstractCegarLoop]: Abstraction has 3881 states and 5321 transitions. [2025-02-06 08:20:53,056 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-02-06 08:20:53,057 INFO L276 IsEmpty]: Start isEmpty. Operand 3881 states and 5321 transitions. [2025-02-06 08:20:53,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-06 08:20:53,058 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:20:53,058 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-02-06 08:20:53,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 08:20:53,059 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-02-06 08:20:53,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:20:53,059 INFO L85 PathProgramCache]: Analyzing trace with hash 665390423, now seen corresponding path program 1 times [2025-02-06 08:20:53,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:20:53,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939101450] [2025-02-06 08:20:53,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:20:53,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:20:53,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-06 08:20:53,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-06 08:20:53,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:20:53,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:20:54,246 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-06 08:20:54,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:20:54,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939101450] [2025-02-06 08:20:54,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939101450] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:20:54,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:20:54,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 08:20:54,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248423747] [2025-02-06 08:20:54,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:20:54,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:20:54,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:20:54,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:20:54,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:20:54,248 INFO L87 Difference]: Start difference. First operand 3881 states and 5321 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-02-06 08:20:58,274 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-02-06 08:21:00,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:21:00,444 INFO L93 Difference]: Finished difference Result 8975 states and 12257 transitions. [2025-02-06 08:21:00,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 08:21:00,445 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-02-06 08:21:00,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:21:00,465 INFO L225 Difference]: With dead ends: 8975 [2025-02-06 08:21:00,465 INFO L226 Difference]: Without dead ends: 5131 [2025-02-06 08:21:00,479 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-02-06 08:21:00,480 INFO L435 NwaCegarLoop]: 2729 mSDtfsCounter, 2684 mSDsluCounter, 7951 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2689 SdHoareTripleChecker+Valid, 10680 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2025-02-06 08:21:00,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2689 Valid, 10680 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1111 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2025-02-06 08:21:00,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5131 states. [2025-02-06 08:21:00,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5131 to 5117. [2025-02-06 08:21:00,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5117 states, 3485 states have (on average 1.2499282639885223) internal successors, (4356), 3618 states have internal predecessors, (4356), 1267 states have call successors, (1267), 353 states have call predecessors, (1267), 344 states have return successors, (1281), 1221 states have call predecessors, (1281), 1249 states have call successors, (1281) [2025-02-06 08:21:00,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5117 states to 5117 states and 6904 transitions. [2025-02-06 08:21:00,950 INFO L78 Accepts]: Start accepts. Automaton has 5117 states and 6904 transitions. Word has length 133 [2025-02-06 08:21:00,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:21:00,950 INFO L471 AbstractCegarLoop]: Abstraction has 5117 states and 6904 transitions. [2025-02-06 08:21:00,950 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-02-06 08:21:00,951 INFO L276 IsEmpty]: Start isEmpty. Operand 5117 states and 6904 transitions. [2025-02-06 08:21:00,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-06 08:21:00,953 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:21:00,953 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-02-06 08:21:00,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 08:21:00,953 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-02-06 08:21:00,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:21:00,954 INFO L85 PathProgramCache]: Analyzing trace with hash 665420214, now seen corresponding path program 1 times [2025-02-06 08:21:00,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:21:00,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403634483] [2025-02-06 08:21:00,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:21:00,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:21:01,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-06 08:21:01,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-06 08:21:01,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:21:01,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:21:01,768 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-06 08:21:01,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:21:01,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403634483] [2025-02-06 08:21:01,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403634483] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:21:01,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:21:01,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:21:01,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751847603] [2025-02-06 08:21:01,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:21:01,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:21:01,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:21:01,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:21:01,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:21:01,771 INFO L87 Difference]: Start difference. First operand 5117 states and 6904 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-02-06 08:21:02,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:21:02,055 INFO L93 Difference]: Finished difference Result 5123 states and 6911 transitions. [2025-02-06 08:21:02,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:21:02,056 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-02-06 08:21:02,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:21:02,075 INFO L225 Difference]: With dead ends: 5123 [2025-02-06 08:21:02,075 INFO L226 Difference]: Without dead ends: 5121 [2025-02-06 08:21:02,078 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-02-06 08:21:02,078 INFO L435 NwaCegarLoop]: 2730 mSDtfsCounter, 0 mSDsluCounter, 5454 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8184 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:21:02,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8184 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:21:02,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5121 states. [2025-02-06 08:21:02,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5121 to 5121. [2025-02-06 08:21:02,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5121 states, 3489 states have (on average 1.2490685010031528) internal successors, (4358), 3622 states have internal predecessors, (4358), 1267 states have call successors, (1267), 353 states have call predecessors, (1267), 344 states have return successors, (1281), 1221 states have call predecessors, (1281), 1249 states have call successors, (1281) [2025-02-06 08:21:02,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5121 states to 5121 states and 6906 transitions. [2025-02-06 08:21:02,302 INFO L78 Accepts]: Start accepts. Automaton has 5121 states and 6906 transitions. Word has length 133 [2025-02-06 08:21:02,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:21:02,302 INFO L471 AbstractCegarLoop]: Abstraction has 5121 states and 6906 transitions. [2025-02-06 08:21:02,302 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-02-06 08:21:02,302 INFO L276 IsEmpty]: Start isEmpty. Operand 5121 states and 6906 transitions. [2025-02-06 08:21:02,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-06 08:21:02,303 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:21:02,303 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-02-06 08:21:02,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 08:21:02,304 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-02-06 08:21:02,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:21:02,304 INFO L85 PathProgramCache]: Analyzing trace with hash 770530896, now seen corresponding path program 1 times [2025-02-06 08:21:02,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:21:02,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043680537] [2025-02-06 08:21:02,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:21:02,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:21:02,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-06 08:21:02,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 08:21:02,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:21:02,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:21:02,868 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:21:02,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:21:02,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043680537] [2025-02-06 08:21:02,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043680537] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:21:02,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:21:02,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:21:02,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946700612] [2025-02-06 08:21:02,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:21:02,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:21:02,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:21:02,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:21:02,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:21:02,870 INFO L87 Difference]: Start difference. First operand 5121 states and 6906 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-02-06 08:21:03,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:21:03,084 INFO L93 Difference]: Finished difference Result 5121 states and 6906 transitions. [2025-02-06 08:21:03,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:21:03,085 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-02-06 08:21:03,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:21:03,100 INFO L225 Difference]: With dead ends: 5121 [2025-02-06 08:21:03,101 INFO L226 Difference]: Without dead ends: 5119 [2025-02-06 08:21:03,102 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-02-06 08:21:03,102 INFO L435 NwaCegarLoop]: 2728 mSDtfsCounter, 2705 mSDsluCounter, 2727 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2705 SdHoareTripleChecker+Valid, 5455 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:21:03,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2705 Valid, 5455 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:21:03,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5119 states. [2025-02-06 08:21:03,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5119 to 5119. [2025-02-06 08:21:03,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5119 states, 3488 states have (on average 1.2488532110091743) internal successors, (4356), 3620 states have internal predecessors, (4356), 1267 states have call successors, (1267), 353 states have call predecessors, (1267), 344 states have return successors, (1281), 1221 states have call predecessors, (1281), 1249 states have call successors, (1281) [2025-02-06 08:21:03,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5119 states to 5119 states and 6904 transitions. [2025-02-06 08:21:03,316 INFO L78 Accepts]: Start accepts. Automaton has 5119 states and 6904 transitions. Word has length 113 [2025-02-06 08:21:03,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:21:03,317 INFO L471 AbstractCegarLoop]: Abstraction has 5119 states and 6904 transitions. [2025-02-06 08:21:03,317 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-02-06 08:21:03,317 INFO L276 IsEmpty]: Start isEmpty. Operand 5119 states and 6904 transitions. [2025-02-06 08:21:03,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-06 08:21:03,319 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:21:03,319 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-02-06 08:21:03,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 08:21:03,319 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-02-06 08:21:03,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:21:03,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1379582927, now seen corresponding path program 1 times [2025-02-06 08:21:03,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:21:03,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268955640] [2025-02-06 08:21:03,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:21:03,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:21:03,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-06 08:21:03,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-06 08:21:03,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:21:03,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:21:03,840 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-06 08:21:03,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:21:03,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268955640] [2025-02-06 08:21:03,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268955640] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:21:03,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:21:03,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:21:03,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130566745] [2025-02-06 08:21:03,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:21:03,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:21:03,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:21:03,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:21:03,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:21:03,843 INFO L87 Difference]: Start difference. First operand 5119 states and 6904 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-02-06 08:21:04,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:21:04,088 INFO L93 Difference]: Finished difference Result 10191 states and 13826 transitions. [2025-02-06 08:21:04,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:21:04,088 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-02-06 08:21:04,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:21:04,108 INFO L225 Difference]: With dead ends: 10191 [2025-02-06 08:21:04,109 INFO L226 Difference]: Without dead ends: 5109 [2025-02-06 08:21:04,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-02-06 08:21:04,125 INFO L435 NwaCegarLoop]: 2724 mSDtfsCounter, 2688 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2688 SdHoareTripleChecker+Valid, 2724 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:21:04,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2688 Valid, 2724 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:21:04,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5109 states. [2025-02-06 08:21:04,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5109 to 5109. [2025-02-06 08:21:04,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5109 states, 3479 states have (on average 1.2471974705375108) internal successors, (4339), 3610 states have internal predecessors, (4339), 1267 states have call successors, (1267), 353 states have call predecessors, (1267), 344 states have return successors, (1281), 1221 states have call predecessors, (1281), 1249 states have call successors, (1281) [2025-02-06 08:21:04,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5109 states to 5109 states and 6887 transitions. [2025-02-06 08:21:04,362 INFO L78 Accepts]: Start accepts. Automaton has 5109 states and 6887 transitions. Word has length 137 [2025-02-06 08:21:04,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:21:04,363 INFO L471 AbstractCegarLoop]: Abstraction has 5109 states and 6887 transitions. [2025-02-06 08:21:04,363 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-02-06 08:21:04,363 INFO L276 IsEmpty]: Start isEmpty. Operand 5109 states and 6887 transitions. [2025-02-06 08:21:04,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-06 08:21:04,364 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:21:04,364 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-02-06 08:21:04,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 08:21:04,364 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-02-06 08:21:04,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:21:04,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1237142651, now seen corresponding path program 1 times [2025-02-06 08:21:04,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:21:04,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835864965] [2025-02-06 08:21:04,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:21:04,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:21:04,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 08:21:04,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 08:21:04,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:21:04,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:21:04,911 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:21:04,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:21:04,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835864965] [2025-02-06 08:21:04,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835864965] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:21:04,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:21:04,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:21:04,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242237947] [2025-02-06 08:21:04,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:21:04,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:21:04,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:21:04,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:21:04,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:21:04,914 INFO L87 Difference]: Start difference. First operand 5109 states and 6887 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-02-06 08:21:05,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:21:05,162 INFO L93 Difference]: Finished difference Result 5109 states and 6887 transitions. [2025-02-06 08:21:05,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:21:05,163 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-02-06 08:21:05,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:21:05,180 INFO L225 Difference]: With dead ends: 5109 [2025-02-06 08:21:05,180 INFO L226 Difference]: Without dead ends: 5107 [2025-02-06 08:21:05,182 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-02-06 08:21:05,182 INFO L435 NwaCegarLoop]: 2721 mSDtfsCounter, 2699 mSDsluCounter, 2720 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2699 SdHoareTripleChecker+Valid, 5441 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:21:05,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2699 Valid, 5441 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:21:05,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5107 states. [2025-02-06 08:21:05,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5107 to 5107. [2025-02-06 08:21:05,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5107 states, 3478 states have (on average 1.2469810235767682) internal successors, (4337), 3608 states have internal predecessors, (4337), 1267 states have call successors, (1267), 353 states have call predecessors, (1267), 344 states have return successors, (1281), 1221 states have call predecessors, (1281), 1249 states have call successors, (1281) [2025-02-06 08:21:05,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5107 states to 5107 states and 6885 transitions. [2025-02-06 08:21:05,428 INFO L78 Accepts]: Start accepts. Automaton has 5107 states and 6885 transitions. Word has length 119 [2025-02-06 08:21:05,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:21:05,428 INFO L471 AbstractCegarLoop]: Abstraction has 5107 states and 6885 transitions. [2025-02-06 08:21:05,428 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-02-06 08:21:05,429 INFO L276 IsEmpty]: Start isEmpty. Operand 5107 states and 6885 transitions. [2025-02-06 08:21:05,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 08:21:05,430 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:21:05,430 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-02-06 08:21:05,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 08:21:05,430 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-02-06 08:21:05,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:21:05,430 INFO L85 PathProgramCache]: Analyzing trace with hash 401703587, now seen corresponding path program 1 times [2025-02-06 08:21:05,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:21:05,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139602038] [2025-02-06 08:21:05,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:21:05,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:21:05,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 08:21:05,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 08:21:05,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:21:05,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:21:06,167 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:21:06,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:21:06,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139602038] [2025-02-06 08:21:06,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139602038] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:21:06,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:21:06,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:21:06,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240993265] [2025-02-06 08:21:06,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:21:06,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:21:06,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:21:06,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:21:06,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:21:06,169 INFO L87 Difference]: Start difference. First operand 5107 states and 6885 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-02-06 08:21:06,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:21:06,543 INFO L93 Difference]: Finished difference Result 5107 states and 6885 transitions. [2025-02-06 08:21:06,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:21:06,543 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-02-06 08:21:06,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:21:06,563 INFO L225 Difference]: With dead ends: 5107 [2025-02-06 08:21:06,563 INFO L226 Difference]: Without dead ends: 5105 [2025-02-06 08:21:06,565 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-02-06 08:21:06,566 INFO L435 NwaCegarLoop]: 2719 mSDtfsCounter, 2696 mSDsluCounter, 2718 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2696 SdHoareTripleChecker+Valid, 5437 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:21:06,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2696 Valid, 5437 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:21:06,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5105 states. [2025-02-06 08:21:06,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5105 to 5105. [2025-02-06 08:21:06,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5105 states, 3477 states have (on average 1.2467644521138912) internal successors, (4335), 3606 states have internal predecessors, (4335), 1267 states have call successors, (1267), 353 states have call predecessors, (1267), 344 states have return successors, (1281), 1221 states have call predecessors, (1281), 1249 states have call successors, (1281) [2025-02-06 08:21:06,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5105 states to 5105 states and 6883 transitions. [2025-02-06 08:21:06,826 INFO L78 Accepts]: Start accepts. Automaton has 5105 states and 6883 transitions. Word has length 125 [2025-02-06 08:21:06,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:21:06,827 INFO L471 AbstractCegarLoop]: Abstraction has 5105 states and 6883 transitions. [2025-02-06 08:21:06,827 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-02-06 08:21:06,827 INFO L276 IsEmpty]: Start isEmpty. Operand 5105 states and 6883 transitions. [2025-02-06 08:21:06,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-06 08:21:06,829 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:21:06,829 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-02-06 08:21:06,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 08:21:06,829 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-02-06 08:21:06,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:21:06,830 INFO L85 PathProgramCache]: Analyzing trace with hash -441113452, now seen corresponding path program 1 times [2025-02-06 08:21:06,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:21:06,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429625096] [2025-02-06 08:21:06,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:21:06,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:21:07,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-06 08:21:07,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-06 08:21:07,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:21:07,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:21:07,406 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:21:07,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:21:07,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429625096] [2025-02-06 08:21:07,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429625096] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:21:07,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:21:07,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:21:07,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588206961] [2025-02-06 08:21:07,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:21:07,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:21:07,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:21:07,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:21:07,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:21:07,409 INFO L87 Difference]: Start difference. First operand 5105 states and 6883 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-02-06 08:21:07,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:21:07,690 INFO L93 Difference]: Finished difference Result 5105 states and 6883 transitions. [2025-02-06 08:21:07,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:21:07,691 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-02-06 08:21:07,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:21:07,710 INFO L225 Difference]: With dead ends: 5105 [2025-02-06 08:21:07,710 INFO L226 Difference]: Without dead ends: 5103 [2025-02-06 08:21:07,712 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-02-06 08:21:07,713 INFO L435 NwaCegarLoop]: 2717 mSDtfsCounter, 2693 mSDsluCounter, 2716 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2693 SdHoareTripleChecker+Valid, 5433 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:21:07,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2693 Valid, 5433 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:21:07,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5103 states. [2025-02-06 08:21:07,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5103 to 5103. [2025-02-06 08:21:07,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5103 states, 3476 states have (on average 1.2465477560414269) internal successors, (4333), 3604 states have internal predecessors, (4333), 1267 states have call successors, (1267), 353 states have call predecessors, (1267), 344 states have return successors, (1281), 1221 states have call predecessors, (1281), 1249 states have call successors, (1281) [2025-02-06 08:21:07,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5103 states to 5103 states and 6881 transitions. [2025-02-06 08:21:07,982 INFO L78 Accepts]: Start accepts. Automaton has 5103 states and 6881 transitions. Word has length 131 [2025-02-06 08:21:07,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:21:07,982 INFO L471 AbstractCegarLoop]: Abstraction has 5103 states and 6881 transitions. [2025-02-06 08:21:07,982 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-02-06 08:21:07,982 INFO L276 IsEmpty]: Start isEmpty. Operand 5103 states and 6881 transitions. [2025-02-06 08:21:07,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-06 08:21:07,984 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:21:07,984 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-02-06 08:21:07,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 08:21:07,984 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-02-06 08:21:07,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:21:07,985 INFO L85 PathProgramCache]: Analyzing trace with hash -256511468, now seen corresponding path program 1 times [2025-02-06 08:21:07,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:21:07,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400452879] [2025-02-06 08:21:07,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:21:07,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:21:08,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-06 08:21:08,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-06 08:21:08,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:21:08,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:21:08,548 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:21:08,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:21:08,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400452879] [2025-02-06 08:21:08,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400452879] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:21:08,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:21:08,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:21:08,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821028444] [2025-02-06 08:21:08,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:21:08,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:21:08,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:21:08,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:21:08,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:21:08,550 INFO L87 Difference]: Start difference. First operand 5103 states and 6881 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-02-06 08:21:08,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:21:08,822 INFO L93 Difference]: Finished difference Result 5103 states and 6881 transitions. [2025-02-06 08:21:08,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:21:08,822 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-02-06 08:21:08,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:21:08,840 INFO L225 Difference]: With dead ends: 5103 [2025-02-06 08:21:08,841 INFO L226 Difference]: Without dead ends: 5101 [2025-02-06 08:21:08,843 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-02-06 08:21:08,843 INFO L435 NwaCegarLoop]: 2715 mSDtfsCounter, 2690 mSDsluCounter, 2714 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2690 SdHoareTripleChecker+Valid, 5429 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:21:08,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2690 Valid, 5429 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:21:08,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5101 states. [2025-02-06 08:21:09,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5101 to 5101. [2025-02-06 08:21:09,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5101 states, 3475 states have (on average 1.2463309352517986) internal successors, (4331), 3602 states have internal predecessors, (4331), 1267 states have call successors, (1267), 353 states have call predecessors, (1267), 344 states have return successors, (1281), 1221 states have call predecessors, (1281), 1249 states have call successors, (1281) [2025-02-06 08:21:09,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5101 states to 5101 states and 6879 transitions. [2025-02-06 08:21:09,123 INFO L78 Accepts]: Start accepts. Automaton has 5101 states and 6879 transitions. Word has length 137 [2025-02-06 08:21:09,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:21:09,124 INFO L471 AbstractCegarLoop]: Abstraction has 5101 states and 6879 transitions. [2025-02-06 08:21:09,125 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-02-06 08:21:09,125 INFO L276 IsEmpty]: Start isEmpty. Operand 5101 states and 6879 transitions. [2025-02-06 08:21:09,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-06 08:21:09,128 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:21:09,128 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-02-06 08:21:09,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 08:21:09,128 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-02-06 08:21:09,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:21:09,129 INFO L85 PathProgramCache]: Analyzing trace with hash 947933692, now seen corresponding path program 1 times [2025-02-06 08:21:09,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:21:09,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119802900] [2025-02-06 08:21:09,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:21:09,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:21:09,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 08:21:09,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 08:21:09,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:21:09,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:21:09,656 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:21:09,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:21:09,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119802900] [2025-02-06 08:21:09,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119802900] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:21:09,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:21:09,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:21:09,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503483176] [2025-02-06 08:21:09,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:21:09,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:21:09,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:21:09,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:21:09,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:21:09,658 INFO L87 Difference]: Start difference. First operand 5101 states and 6879 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-02-06 08:21:09,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:21:09,938 INFO L93 Difference]: Finished difference Result 5101 states and 6879 transitions. [2025-02-06 08:21:09,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:21:09,938 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-02-06 08:21:09,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:21:09,956 INFO L225 Difference]: With dead ends: 5101 [2025-02-06 08:21:09,956 INFO L226 Difference]: Without dead ends: 5099 [2025-02-06 08:21:09,958 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-02-06 08:21:09,959 INFO L435 NwaCegarLoop]: 2713 mSDtfsCounter, 2687 mSDsluCounter, 2712 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2687 SdHoareTripleChecker+Valid, 5425 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:21:09,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2687 Valid, 5425 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:21:09,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5099 states. [2025-02-06 08:21:10,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5099 to 5099. [2025-02-06 08:21:10,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5099 states, 3474 states have (on average 1.2461139896373057) internal successors, (4329), 3600 states have internal predecessors, (4329), 1267 states have call successors, (1267), 353 states have call predecessors, (1267), 344 states have return successors, (1281), 1221 states have call predecessors, (1281), 1249 states have call successors, (1281) [2025-02-06 08:21:10,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5099 states to 5099 states and 6877 transitions. [2025-02-06 08:21:10,247 INFO L78 Accepts]: Start accepts. Automaton has 5099 states and 6877 transitions. Word has length 143 [2025-02-06 08:21:10,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:21:10,247 INFO L471 AbstractCegarLoop]: Abstraction has 5099 states and 6877 transitions. [2025-02-06 08:21:10,248 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-02-06 08:21:10,248 INFO L276 IsEmpty]: Start isEmpty. Operand 5099 states and 6877 transitions. [2025-02-06 08:21:10,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-02-06 08:21:10,249 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:21:10,249 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-02-06 08:21:10,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 08:21:10,250 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-02-06 08:21:10,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:21:10,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1963627135, now seen corresponding path program 1 times [2025-02-06 08:21:10,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:21:10,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789603960] [2025-02-06 08:21:10,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:21:10,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:21:10,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-06 08:21:10,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-06 08:21:10,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:21:10,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:21:11,702 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-02-06 08:21:11,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:21:11,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789603960] [2025-02-06 08:21:11,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789603960] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:21:11,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:21:11,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-06 08:21:11,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433206979] [2025-02-06 08:21:11,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:21:11,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 08:21:11,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:21:11,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 08:21:11,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2025-02-06 08:21:11,703 INFO L87 Difference]: Start difference. First operand 5099 states and 6877 transitions. Second operand has 16 states, 15 states have (on average 4.666666666666667) internal successors, (70), 14 states have internal predecessors, (70), 6 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (21), 7 states have call predecessors, (21), 6 states have call successors, (21) [2025-02-06 08:21:12,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:21:12,848 INFO L93 Difference]: Finished difference Result 6551 states and 8741 transitions. [2025-02-06 08:21:12,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-06 08:21:12,849 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.666666666666667) internal successors, (70), 14 states have internal predecessors, (70), 6 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (21), 7 states have call predecessors, (21), 6 states have call successors, (21) Word has length 172 [2025-02-06 08:21:12,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:21:12,870 INFO L225 Difference]: With dead ends: 6551 [2025-02-06 08:21:12,870 INFO L226 Difference]: Without dead ends: 5215 [2025-02-06 08:21:12,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2025-02-06 08:21:12,876 INFO L435 NwaCegarLoop]: 2707 mSDtfsCounter, 26 mSDsluCounter, 37809 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 40516 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 08:21:12,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 40516 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 08:21:12,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5215 states. [2025-02-06 08:21:13,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5215 to 5135. [2025-02-06 08:21:13,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5135 states, 3500 states have (on average 1.2442857142857142) internal successors, (4355), 3626 states have internal predecessors, (4355), 1275 states have call successors, (1275), 353 states have call predecessors, (1275), 346 states have return successors, (1293), 1231 states have call predecessors, (1293), 1257 states have call successors, (1293) [2025-02-06 08:21:13,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5135 states to 5135 states and 6923 transitions. [2025-02-06 08:21:13,184 INFO L78 Accepts]: Start accepts. Automaton has 5135 states and 6923 transitions. Word has length 172 [2025-02-06 08:21:13,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:21:13,185 INFO L471 AbstractCegarLoop]: Abstraction has 5135 states and 6923 transitions. [2025-02-06 08:21:13,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.666666666666667) internal successors, (70), 14 states have internal predecessors, (70), 6 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (21), 7 states have call predecessors, (21), 6 states have call successors, (21) [2025-02-06 08:21:13,185 INFO L276 IsEmpty]: Start isEmpty. Operand 5135 states and 6923 transitions. [2025-02-06 08:21:13,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-06 08:21:13,186 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:21:13,186 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, 1, 1, 1, 1, 1, 1] [2025-02-06 08:21:13,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 08:21:13,187 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-02-06 08:21:13,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:21:13,187 INFO L85 PathProgramCache]: Analyzing trace with hash 981885935, now seen corresponding path program 1 times [2025-02-06 08:21:13,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:21:13,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053886190] [2025-02-06 08:21:13,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:21:13,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:21:13,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-06 08:21:13,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-06 08:21:13,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:21:13,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:21:13,770 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:21:13,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:21:13,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053886190] [2025-02-06 08:21:13,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053886190] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:21:13,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:21:13,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:21:13,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292383160] [2025-02-06 08:21:13,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:21:13,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:21:13,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:21:13,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:21:13,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:21:13,771 INFO L87 Difference]: Start difference. First operand 5135 states and 6923 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 08:21:14,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:21:14,095 INFO L93 Difference]: Finished difference Result 5135 states and 6923 transitions. [2025-02-06 08:21:14,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:21:14,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 149 [2025-02-06 08:21:14,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:21:14,112 INFO L225 Difference]: With dead ends: 5135 [2025-02-06 08:21:14,113 INFO L226 Difference]: Without dead ends: 5133 [2025-02-06 08:21:14,115 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-02-06 08:21:14,116 INFO L435 NwaCegarLoop]: 2711 mSDtfsCounter, 2684 mSDsluCounter, 2710 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2684 SdHoareTripleChecker+Valid, 5421 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:21:14,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2684 Valid, 5421 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:21:14,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5133 states. [2025-02-06 08:21:14,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5133 to 5133. [2025-02-06 08:21:14,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5133 states, 3499 states have (on average 1.2440697342097742) internal successors, (4353), 3624 states have internal predecessors, (4353), 1275 states have call successors, (1275), 353 states have call predecessors, (1275), 346 states have return successors, (1293), 1231 states have call predecessors, (1293), 1257 states have call successors, (1293) [2025-02-06 08:21:14,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5133 states to 5133 states and 6921 transitions. [2025-02-06 08:21:14,428 INFO L78 Accepts]: Start accepts. Automaton has 5133 states and 6921 transitions. Word has length 149 [2025-02-06 08:21:14,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:21:14,428 INFO L471 AbstractCegarLoop]: Abstraction has 5133 states and 6921 transitions. [2025-02-06 08:21:14,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 08:21:14,431 INFO L276 IsEmpty]: Start isEmpty. Operand 5133 states and 6921 transitions. [2025-02-06 08:21:14,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-02-06 08:21:14,432 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:21:14,432 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-02-06 08:21:14,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 08:21:14,433 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-02-06 08:21:14,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:21:14,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1929954494, now seen corresponding path program 1 times [2025-02-06 08:21:14,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:21:14,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447840849] [2025-02-06 08:21:14,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:21:14,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:21:14,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-06 08:21:14,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-06 08:21:14,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:21:14,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:21:15,960 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 6 proven. 48 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2025-02-06 08:21:15,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:21:15,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447840849] [2025-02-06 08:21:15,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447840849] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:21:15,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050639946] [2025-02-06 08:21:15,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:21:15,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:21:15,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:21:15,964 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:21:15,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 08:21:17,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-06 08:21:17,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-06 08:21:17,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:21:17,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:21:17,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 2468 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-02-06 08:21:17,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:21:17,819 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 179 proven. 3 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2025-02-06 08:21:17,819 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:21:18,214 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 08:21:18,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050639946] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:21:18,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:21:18,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 14 [2025-02-06 08:21:18,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302835260] [2025-02-06 08:21:18,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:21:18,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 08:21:18,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:21:18,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 08:21:18,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-02-06 08:21:18,216 INFO L87 Difference]: Start difference. First operand 5133 states and 6921 transitions. Second operand has 14 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 12 states have internal predecessors, (95), 5 states have call successors, (45), 2 states have call predecessors, (45), 5 states have return successors, (46), 6 states have call predecessors, (46), 5 states have call successors, (46) [2025-02-06 08:21:18,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:21:18,994 INFO L93 Difference]: Finished difference Result 10233 states and 13796 transitions. [2025-02-06 08:21:18,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 08:21:18,995 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 12 states have internal predecessors, (95), 5 states have call successors, (45), 2 states have call predecessors, (45), 5 states have return successors, (46), 6 states have call predecessors, (46), 5 states have call successors, (46) Word has length 185 [2025-02-06 08:21:18,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:21:19,011 INFO L225 Difference]: With dead ends: 10233 [2025-02-06 08:21:19,011 INFO L226 Difference]: Without dead ends: 5133 [2025-02-06 08:21:19,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 364 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-02-06 08:21:19,020 INFO L435 NwaCegarLoop]: 2686 mSDtfsCounter, 106 mSDsluCounter, 21377 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 24063 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 08:21:19,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 24063 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 08:21:19,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5133 states. [2025-02-06 08:21:19,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5133 to 5133. [2025-02-06 08:21:19,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5133 states, 3499 states have (on average 1.2437839382680766) internal successors, (4352), 3623 states have internal predecessors, (4352), 1275 states have call successors, (1275), 353 states have call predecessors, (1275), 346 states have return successors, (1293), 1231 states have call predecessors, (1293), 1257 states have call successors, (1293) [2025-02-06 08:21:19,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5133 states to 5133 states and 6920 transitions. [2025-02-06 08:21:19,327 INFO L78 Accepts]: Start accepts. Automaton has 5133 states and 6920 transitions. Word has length 185 [2025-02-06 08:21:19,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:21:19,327 INFO L471 AbstractCegarLoop]: Abstraction has 5133 states and 6920 transitions. [2025-02-06 08:21:19,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 12 states have internal predecessors, (95), 5 states have call successors, (45), 2 states have call predecessors, (45), 5 states have return successors, (46), 6 states have call predecessors, (46), 5 states have call successors, (46) [2025-02-06 08:21:19,327 INFO L276 IsEmpty]: Start isEmpty. Operand 5133 states and 6920 transitions. [2025-02-06 08:21:19,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-02-06 08:21:19,328 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:21:19,328 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:21:19,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 08:21:19,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:21:19,529 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-02-06 08:21:19,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:21:19,530 INFO L85 PathProgramCache]: Analyzing trace with hash -13968895, now seen corresponding path program 1 times [2025-02-06 08:21:19,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:21:19,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066563123] [2025-02-06 08:21:19,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:21:19,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:21:19,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-06 08:21:20,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-06 08:21:20,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:21:20,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 08:21:20,251 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 08:21:20,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes.