./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 551b0097 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-?-551b009-m [2025-01-09 20:26:04,934 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 20:26:04,988 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 20:26:04,992 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 20:26:04,996 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 20:26:05,025 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 20:26:05,026 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 20:26:05,026 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 20:26:05,027 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 20:26:05,027 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 20:26:05,028 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 20:26:05,028 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 20:26:05,028 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 20:26:05,028 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 20:26:05,028 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 20:26:05,029 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 20:26:05,029 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 20:26:05,029 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 20:26:05,029 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 20:26:05,029 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 20:26:05,029 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 20:26:05,029 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 20:26:05,029 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 20:26:05,029 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 20:26:05,030 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 20:26:05,030 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 20:26:05,030 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:26:05,030 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:26:05,030 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:26:05,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:26:05,030 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 20:26:05,030 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:26:05,030 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:26:05,031 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:26:05,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:26:05,031 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 20:26:05,031 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 20:26:05,031 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 20:26:05,031 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 20:26:05,031 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 20:26:05,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 20:26:05,032 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 20:26:05,032 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 20:26:05,032 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 20:26:05,032 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 20:26:05,032 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-01-09 20:26:05,317 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 20:26:05,329 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 20:26:05,331 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 20:26:05,332 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 20:26:05,332 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 20:26:05,333 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-01-09 20:26:06,658 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a9cdd6b2/512bc4c8732f4aeeb5b3c6397a9da90a/FLAGaacaefe29 [2025-01-09 20:26:07,411 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 20:26:07,411 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-01-09 20:26:07,484 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a9cdd6b2/512bc4c8732f4aeeb5b3c6397a9da90a/FLAGaacaefe29 [2025-01-09 20:26:07,733 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a9cdd6b2/512bc4c8732f4aeeb5b3c6397a9da90a [2025-01-09 20:26:07,736 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 20:26:07,737 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 20:26:07,738 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 20:26:07,738 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 20:26:07,741 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 20:26:07,742 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:26:07" (1/1) ... [2025-01-09 20:26:07,743 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5abde171 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:26:07, skipping insertion in model container [2025-01-09 20:26:07,743 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:26:07" (1/1) ... [2025-01-09 20:26:07,876 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 20:26:12,604 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-01-09 20:26:12,610 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-01-09 20:26:12,611 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-01-09 20:26:12,611 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-01-09 20:26:12,611 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-01-09 20:26:12,611 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-01-09 20:26:12,611 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-01-09 20:26:12,613 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-01-09 20:26:12,614 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-01-09 20:26:12,614 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-01-09 20:26:12,614 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-01-09 20:26:12,614 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-01-09 20:26:12,615 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-01-09 20:26:12,615 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-01-09 20:26:12,615 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-01-09 20:26:12,615 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-01-09 20:26:12,615 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-01-09 20:26:12,615 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-01-09 20:26:12,615 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-01-09 20:26:12,616 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-01-09 20:26:12,616 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-01-09 20:26:12,616 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-01-09 20:26:12,616 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-01-09 20:26:12,616 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-01-09 20:26:12,621 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-01-09 20:26:12,621 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-01-09 20:26:12,621 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-01-09 20:26:12,622 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-01-09 20:26:12,622 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-01-09 20:26:12,622 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-01-09 20:26:12,622 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-01-09 20:26:12,622 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-01-09 20:26:12,622 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-01-09 20:26:12,623 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-01-09 20:26:12,623 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-01-09 20:26:12,623 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-01-09 20:26:12,623 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-01-09 20:26:12,623 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-01-09 20:26:12,623 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-01-09 20:26:12,623 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-01-09 20:26:12,628 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-01-09 20:26:12,629 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-01-09 20:26:12,629 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-01-09 20:26:12,630 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-01-09 20:26:12,630 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-01-09 20:26:12,630 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-01-09 20:26:12,630 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-01-09 20:26:12,631 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-01-09 20:26:12,631 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-01-09 20:26:12,631 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-01-09 20:26:12,632 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-01-09 20:26:12,632 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-01-09 20:26:12,632 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-01-09 20:26:12,633 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-01-09 20:26:12,633 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-01-09 20:26:12,634 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-01-09 20:26:12,634 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-01-09 20:26:12,634 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-01-09 20:26:12,635 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-01-09 20:26:12,635 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-01-09 20:26:12,635 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-01-09 20:26:12,636 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-01-09 20:26:12,636 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-01-09 20:26:12,636 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-01-09 20:26:12,637 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-01-09 20:26:12,637 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-01-09 20:26:12,637 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-01-09 20:26:12,637 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-01-09 20:26:12,638 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-01-09 20:26:12,638 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-01-09 20:26:12,638 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-01-09 20:26:12,639 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-01-09 20:26:12,639 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-01-09 20:26:12,639 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-01-09 20:26:12,639 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-01-09 20:26:12,640 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-01-09 20:26:12,640 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-01-09 20:26:12,640 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-01-09 20:26:12,641 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-01-09 20:26:12,641 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-01-09 20:26:12,641 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-01-09 20:26:12,641 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-01-09 20:26:12,642 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-01-09 20:26:12,642 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-01-09 20:26:12,642 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-01-09 20:26:12,642 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-01-09 20:26:12,642 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-01-09 20:26:12,643 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-01-09 20:26:12,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:26:12,686 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 20:26:12,815 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-01-09 20:26:12,822 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-01-09 20:26:12,822 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("":); [7336] [2025-01-09 20:26:12,825 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-01-09 20:26:12,825 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-01-09 20:26:12,829 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-01-09 20:26:12,830 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-01-09 20:26:12,836 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-01-09 20:26:12,838 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-01-09 20:26:12,839 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-01-09 20:26:12,841 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-01-09 20:26:12,861 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("mfence": : : "memory"); [8141] [2025-01-09 20:26:13,062 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-01-09 20:26:13,063 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-01-09 20:26:13,063 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-01-09 20:26:13,063 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-01-09 20:26:13,064 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-01-09 20:26:13,066 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-01-09 20:26:13,066 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-01-09 20:26:13,067 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-01-09 20:26:13,067 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-01-09 20:26:13,067 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-01-09 20:26:13,067 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-01-09 20:26:13,067 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-01-09 20:26:13,067 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-01-09 20:26:13,067 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-01-09 20:26:13,067 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-01-09 20:26:13,221 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-01-09 20:26:13,222 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-01-09 20:26:13,222 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-01-09 20:26:13,223 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-01-09 20:26:13,223 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-01-09 20:26:13,223 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-01-09 20:26:13,224 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-01-09 20:26:13,224 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-01-09 20:26:13,224 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-01-09 20:26:13,225 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-01-09 20:26:13,225 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-01-09 20:26:13,226 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-01-09 20:26:13,226 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-01-09 20:26:13,226 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-01-09 20:26:13,226 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-01-09 20:26:13,227 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-01-09 20:26:13,228 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-01-09 20:26:13,228 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-01-09 20:26:13,228 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-01-09 20:26:13,228 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-01-09 20:26:13,229 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-01-09 20:26:13,229 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-01-09 20:26:13,229 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-01-09 20:26:13,229 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-01-09 20:26:13,230 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-01-09 20:26:13,231 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-01-09 20:26:13,232 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-01-09 20:26:13,232 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-01-09 20:26:13,233 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-01-09 20:26:13,233 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-01-09 20:26:13,233 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-01-09 20:26:13,233 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-01-09 20:26:13,233 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-01-09 20:26:13,234 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-01-09 20:26:13,234 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-01-09 20:26:13,234 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-01-09 20:26:13,234 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-01-09 20:26:13,234 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-01-09 20:26:13,235 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-01-09 20:26:13,235 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-01-09 20:26:13,235 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-01-09 20:26:13,235 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-01-09 20:26:13,235 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-01-09 20:26:13,235 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-01-09 20:26:13,236 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-01-09 20:26:13,236 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-01-09 20:26:13,236 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-01-09 20:26:13,236 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-01-09 20:26:13,236 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-01-09 20:26:13,238 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-01-09 20:26:13,239 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-01-09 20:26:13,239 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-01-09 20:26:13,239 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-01-09 20:26:13,239 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-01-09 20:26:13,239 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-01-09 20:26:13,240 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-01-09 20:26:13,240 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-01-09 20:26:13,240 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-01-09 20:26:13,240 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-01-09 20:26:13,240 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-01-09 20:26:13,241 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-01-09 20:26:13,241 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-01-09 20:26:13,241 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-01-09 20:26:13,242 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-01-09 20:26:13,242 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-01-09 20:26:13,245 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-01-09 20:26:13,246 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-01-09 20:26:13,246 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-01-09 20:26:13,247 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-01-09 20:26:13,247 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-01-09 20:26:13,248 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-01-09 20:26:13,248 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-01-09 20:26:13,248 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-01-09 20:26:13,248 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-01-09 20:26:13,249 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-01-09 20:26:13,249 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-01-09 20:26:13,250 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-01-09 20:26:13,250 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-01-09 20:26:13,250 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-01-09 20:26:13,250 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-01-09 20:26:13,250 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-01-09 20:26:13,251 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-01-09 20:26:13,251 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-01-09 20:26:13,252 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-01-09 20:26:13,253 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-01-09 20:26:13,253 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-01-09 20:26:13,254 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-01-09 20:26:13,254 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-01-09 20:26:13,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:26:13,439 INFO L204 MainTranslator]: Completed translation [2025-01-09 20:26:13,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:26:13 WrapperNode [2025-01-09 20:26:13,440 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 20:26:13,440 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 20:26:13,441 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 20:26:13,441 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 20:26:13,445 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:26:13" (1/1) ... [2025-01-09 20:26:13,504 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:26:13" (1/1) ... [2025-01-09 20:26:13,677 INFO L138 Inliner]: procedures = 673, calls = 2736, calls flagged for inlining = 296, calls inlined = 204, statements flattened = 6371 [2025-01-09 20:26:13,678 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 20:26:13,678 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 20:26:13,678 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 20:26:13,679 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 20:26:13,688 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:26:13" (1/1) ... [2025-01-09 20:26:13,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:26:13" (1/1) ... [2025-01-09 20:26:13,709 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:26:13" (1/1) ... [2025-01-09 20:26:14,684 INFO L175 MemorySlicer]: Split 1157 memory accesses to 38 slices as follows [3, 2, 4, 3, 1, 3, 4, 5, 5, 963, 6, 4, 3, 9, 5, 5, 8, 4, 4, 4, 8, 2, 3, 5, 3, 2, 1, 1, 4, 2, 4, 7, 6, 5, 4, 44, 7, 4]. 83 percent of accesses are in the largest equivalence class. The 123 initializations are split as follows [0, 0, 0, 0, 0, 0, 4, 0, 5, 8, 6, 0, 0, 0, 5, 0, 8, 0, 4, 0, 8, 0, 3, 5, 0, 0, 0, 1, 4, 2, 4, 4, 4, 0, 4, 44, 0, 0]. The 302 writes are split as follows [2, 0, 2, 1, 1, 2, 0, 4, 0, 258, 0, 2, 0, 9, 0, 4, 0, 0, 0, 3, 0, 1, 0, 0, 2, 1, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 6, 0]. [2025-01-09 20:26:14,684 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:26:13" (1/1) ... [2025-01-09 20:26:14,684 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:26:13" (1/1) ... [2025-01-09 20:26:14,803 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:26:13" (1/1) ... [2025-01-09 20:26:14,816 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:26:13" (1/1) ... [2025-01-09 20:26:14,843 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:26:13" (1/1) ... [2025-01-09 20:26:14,891 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:26:13" (1/1) ... [2025-01-09 20:26:14,912 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:26:13" (1/1) ... [2025-01-09 20:26:14,970 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 20:26:14,971 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 20:26:14,973 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 20:26:14,973 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 20:26:14,974 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:26:13" (1/1) ... [2025-01-09 20:26:14,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:26:14,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:26:15,004 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-01-09 20:26:15,013 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-01-09 20:26:15,035 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_io_instance_callback_2_25 [2025-01-09 20:26:15,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_io_instance_callback_2_25 [2025-01-09 20:26:15,037 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_supply [2025-01-09 20:26:15,037 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_supply [2025-01-09 20:26:15,037 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_sync_for_device [2025-01-09 20:26:15,037 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_sync_for_device [2025-01-09 20:26:15,037 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~u32~0~X~$Pointer$~TO~VOID [2025-01-09 20:26:15,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~u32~0~X~$Pointer$~TO~VOID [2025-01-09 20:26:15,037 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2025-01-09 20:26:15,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2025-01-09 20:26:15,037 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_register [2025-01-09 20:26:15,037 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_register [2025-01-09 20:26:15,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-01-09 20:26:15,037 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-01-09 20:26:15,037 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_unmap [2025-01-09 20:26:15,037 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_unmap [2025-01-09 20:26:15,037 INFO L130 BoogieDeclarations]: Found specification of procedure panic [2025-01-09 20:26:15,038 INFO L138 BoogieDeclarations]: Found implementation of procedure panic [2025-01-09 20:26:15,038 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-01-09 20:26:15,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-01-09 20:26:15,038 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_read [2025-01-09 20:26:15,038 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_read [2025-01-09 20:26:15,038 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-01-09 20:26:15,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-01-09 20:26:15,038 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_activate_vcin [2025-01-09 20:26:15,038 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_activate_vcin [2025-01-09 20:26:15,039 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_remove_one [2025-01-09 20:26:15,039 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_remove_one [2025-01-09 20:26:15,039 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_io_poll [2025-01-09 20:26:15,039 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_io_poll [2025-01-09 20:26:15,039 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-01-09 20:26:15,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-01-09 20:26:15,039 INFO L130 BoogieDeclarations]: Found specification of procedure valid_dma_direction [2025-01-09 20:26:15,039 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_dma_direction [2025-01-09 20:26:15,039 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2025-01-09 20:26:15,039 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2025-01-09 20:26:15,039 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2025-01-09 20:26:15,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2025-01-09 20:26:15,039 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2025-01-09 20:26:15,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2025-01-09 20:26:15,039 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2025-01-09 20:26:15,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2025-01-09 20:26:15,039 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_irq_check [2025-01-09 20:26:15,039 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_irq_check [2025-01-09 20:26:15,041 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_getstats [2025-01-09 20:26:15,041 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_getstats [2025-01-09 20:26:15,041 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-01-09 20:26:15,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-01-09 20:26:15,041 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2025-01-09 20:26:15,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2025-01-09 20:26:15,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 20:26:15,041 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_init [2025-01-09 20:26:15,041 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_init [2025-01-09 20:26:15,041 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_shutdown [2025-01-09 20:26:15,041 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_shutdown [2025-01-09 20:26:15,041 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_detect [2025-01-09 20:26:15,041 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_detect [2025-01-09 20:26:15,041 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2025-01-09 20:26:15,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#16 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#17 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#18 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#19 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#20 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#21 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#22 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#23 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#24 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#25 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#26 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#27 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#28 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#29 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#30 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#31 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#32 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#33 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#34 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#35 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#36 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#37 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2025-01-09 20:26:15,042 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-01-09 20:26:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-01-09 20:26:15,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-01-09 20:26:15,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-01-09 20:26:15,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-01-09 20:26:15,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-01-09 20:26:15,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-01-09 20:26:15,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-01-09 20:26:15,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-01-09 20:26:15,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#22 [2025-01-09 20:26:15,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#23 [2025-01-09 20:26:15,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#24 [2025-01-09 20:26:15,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#25 [2025-01-09 20:26:15,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#26 [2025-01-09 20:26:15,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#27 [2025-01-09 20:26:15,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#28 [2025-01-09 20:26:15,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#29 [2025-01-09 20:26:15,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#30 [2025-01-09 20:26:15,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#31 [2025-01-09 20:26:15,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#32 [2025-01-09 20:26:15,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#33 [2025-01-09 20:26:15,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#34 [2025-01-09 20:26:15,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#35 [2025-01-09 20:26:15,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#36 [2025-01-09 20:26:15,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#37 [2025-01-09 20:26:15,046 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2025-01-09 20:26:15,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2025-01-09 20:26:15,046 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2025-01-09 20:26:15,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2025-01-09 20:26:15,046 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~~u32~0 [2025-01-09 20:26:15,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~~u32~0 [2025-01-09 20:26:15,046 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_map [2025-01-09 20:26:15,046 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_map [2025-01-09 20:26:15,046 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-01-09 20:26:15,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-01-09 20:26:15,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 20:26:15,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 20:26:15,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 20:26:15,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 20:26:15,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 20:26:15,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 20:26:15,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 20:26:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 20:26:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 20:26:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 20:26:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 20:26:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 20:26:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 20:26:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-09 20:26:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-09 20:26:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-01-09 20:26:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-01-09 20:26:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-01-09 20:26:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-01-09 20:26:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-01-09 20:26:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-01-09 20:26:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-01-09 20:26:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-01-09 20:26:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2025-01-09 20:26:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#24 [2025-01-09 20:26:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#25 [2025-01-09 20:26:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#26 [2025-01-09 20:26:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#27 [2025-01-09 20:26:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#28 [2025-01-09 20:26:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#29 [2025-01-09 20:26:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#30 [2025-01-09 20:26:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#31 [2025-01-09 20:26:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#32 [2025-01-09 20:26:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#33 [2025-01-09 20:26:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#34 [2025-01-09 20:26:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#35 [2025-01-09 20:26:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#36 [2025-01-09 20:26:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#37 [2025-01-09 20:26:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2025-01-09 20:26:15,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2025-01-09 20:26:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure __phys_addr [2025-01-09 20:26:15,047 INFO L138 BoogieDeclarations]: Found implementation of procedure __phys_addr [2025-01-09 20:26:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2025-01-09 20:26:15,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2025-01-09 20:26:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2025-01-09 20:26:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2025-01-09 20:26:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2025-01-09 20:26:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2025-01-09 20:26:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2025-01-09 20:26:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2025-01-09 20:26:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2025-01-09 20:26:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2025-01-09 20:26:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2025-01-09 20:26:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#9 [2025-01-09 20:26:15,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#10 [2025-01-09 20:26:15,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#11 [2025-01-09 20:26:15,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#12 [2025-01-09 20:26:15,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#13 [2025-01-09 20:26:15,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#14 [2025-01-09 20:26:15,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#15 [2025-01-09 20:26:15,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#16 [2025-01-09 20:26:15,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#17 [2025-01-09 20:26:15,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#18 [2025-01-09 20:26:15,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#19 [2025-01-09 20:26:15,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#20 [2025-01-09 20:26:15,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#21 [2025-01-09 20:26:15,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#22 [2025-01-09 20:26:15,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#23 [2025-01-09 20:26:15,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#24 [2025-01-09 20:26:15,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#25 [2025-01-09 20:26:15,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#26 [2025-01-09 20:26:15,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#27 [2025-01-09 20:26:15,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#28 [2025-01-09 20:26:15,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#29 [2025-01-09 20:26:15,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#30 [2025-01-09 20:26:15,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#31 [2025-01-09 20:26:15,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#32 [2025-01-09 20:26:15,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#33 [2025-01-09 20:26:15,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#34 [2025-01-09 20:26:15,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#35 [2025-01-09 20:26:15,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#36 [2025-01-09 20:26:15,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#37 [2025-01-09 20:26:15,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2025-01-09 20:26:15,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2025-01-09 20:26:15,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2025-01-09 20:26:15,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2025-01-09 20:26:15,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2025-01-09 20:26:15,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2025-01-09 20:26:15,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2025-01-09 20:26:15,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2025-01-09 20:26:15,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2025-01-09 20:26:15,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#9 [2025-01-09 20:26:15,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#10 [2025-01-09 20:26:15,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#11 [2025-01-09 20:26:15,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#12 [2025-01-09 20:26:15,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#13 [2025-01-09 20:26:15,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#14 [2025-01-09 20:26:15,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#15 [2025-01-09 20:26:15,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#16 [2025-01-09 20:26:15,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#17 [2025-01-09 20:26:15,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#18 [2025-01-09 20:26:15,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#19 [2025-01-09 20:26:15,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#20 [2025-01-09 20:26:15,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#21 [2025-01-09 20:26:15,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#22 [2025-01-09 20:26:15,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#23 [2025-01-09 20:26:15,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#24 [2025-01-09 20:26:15,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#25 [2025-01-09 20:26:15,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#26 [2025-01-09 20:26:15,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#27 [2025-01-09 20:26:15,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#28 [2025-01-09 20:26:15,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#29 [2025-01-09 20:26:15,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#30 [2025-01-09 20:26:15,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#31 [2025-01-09 20:26:15,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#32 [2025-01-09 20:26:15,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#33 [2025-01-09 20:26:15,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#34 [2025-01-09 20:26:15,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#35 [2025-01-09 20:26:15,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#36 [2025-01-09 20:26:15,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#37 [2025-01-09 20:26:15,049 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_proc_read [2025-01-09 20:26:15,050 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_proc_read [2025-01-09 20:26:15,050 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2025-01-09 20:26:15,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2025-01-09 20:26:15,053 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2025-01-09 20:26:15,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2025-01-09 20:26:15,053 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2025-01-09 20:26:15,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2025-01-09 20:26:15,053 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_open [2025-01-09 20:26:15,053 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_open [2025-01-09 20:26:15,053 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2025-01-09 20:26:15,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2025-01-09 20:26:15,053 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2025-01-09 20:26:15,053 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_device [2025-01-09 20:26:15,053 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-01-09 20:26:15,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-01-09 20:26:15,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 20:26:15,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 20:26:15,053 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_write [2025-01-09 20:26:15,053 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_write [2025-01-09 20:26:15,053 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-01-09 20:26:15,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-01-09 20:26:15,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 20:26:15,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 20:26:15,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 20:26:15,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 20:26:15,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 20:26:15,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 20:26:15,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 20:26:15,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-09 20:26:15,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-09 20:26:15,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-09 20:26:15,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-09 20:26:15,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-01-09 20:26:15,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-01-09 20:26:15,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-01-09 20:26:15,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-01-09 20:26:15,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-01-09 20:26:15,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-01-09 20:26:15,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-01-09 20:26:15,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-01-09 20:26:15,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-01-09 20:26:15,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-01-09 20:26:15,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-01-09 20:26:15,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#22 [2025-01-09 20:26:15,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#23 [2025-01-09 20:26:15,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#24 [2025-01-09 20:26:15,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#25 [2025-01-09 20:26:15,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#26 [2025-01-09 20:26:15,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#27 [2025-01-09 20:26:15,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#28 [2025-01-09 20:26:15,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#29 [2025-01-09 20:26:15,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#30 [2025-01-09 20:26:15,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#31 [2025-01-09 20:26:15,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#32 [2025-01-09 20:26:15,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#33 [2025-01-09 20:26:15,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#34 [2025-01-09 20:26:15,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#35 [2025-01-09 20:26:15,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#36 [2025-01-09 20:26:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#37 [2025-01-09 20:26:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-01-09 20:26:15,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-01-09 20:26:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2025-01-09 20:26:15,055 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2025-01-09 20:26:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~u32~0~X~int~X~int~TO~VOID [2025-01-09 20:26:15,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~u32~0~X~int~X~int~TO~VOID [2025-01-09 20:26:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2025-01-09 20:26:15,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2025-01-09 20:26:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_schedule [2025-01-09 20:26:15,055 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_schedule [2025-01-09 20:26:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atm_dev_register [2025-01-09 20:26:15,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atm_dev_register [2025-01-09 20:26:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_get_esi [2025-01-09 20:26:15,055 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_get_esi [2025-01-09 20:26:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_monitor_getc [2025-01-09 20:26:15,055 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_monitor_getc [2025-01-09 20:26:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~dma_addr_t~0~X~int~X~int~TO~VOID [2025-01-09 20:26:15,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~dma_addr_t~0~X~int~X~int~TO~VOID [2025-01-09 20:26:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_chunk_free [2025-01-09 20:26:15,055 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_chunk_free [2025-01-09 20:26:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~~u32~0 [2025-01-09 20:26:15,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~~u32~0 [2025-01-09 20:26:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2025-01-09 20:26:15,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2025-01-09 20:26:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure writel [2025-01-09 20:26:15,055 INFO L138 BoogieDeclarations]: Found implementation of procedure writel [2025-01-09 20:26:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2025-01-09 20:26:15,055 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2025-01-09 20:26:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_close [2025-01-09 20:26:15,055 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_close [2025-01-09 20:26:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_reset [2025-01-09 20:26:15,055 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_reset [2025-01-09 20:26:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 20:26:15,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 20:26:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_rate_ctrl [2025-01-09 20:26:15,055 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_rate_ctrl [2025-01-09 20:26:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2025-01-09 20:26:15,055 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2025-01-09 20:26:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~X~int~TO~int [2025-01-09 20:26:15,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~X~int~TO~int [2025-01-09 20:26:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-01-09 20:26:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-01-09 20:26:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-01-09 20:26:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-01-09 20:26:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-01-09 20:26:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-01-09 20:26:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-01-09 20:26:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-01-09 20:26:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-01-09 20:26:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-01-09 20:26:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-01-09 20:26:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-01-09 20:26:15,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-01-09 20:26:15,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-01-09 20:26:15,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-01-09 20:26:15,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-01-09 20:26:15,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#16 [2025-01-09 20:26:15,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#17 [2025-01-09 20:26:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#18 [2025-01-09 20:26:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#19 [2025-01-09 20:26:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#20 [2025-01-09 20:26:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#21 [2025-01-09 20:26:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#22 [2025-01-09 20:26:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#23 [2025-01-09 20:26:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#24 [2025-01-09 20:26:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#25 [2025-01-09 20:26:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#26 [2025-01-09 20:26:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#27 [2025-01-09 20:26:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#28 [2025-01-09 20:26:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#29 [2025-01-09 20:26:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#30 [2025-01-09 20:26:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#31 [2025-01-09 20:26:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#32 [2025-01-09 20:26:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#33 [2025-01-09 20:26:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#34 [2025-01-09 20:26:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#35 [2025-01-09 20:26:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#36 [2025-01-09 20:26:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#37 [2025-01-09 20:26:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-01-09 20:26:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-01-09 20:26:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-01-09 20:26:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-01-09 20:26:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-01-09 20:26:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-01-09 20:26:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-01-09 20:26:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-01-09 20:26:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-01-09 20:26:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-01-09 20:26:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-01-09 20:26:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-01-09 20:26:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-01-09 20:26:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-01-09 20:26:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-01-09 20:26:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-01-09 20:26:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-01-09 20:26:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-01-09 20:26:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-01-09 20:26:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-01-09 20:26:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2025-01-09 20:26:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#21 [2025-01-09 20:26:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#22 [2025-01-09 20:26:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#23 [2025-01-09 20:26:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#24 [2025-01-09 20:26:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#25 [2025-01-09 20:26:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#26 [2025-01-09 20:26:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#27 [2025-01-09 20:26:15,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#28 [2025-01-09 20:26:15,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#29 [2025-01-09 20:26:15,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#30 [2025-01-09 20:26:15,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#31 [2025-01-09 20:26:15,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#32 [2025-01-09 20:26:15,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#33 [2025-01-09 20:26:15,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#34 [2025-01-09 20:26:15,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#35 [2025-01-09 20:26:15,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#36 [2025-01-09 20:26:15,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#37 [2025-01-09 20:26:15,062 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-01-09 20:26:15,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-01-09 20:26:15,062 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-01-09 20:26:15,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-01-09 20:26:15,062 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_irq_itoa [2025-01-09 20:26:15,062 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_irq_itoa [2025-01-09 20:26:15,062 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_init [2025-01-09 20:26:15,062 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_init [2025-01-09 20:26:15,062 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_struct_atmdev_ops_io_instance_2 [2025-01-09 20:26:15,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_struct_atmdev_ops_io_instance_2 [2025-01-09 20:26:15,062 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_irq_ack [2025-01-09 20:26:15,062 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_irq_ack [2025-01-09 20:26:15,062 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_130 [2025-01-09 20:26:15,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_130 [2025-01-09 20:26:15,063 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2025-01-09 20:26:15,063 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2025-01-09 20:26:15,063 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2025-01-09 20:26:15,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2025-01-09 20:26:15,063 INFO L130 BoogieDeclarations]: Found specification of procedure sk_atm [2025-01-09 20:26:15,063 INFO L138 BoogieDeclarations]: Found implementation of procedure sk_atm [2025-01-09 20:26:15,063 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2025-01-09 20:26:15,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2025-01-09 20:26:15,063 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_prom_read [2025-01-09 20:26:15,063 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_prom_read [2025-01-09 20:26:15,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 20:26:15,063 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2025-01-09 20:26:15,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2025-01-09 20:26:15,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 20:26:15,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 20:26:15,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 20:26:15,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 20:26:15,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 20:26:15,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 20:26:15,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 20:26:15,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-09 20:26:15,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-09 20:26:15,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-09 20:26:15,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-09 20:26:15,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-01-09 20:26:15,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-01-09 20:26:15,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-01-09 20:26:15,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-01-09 20:26:15,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-01-09 20:26:15,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-01-09 20:26:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-01-09 20:26:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-01-09 20:26:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-01-09 20:26:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-01-09 20:26:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-01-09 20:26:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#22 [2025-01-09 20:26:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#23 [2025-01-09 20:26:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#24 [2025-01-09 20:26:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#25 [2025-01-09 20:26:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#26 [2025-01-09 20:26:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#27 [2025-01-09 20:26:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#28 [2025-01-09 20:26:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#29 [2025-01-09 20:26:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#30 [2025-01-09 20:26:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#31 [2025-01-09 20:26:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#32 [2025-01-09 20:26:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#33 [2025-01-09 20:26:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#34 [2025-01-09 20:26:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#35 [2025-01-09 20:26:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#36 [2025-01-09 20:26:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#37 [2025-01-09 20:26:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_sync_for_cpu [2025-01-09 20:26:15,065 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_sync_for_cpu [2025-01-09 20:26:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_reset [2025-01-09 20:26:15,065 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_reset [2025-01-09 20:26:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 20:26:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 20:26:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 20:26:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-09 20:26:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-01-09 20:26:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-01-09 20:26:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-01-09 20:26:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-01-09 20:26:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-01-09 20:26:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-01-09 20:26:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-01-09 20:26:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-01-09 20:26:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-01-09 20:26:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-01-09 20:26:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-01-09 20:26:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-01-09 20:26:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-01-09 20:26:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-01-09 20:26:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-01-09 20:26:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-01-09 20:26:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-01-09 20:26:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2025-01-09 20:26:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#22 [2025-01-09 20:26:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#23 [2025-01-09 20:26:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#24 [2025-01-09 20:26:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#25 [2025-01-09 20:26:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#26 [2025-01-09 20:26:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#27 [2025-01-09 20:26:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#28 [2025-01-09 20:26:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#29 [2025-01-09 20:26:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#30 [2025-01-09 20:26:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#31 [2025-01-09 20:26:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#32 [2025-01-09 20:26:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#33 [2025-01-09 20:26:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#34 [2025-01-09 20:26:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#35 [2025-01-09 20:26:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#36 [2025-01-09 20:26:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#37 [2025-01-09 20:26:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2025-01-09 20:26:15,065 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2025-01-09 20:26:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-01-09 20:26:15,065 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-01-09 20:26:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2025-01-09 20:26:15,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2025-01-09 20:26:15,066 INFO L130 BoogieDeclarations]: Found specification of procedure pci_write_config_byte [2025-01-09 20:26:15,066 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_write_config_byte [2025-01-09 20:26:15,066 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-01-09 20:26:15,066 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-01-09 20:26:15,066 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_chunk_free [2025-01-09 20:26:15,066 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_chunk_free [2025-01-09 20:26:15,066 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2025-01-09 20:26:15,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2025-01-09 20:26:15,066 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2025-01-09 20:26:15,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2025-01-09 20:26:15,066 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_rate_mtx_of_fore200e [2025-01-09 20:26:15,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_rate_mtx_of_fore200e [2025-01-09 20:26:15,066 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-01-09 20:26:15,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-01-09 20:26:15,066 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_map [2025-01-09 20:26:15,066 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_map [2025-01-09 20:26:15,066 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_atm2fore_aal [2025-01-09 20:26:15,066 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_atm2fore_aal [2025-01-09 20:26:15,066 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_q_lock_of_fore200e [2025-01-09 20:26:15,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_q_lock_of_fore200e [2025-01-09 20:26:15,066 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-01-09 20:26:15,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-01-09 20:26:15,066 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-01-09 20:26:15,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-01-09 20:26:15,067 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2025-01-09 20:26:15,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2025-01-09 20:26:15,067 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2025-01-09 20:26:15,067 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2025-01-09 20:26:15,067 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2025-01-09 20:26:15,067 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2025-01-09 20:26:15,067 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atm_dev_register_150 [2025-01-09 20:26:15,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atm_dev_register_150 [2025-01-09 20:26:15,067 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-01-09 20:26:15,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-01-09 20:26:15,067 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-01-09 20:26:15,067 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-01-09 20:26:15,067 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-01-09 20:26:15,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-01-09 20:26:15,067 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dispatch_register_8_1 [2025-01-09 20:26:15,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dispatch_register_8_1 [2025-01-09 20:26:15,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 20:26:15,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 20:26:15,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 20:26:15,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 20:26:15,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 20:26:15,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 20:26:15,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 20:26:15,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 20:26:15,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 20:26:15,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 20:26:15,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 20:26:15,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 20:26:15,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 20:26:15,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-09 20:26:15,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-09 20:26:15,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-01-09 20:26:15,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-01-09 20:26:15,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-01-09 20:26:15,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-01-09 20:26:15,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-01-09 20:26:15,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-01-09 20:26:15,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-01-09 20:26:15,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-01-09 20:26:15,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2025-01-09 20:26:15,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#24 [2025-01-09 20:26:15,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#25 [2025-01-09 20:26:15,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#26 [2025-01-09 20:26:15,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#27 [2025-01-09 20:26:15,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#28 [2025-01-09 20:26:15,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#29 [2025-01-09 20:26:15,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#30 [2025-01-09 20:26:15,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#31 [2025-01-09 20:26:15,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#32 [2025-01-09 20:26:15,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#33 [2025-01-09 20:26:15,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#34 [2025-01-09 20:26:15,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#35 [2025-01-09 20:26:15,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#36 [2025-01-09 20:26:15,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#37 [2025-01-09 20:26:15,068 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2025-01-09 20:26:15,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2025-01-09 20:26:15,068 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_configure [2025-01-09 20:26:15,068 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_configure [2025-01-09 20:26:15,068 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-01-09 20:26:15,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-01-09 20:26:15,068 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2025-01-09 20:26:15,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2025-01-09 20:26:15,068 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_any [2025-01-09 20:26:15,068 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_any [2025-01-09 20:26:15,068 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_inc [2025-01-09 20:26:15,068 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_inc [2025-01-09 20:26:15,068 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_send [2025-01-09 20:26:15,068 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_send [2025-01-09 20:26:15,068 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_unmap [2025-01-09 20:26:15,068 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_unmap [2025-01-09 20:26:15,068 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_chunk_alloc [2025-01-09 20:26:15,068 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_chunk_alloc [2025-01-09 20:26:15,068 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2025-01-09 20:26:15,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2025-01-09 20:26:15,068 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-01-09 20:26:15,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-01-09 20:26:15,068 INFO L130 BoogieDeclarations]: Found specification of procedure msecs_to_jiffies [2025-01-09 20:26:15,068 INFO L138 BoogieDeclarations]: Found implementation of procedure msecs_to_jiffies [2025-01-09 20:26:15,068 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_proc_read [2025-01-09 20:26:15,068 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_proc_read [2025-01-09 20:26:15,068 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_poll [2025-01-09 20:26:15,069 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_poll [2025-01-09 20:26:15,069 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-01-09 20:26:15,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-01-09 20:26:15,069 INFO L130 BoogieDeclarations]: Found specification of procedure readl [2025-01-09 20:26:15,069 INFO L138 BoogieDeclarations]: Found implementation of procedure readl [2025-01-09 20:26:15,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 20:26:15,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 20:26:15,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 20:26:15,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 20:26:15,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 20:26:15,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 20:26:15,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 20:26:15,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 20:26:15,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 20:26:15,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 20:26:15,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 20:26:15,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 20:26:15,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 20:26:15,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 20:26:15,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 20:26:15,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 20:26:15,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 20:26:15,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-09 20:26:15,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-09 20:26:15,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-01-09 20:26:15,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-01-09 20:26:15,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-01-09 20:26:15,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-01-09 20:26:15,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2025-01-09 20:26:15,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#24 [2025-01-09 20:26:15,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#25 [2025-01-09 20:26:15,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#26 [2025-01-09 20:26:15,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#27 [2025-01-09 20:26:15,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#28 [2025-01-09 20:26:15,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#29 [2025-01-09 20:26:15,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#30 [2025-01-09 20:26:15,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#31 [2025-01-09 20:26:15,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#32 [2025-01-09 20:26:15,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#33 [2025-01-09 20:26:15,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#34 [2025-01-09 20:26:15,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#35 [2025-01-09 20:26:15,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#36 [2025-01-09 20:26:15,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#37 [2025-01-09 20:26:15,071 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~VOID [2025-01-09 20:26:15,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~VOID [2025-01-09 20:26:15,071 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_rate_mtx_of_fore200e [2025-01-09 20:26:15,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_rate_mtx_of_fore200e [2025-01-09 20:26:15,071 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_tx_irq [2025-01-09 20:26:15,071 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_tx_irq [2025-01-09 20:26:16,197 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 20:26:16,200 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 20:26:24,221 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-01-09 20:26:28,592 INFO L? ?]: Removed 3638 outVars from TransFormulas that were not future-live. [2025-01-09 20:26:28,593 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 20:26:28,633 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 20:26:28,637 INFO L312 CfgBuilder]: Removed 27 assume(true) statements. [2025-01-09 20:26:28,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:26:28 BoogieIcfgContainer [2025-01-09 20:26:28,637 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 20:26:28,639 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 20:26:28,640 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 20:26:28,643 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 20:26:28,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:26:07" (1/3) ... [2025-01-09 20:26:28,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@223a1666 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:26:28, skipping insertion in model container [2025-01-09 20:26:28,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:26:13" (2/3) ... [2025-01-09 20:26:28,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@223a1666 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:26:28, skipping insertion in model container [2025-01-09 20:26:28,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:26:28" (3/3) ... [2025-01-09 20:26:28,645 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i [2025-01-09 20:26:28,655 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 20:26:28,658 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i that has 163 procedures, 2326 locations, 1 initial locations, 101 loop locations, and 30 error locations. [2025-01-09 20:26:28,739 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 20:26:28,750 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;@7f5f9598, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 20:26:28,750 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-01-09 20:26:28,760 INFO L276 IsEmpty]: Start isEmpty. Operand has 2140 states, 1444 states have (on average 1.299168975069252) internal successors, (1876), 1519 states have internal predecessors, (1876), 541 states have call successors, (541), 125 states have call predecessors, (541), 124 states have return successors, (536), 527 states have call predecessors, (536), 536 states have call successors, (536) [2025-01-09 20:26:28,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 20:26:28,768 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:26:28,768 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-01-09 20:26:28,769 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-01-09 20:26:28,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:26:28,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1726945593, now seen corresponding path program 1 times [2025-01-09 20:26:28,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:26:28,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230437024] [2025-01-09 20:26:28,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:26:28,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:26:29,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 20:26:29,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 20:26:29,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:26:29,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:26:30,091 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 20:26:30,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:26:30,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230437024] [2025-01-09 20:26:30,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230437024] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:26:30,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:26:30,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:26:30,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772564965] [2025-01-09 20:26:30,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:26:30,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:26:30,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:26:30,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:26:30,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:26:30,119 INFO L87 Difference]: Start difference. First operand has 2140 states, 1444 states have (on average 1.299168975069252) internal successors, (1876), 1519 states have internal predecessors, (1876), 541 states have call successors, (541), 125 states have call predecessors, (541), 124 states have return successors, (536), 527 states have call predecessors, (536), 536 states have call successors, (536) Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 20:26:30,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:26:30,472 INFO L93 Difference]: Finished difference Result 6349 states and 9110 transitions. [2025-01-09 20:26:30,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:26:30,474 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-01-09 20:26:30,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:26:30,526 INFO L225 Difference]: With dead ends: 6349 [2025-01-09 20:26:30,527 INFO L226 Difference]: Without dead ends: 4213 [2025-01-09 20:26:30,546 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-01-09 20:26:30,548 INFO L435 NwaCegarLoop]: 3075 mSDtfsCounter, 2860 mSDsluCounter, 5944 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2860 SdHoareTripleChecker+Valid, 9019 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:26:30,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2860 Valid, 9019 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:26:30,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4213 states. [2025-01-09 20:26:30,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4213 to 4021. [2025-01-09 20:26:30,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4021 states, 2738 states have (on average 1.2669831994156318) internal successors, (3469), 2853 states have internal predecessors, (3469), 1025 states have call successors, (1025), 229 states have call predecessors, (1025), 228 states have return successors, (1056), 1003 states have call predecessors, (1056), 1023 states have call successors, (1056) [2025-01-09 20:26:30,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4021 states to 4021 states and 5550 transitions. [2025-01-09 20:26:30,823 INFO L78 Accepts]: Start accepts. Automaton has 4021 states and 5550 transitions. Word has length 69 [2025-01-09 20:26:30,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:26:30,823 INFO L471 AbstractCegarLoop]: Abstraction has 4021 states and 5550 transitions. [2025-01-09 20:26:30,824 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-01-09 20:26:30,824 INFO L276 IsEmpty]: Start isEmpty. Operand 4021 states and 5550 transitions. [2025-01-09 20:26:30,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 20:26:30,826 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:26:30,826 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-01-09 20:26:30,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 20:26:30,826 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-01-09 20:26:30,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:26:30,827 INFO L85 PathProgramCache]: Analyzing trace with hash 799328626, now seen corresponding path program 1 times [2025-01-09 20:26:30,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:26:30,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061233494] [2025-01-09 20:26:30,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:26:30,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:26:31,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 20:26:31,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 20:26:31,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:26:31,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:26:31,638 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 20:26:31,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:26:31,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061233494] [2025-01-09 20:26:31,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061233494] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:26:31,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:26:31,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:26:31,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454143072] [2025-01-09 20:26:31,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:26:31,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:26:31,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:26:31,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:26:31,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:26:31,642 INFO L87 Difference]: Start difference. First operand 4021 states and 5550 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 20:26:31,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:26:31,759 INFO L93 Difference]: Finished difference Result 4021 states and 5550 transitions. [2025-01-09 20:26:31,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:26:31,760 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-01-09 20:26:31,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:26:31,782 INFO L225 Difference]: With dead ends: 4021 [2025-01-09 20:26:31,782 INFO L226 Difference]: Without dead ends: 4019 [2025-01-09 20:26:31,785 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-01-09 20:26:31,786 INFO L435 NwaCegarLoop]: 2874 mSDtfsCounter, 2845 mSDsluCounter, 2873 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2845 SdHoareTripleChecker+Valid, 5747 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:26:31,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2845 Valid, 5747 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:26:31,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4019 states. [2025-01-09 20:26:31,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4019 to 4019. [2025-01-09 20:26:31,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4019 states, 2737 states have (on average 1.266715381804896) internal successors, (3467), 2851 states have internal predecessors, (3467), 1025 states have call successors, (1025), 229 states have call predecessors, (1025), 228 states have return successors, (1056), 1003 states have call predecessors, (1056), 1023 states have call successors, (1056) [2025-01-09 20:26:31,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4019 states to 4019 states and 5548 transitions. [2025-01-09 20:26:31,968 INFO L78 Accepts]: Start accepts. Automaton has 4019 states and 5548 transitions. Word has length 75 [2025-01-09 20:26:31,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:26:31,968 INFO L471 AbstractCegarLoop]: Abstraction has 4019 states and 5548 transitions. [2025-01-09 20:26:31,968 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-01-09 20:26:31,969 INFO L276 IsEmpty]: Start isEmpty. Operand 4019 states and 5548 transitions. [2025-01-09 20:26:31,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 20:26:31,970 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:26:31,970 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-01-09 20:26:31,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 20:26:31,970 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-01-09 20:26:31,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:26:31,972 INFO L85 PathProgramCache]: Analyzing trace with hash -956154249, now seen corresponding path program 1 times [2025-01-09 20:26:31,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:26:31,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270880641] [2025-01-09 20:26:31,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:26:31,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:26:32,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 20:26:32,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 20:26:32,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:26:32,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:26:32,834 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 20:26:32,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:26:32,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270880641] [2025-01-09 20:26:32,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270880641] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:26:32,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:26:32,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:26:32,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320992549] [2025-01-09 20:26:32,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:26:32,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:26:32,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:26:32,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:26:32,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:26:32,836 INFO L87 Difference]: Start difference. First operand 4019 states and 5548 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 20:26:32,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:26:32,978 INFO L93 Difference]: Finished difference Result 4019 states and 5548 transitions. [2025-01-09 20:26:32,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:26:32,978 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-01-09 20:26:32,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:26:33,000 INFO L225 Difference]: With dead ends: 4019 [2025-01-09 20:26:33,000 INFO L226 Difference]: Without dead ends: 4017 [2025-01-09 20:26:33,005 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-01-09 20:26:33,005 INFO L435 NwaCegarLoop]: 2872 mSDtfsCounter, 2842 mSDsluCounter, 2871 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2842 SdHoareTripleChecker+Valid, 5743 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:26:33,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2842 Valid, 5743 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:26:33,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4017 states. [2025-01-09 20:26:33,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4017 to 4017. [2025-01-09 20:26:33,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4017 states, 2736 states have (on average 1.2664473684210527) internal successors, (3465), 2849 states have internal predecessors, (3465), 1025 states have call successors, (1025), 229 states have call predecessors, (1025), 228 states have return successors, (1056), 1003 states have call predecessors, (1056), 1023 states have call successors, (1056) [2025-01-09 20:26:33,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4017 states to 4017 states and 5546 transitions. [2025-01-09 20:26:33,171 INFO L78 Accepts]: Start accepts. Automaton has 4017 states and 5546 transitions. Word has length 81 [2025-01-09 20:26:33,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:26:33,172 INFO L471 AbstractCegarLoop]: Abstraction has 4017 states and 5546 transitions. [2025-01-09 20:26:33,172 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-01-09 20:26:33,172 INFO L276 IsEmpty]: Start isEmpty. Operand 4017 states and 5546 transitions. [2025-01-09 20:26:33,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 20:26:33,173 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:26:33,173 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-01-09 20:26:33,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 20:26:33,174 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-01-09 20:26:33,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:26:33,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1861460376, now seen corresponding path program 1 times [2025-01-09 20:26:33,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:26:33,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315849264] [2025-01-09 20:26:33,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:26:33,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:26:33,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 20:26:33,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 20:26:33,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:26:33,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:26:33,801 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 20:26:33,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:26:33,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315849264] [2025-01-09 20:26:33,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315849264] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:26:33,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:26:33,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:26:33,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395693809] [2025-01-09 20:26:33,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:26:33,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:26:33,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:26:33,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:26:33,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:26:33,803 INFO L87 Difference]: Start difference. First operand 4017 states and 5546 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 20:26:33,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:26:33,933 INFO L93 Difference]: Finished difference Result 4017 states and 5546 transitions. [2025-01-09 20:26:33,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:26:33,934 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-01-09 20:26:33,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:26:33,981 INFO L225 Difference]: With dead ends: 4017 [2025-01-09 20:26:33,982 INFO L226 Difference]: Without dead ends: 4015 [2025-01-09 20:26:33,984 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-01-09 20:26:33,984 INFO L435 NwaCegarLoop]: 2870 mSDtfsCounter, 2839 mSDsluCounter, 2869 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2839 SdHoareTripleChecker+Valid, 5739 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:26:33,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2839 Valid, 5739 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:26:33,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4015 states. [2025-01-09 20:26:34,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4015 to 4015. [2025-01-09 20:26:34,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4015 states, 2735 states have (on average 1.26617915904936) internal successors, (3463), 2847 states have internal predecessors, (3463), 1025 states have call successors, (1025), 229 states have call predecessors, (1025), 228 states have return successors, (1056), 1003 states have call predecessors, (1056), 1023 states have call successors, (1056) [2025-01-09 20:26:34,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4015 states to 4015 states and 5544 transitions. [2025-01-09 20:26:34,159 INFO L78 Accepts]: Start accepts. Automaton has 4015 states and 5544 transitions. Word has length 87 [2025-01-09 20:26:34,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:26:34,160 INFO L471 AbstractCegarLoop]: Abstraction has 4015 states and 5544 transitions. [2025-01-09 20:26:34,160 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-01-09 20:26:34,160 INFO L276 IsEmpty]: Start isEmpty. Operand 4015 states and 5544 transitions. [2025-01-09 20:26:34,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 20:26:34,161 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:26:34,161 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-01-09 20:26:34,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 20:26:34,166 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-01-09 20:26:34,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:26:34,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1972299585, now seen corresponding path program 1 times [2025-01-09 20:26:34,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:26:34,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793122803] [2025-01-09 20:26:34,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:26:34,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:26:34,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 20:26:34,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 20:26:34,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:26:34,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:26:34,929 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 20:26:34,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:26:34,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793122803] [2025-01-09 20:26:34,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793122803] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:26:34,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:26:34,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:26:34,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351832404] [2025-01-09 20:26:34,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:26:34,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:26:34,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:26:34,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:26:34,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:26:34,931 INFO L87 Difference]: Start difference. First operand 4015 states and 5544 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 20:26:35,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:26:35,062 INFO L93 Difference]: Finished difference Result 4015 states and 5544 transitions. [2025-01-09 20:26:35,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:26:35,063 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-01-09 20:26:35,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:26:35,085 INFO L225 Difference]: With dead ends: 4015 [2025-01-09 20:26:35,086 INFO L226 Difference]: Without dead ends: 4013 [2025-01-09 20:26:35,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:26:35,090 INFO L435 NwaCegarLoop]: 2868 mSDtfsCounter, 2836 mSDsluCounter, 2867 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2836 SdHoareTripleChecker+Valid, 5735 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:26:35,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2836 Valid, 5735 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:26:35,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4013 states. [2025-01-09 20:26:35,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4013 to 4013. [2025-01-09 20:26:35,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4013 states, 2734 states have (on average 1.2659107534747622) internal successors, (3461), 2845 states have internal predecessors, (3461), 1025 states have call successors, (1025), 229 states have call predecessors, (1025), 228 states have return successors, (1056), 1003 states have call predecessors, (1056), 1023 states have call successors, (1056) [2025-01-09 20:26:35,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4013 states to 4013 states and 5542 transitions. [2025-01-09 20:26:35,276 INFO L78 Accepts]: Start accepts. Automaton has 4013 states and 5542 transitions. Word has length 93 [2025-01-09 20:26:35,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:26:35,276 INFO L471 AbstractCegarLoop]: Abstraction has 4013 states and 5542 transitions. [2025-01-09 20:26:35,277 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-01-09 20:26:35,277 INFO L276 IsEmpty]: Start isEmpty. Operand 4013 states and 5542 transitions. [2025-01-09 20:26:35,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 20:26:35,278 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:26:35,278 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-01-09 20:26:35,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 20:26:35,279 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-01-09 20:26:35,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:26:35,279 INFO L85 PathProgramCache]: Analyzing trace with hash 36752933, now seen corresponding path program 1 times [2025-01-09 20:26:35,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:26:35,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630872030] [2025-01-09 20:26:35,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:26:35,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:26:35,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 20:26:36,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 20:26:36,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:26:36,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:26:37,720 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-01-09 20:26:37,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:26:37,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630872030] [2025-01-09 20:26:37,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630872030] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:26:37,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850371041] [2025-01-09 20:26:37,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:26:37,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:26:37,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:26:37,723 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-01-09 20:26:37,725 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-01-09 20:26:39,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 20:26:39,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 20:26:39,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:26:39,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:26:39,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 2133 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-01-09 20:26:39,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:26:39,627 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 53 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 20:26:39,630 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:26:40,047 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-01-09 20:26:40,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850371041] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:26:40,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:26:40,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 26 [2025-01-09 20:26:40,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448080304] [2025-01-09 20:26:40,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:26:40,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 20:26:40,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:26:40,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 20:26:40,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=590, Unknown=0, NotChecked=0, Total=650 [2025-01-09 20:26:40,050 INFO L87 Difference]: Start difference. First operand 4013 states and 5542 transitions. Second operand has 26 states, 25 states have (on average 3.04) internal successors, (76), 22 states have internal predecessors, (76), 8 states have call successors, (26), 2 states have call predecessors, (26), 6 states have return successors, (28), 11 states have call predecessors, (28), 8 states have call successors, (28) [2025-01-09 20:26:41,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:26:41,641 INFO L93 Difference]: Finished difference Result 5014 states and 6761 transitions. [2025-01-09 20:26:41,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 20:26:41,641 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.04) internal successors, (76), 22 states have internal predecessors, (76), 8 states have call successors, (26), 2 states have call predecessors, (26), 6 states have return successors, (28), 11 states have call predecessors, (28), 8 states have call successors, (28) Word has length 104 [2025-01-09 20:26:41,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:26:41,665 INFO L225 Difference]: With dead ends: 5014 [2025-01-09 20:26:41,665 INFO L226 Difference]: Without dead ends: 4051 [2025-01-09 20:26:41,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=80, Invalid=790, Unknown=0, NotChecked=0, Total=870 [2025-01-09 20:26:41,672 INFO L435 NwaCegarLoop]: 2834 mSDtfsCounter, 7 mSDsluCounter, 56570 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 59404 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:26:41,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 59404 Invalid, 912 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [22 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 20:26:41,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4051 states. [2025-01-09 20:26:41,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4051 to 4027. [2025-01-09 20:26:41,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4027 states, 2744 states have (on average 1.2649416909620992) internal successors, (3471), 2855 states have internal predecessors, (3471), 1029 states have call successors, (1029), 229 states have call predecessors, (1029), 228 states have return successors, (1060), 1007 states have call predecessors, (1060), 1027 states have call successors, (1060) [2025-01-09 20:26:41,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4027 states to 4027 states and 5560 transitions. [2025-01-09 20:26:41,848 INFO L78 Accepts]: Start accepts. Automaton has 4027 states and 5560 transitions. Word has length 104 [2025-01-09 20:26:41,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:26:41,848 INFO L471 AbstractCegarLoop]: Abstraction has 4027 states and 5560 transitions. [2025-01-09 20:26:41,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.04) internal successors, (76), 22 states have internal predecessors, (76), 8 states have call successors, (26), 2 states have call predecessors, (26), 6 states have return successors, (28), 11 states have call predecessors, (28), 8 states have call successors, (28) [2025-01-09 20:26:41,849 INFO L276 IsEmpty]: Start isEmpty. Operand 4027 states and 5560 transitions. [2025-01-09 20:26:41,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 20:26:41,852 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:26:41,853 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-01-09 20:26:41,868 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-01-09 20:26:42,057 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-01-09 20:26:42,057 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-01-09 20:26:42,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:26:42,059 INFO L85 PathProgramCache]: Analyzing trace with hash 2145515111, now seen corresponding path program 1 times [2025-01-09 20:26:42,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:26:42,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213778772] [2025-01-09 20:26:42,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:26:42,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:26:42,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 20:26:42,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 20:26:42,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:26:42,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:26:42,806 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 20:26:42,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:26:42,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213778772] [2025-01-09 20:26:42,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213778772] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:26:42,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:26:42,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:26:42,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956085499] [2025-01-09 20:26:42,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:26:42,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:26:42,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:26:42,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:26:42,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:26:42,808 INFO L87 Difference]: Start difference. First operand 4027 states and 5560 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 20:26:42,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:26:42,959 INFO L93 Difference]: Finished difference Result 4027 states and 5560 transitions. [2025-01-09 20:26:42,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:26:42,959 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-01-09 20:26:42,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:26:42,993 INFO L225 Difference]: With dead ends: 4027 [2025-01-09 20:26:42,995 INFO L226 Difference]: Without dead ends: 4025 [2025-01-09 20:26:43,002 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-01-09 20:26:43,003 INFO L435 NwaCegarLoop]: 2866 mSDtfsCounter, 2833 mSDsluCounter, 2865 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2833 SdHoareTripleChecker+Valid, 5731 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:26:43,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2833 Valid, 5731 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:26:43,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4025 states. [2025-01-09 20:26:43,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4025 to 4025. [2025-01-09 20:26:43,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4025 states, 2743 states have (on average 1.2646737149106817) internal successors, (3469), 2853 states have internal predecessors, (3469), 1029 states have call successors, (1029), 229 states have call predecessors, (1029), 228 states have return successors, (1060), 1007 states have call predecessors, (1060), 1027 states have call successors, (1060) [2025-01-09 20:26:43,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4025 states to 4025 states and 5558 transitions. [2025-01-09 20:26:43,307 INFO L78 Accepts]: Start accepts. Automaton has 4025 states and 5558 transitions. Word has length 99 [2025-01-09 20:26:43,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:26:43,307 INFO L471 AbstractCegarLoop]: Abstraction has 4025 states and 5558 transitions. [2025-01-09 20:26:43,307 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-01-09 20:26:43,307 INFO L276 IsEmpty]: Start isEmpty. Operand 4025 states and 5558 transitions. [2025-01-09 20:26:43,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 20:26:43,310 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:26:43,310 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-01-09 20:26:43,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 20:26:43,311 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:26:43,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:26:43,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1644432402, now seen corresponding path program 1 times [2025-01-09 20:26:43,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:26:43,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159339740] [2025-01-09 20:26:43,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:26:43,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:26:43,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 20:26:43,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 20:26:43,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:26:43,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:26:44,054 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-01-09 20:26:44,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:26:44,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159339740] [2025-01-09 20:26:44,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159339740] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:26:44,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:26:44,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:26:44,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772826265] [2025-01-09 20:26:44,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:26:44,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:26:44,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:26:44,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:26:44,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:26:44,056 INFO L87 Difference]: Start difference. First operand 4025 states and 5558 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 20:26:44,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:26:44,247 INFO L93 Difference]: Finished difference Result 8007 states and 11057 transitions. [2025-01-09 20:26:44,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:26:44,248 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-01-09 20:26:44,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:26:44,277 INFO L225 Difference]: With dead ends: 8007 [2025-01-09 20:26:44,277 INFO L226 Difference]: Without dead ends: 4019 [2025-01-09 20:26:44,293 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-01-09 20:26:44,294 INFO L435 NwaCegarLoop]: 2862 mSDtfsCounter, 2852 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2852 SdHoareTripleChecker+Valid, 2862 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:26:44,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2852 Valid, 2862 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:26:44,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4019 states. [2025-01-09 20:26:44,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4019 to 4019. [2025-01-09 20:26:44,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4019 states, 2738 states have (on average 1.2636961285609933) internal successors, (3460), 2847 states have internal predecessors, (3460), 1029 states have call successors, (1029), 229 states have call predecessors, (1029), 228 states have return successors, (1060), 1007 states have call predecessors, (1060), 1027 states have call successors, (1060) [2025-01-09 20:26:44,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4019 states to 4019 states and 5549 transitions. [2025-01-09 20:26:44,541 INFO L78 Accepts]: Start accepts. Automaton has 4019 states and 5549 transitions. Word has length 120 [2025-01-09 20:26:44,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:26:44,542 INFO L471 AbstractCegarLoop]: Abstraction has 4019 states and 5549 transitions. [2025-01-09 20:26:44,542 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-01-09 20:26:44,542 INFO L276 IsEmpty]: Start isEmpty. Operand 4019 states and 5549 transitions. [2025-01-09 20:26:44,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 20:26:44,544 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:26:44,545 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-01-09 20:26:44,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 20:26:44,545 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-01-09 20:26:44,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:26:44,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1142296429, now seen corresponding path program 1 times [2025-01-09 20:26:44,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:26:44,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436052907] [2025-01-09 20:26:44,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:26:44,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:26:44,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 20:26:44,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 20:26:44,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:26:44,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:26:45,171 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 20:26:45,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:26:45,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436052907] [2025-01-09 20:26:45,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436052907] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:26:45,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:26:45,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:26:45,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366423895] [2025-01-09 20:26:45,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:26:45,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:26:45,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:26:45,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:26:45,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:26:45,173 INFO L87 Difference]: Start difference. First operand 4019 states and 5549 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 20:26:45,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:26:45,336 INFO L93 Difference]: Finished difference Result 4019 states and 5549 transitions. [2025-01-09 20:26:45,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:26:45,337 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-01-09 20:26:45,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:26:45,369 INFO L225 Difference]: With dead ends: 4019 [2025-01-09 20:26:45,369 INFO L226 Difference]: Without dead ends: 4017 [2025-01-09 20:26:45,373 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-01-09 20:26:45,374 INFO L435 NwaCegarLoop]: 2859 mSDtfsCounter, 2825 mSDsluCounter, 2858 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2825 SdHoareTripleChecker+Valid, 5717 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:26:45,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2825 Valid, 5717 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:26:45,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4017 states. [2025-01-09 20:26:45,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4017 to 4017. [2025-01-09 20:26:45,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4017 states, 2737 states have (on average 1.2634271099744245) internal successors, (3458), 2845 states have internal predecessors, (3458), 1029 states have call successors, (1029), 229 states have call predecessors, (1029), 228 states have return successors, (1060), 1007 states have call predecessors, (1060), 1027 states have call successors, (1060) [2025-01-09 20:26:45,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4017 states to 4017 states and 5547 transitions. [2025-01-09 20:26:45,599 INFO L78 Accepts]: Start accepts. Automaton has 4017 states and 5547 transitions. Word has length 105 [2025-01-09 20:26:45,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:26:45,600 INFO L471 AbstractCegarLoop]: Abstraction has 4017 states and 5547 transitions. [2025-01-09 20:26:45,600 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-01-09 20:26:45,600 INFO L276 IsEmpty]: Start isEmpty. Operand 4017 states and 5547 transitions. [2025-01-09 20:26:45,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 20:26:45,604 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:26:45,605 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-01-09 20:26:45,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 20:26:45,605 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:26:45,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:26:45,606 INFO L85 PathProgramCache]: Analyzing trace with hash 585225181, now seen corresponding path program 1 times [2025-01-09 20:26:45,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:26:45,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335011485] [2025-01-09 20:26:45,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:26:45,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:26:45,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 20:26:45,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 20:26:45,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:26:45,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:26:46,201 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-01-09 20:26:46,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:26:46,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335011485] [2025-01-09 20:26:46,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335011485] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:26:46,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285021435] [2025-01-09 20:26:46,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:26:46,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:26:46,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:26:46,204 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-01-09 20:26:46,206 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-01-09 20:26:47,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 20:26:47,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 20:26:47,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:26:47,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:26:47,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 2391 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 20:26:47,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:26:47,849 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-01-09 20:26:47,849 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:26:47,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285021435] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:26:47,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:26:47,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 20:26:47,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694923933] [2025-01-09 20:26:47,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:26:47,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:26:47,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:26:47,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:26:47,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:26:47,850 INFO L87 Difference]: Start difference. First operand 4017 states and 5547 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 20:26:48,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:26:48,034 INFO L93 Difference]: Finished difference Result 7991 states and 11035 transitions. [2025-01-09 20:26:48,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:26:48,035 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-01-09 20:26:48,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:26:48,064 INFO L225 Difference]: With dead ends: 7991 [2025-01-09 20:26:48,064 INFO L226 Difference]: Without dead ends: 4011 [2025-01-09 20:26:48,080 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-01-09 20:26:48,080 INFO L435 NwaCegarLoop]: 2855 mSDtfsCounter, 2834 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2834 SdHoareTripleChecker+Valid, 2855 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:26:48,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2834 Valid, 2855 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:26:48,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4011 states. [2025-01-09 20:26:48,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4011 to 4011. [2025-01-09 20:26:48,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4011 states, 2732 states have (on average 1.2624450951683748) internal successors, (3449), 2839 states have internal predecessors, (3449), 1029 states have call successors, (1029), 229 states have call predecessors, (1029), 228 states have return successors, (1060), 1007 states have call predecessors, (1060), 1027 states have call successors, (1060) [2025-01-09 20:26:48,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4011 states to 4011 states and 5538 transitions. [2025-01-09 20:26:48,281 INFO L78 Accepts]: Start accepts. Automaton has 4011 states and 5538 transitions. Word has length 126 [2025-01-09 20:26:48,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:26:48,281 INFO L471 AbstractCegarLoop]: Abstraction has 4011 states and 5538 transitions. [2025-01-09 20:26:48,282 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-01-09 20:26:48,283 INFO L276 IsEmpty]: Start isEmpty. Operand 4011 states and 5538 transitions. [2025-01-09 20:26:48,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 20:26:48,285 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:26:48,285 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:26:48,301 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-01-09 20:26:48,485 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-01-09 20:26:48,486 INFO L396 AbstractCegarLoop]: === Iteration 11 === 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-01-09 20:26:48,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:26:48,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1696124167, now seen corresponding path program 1 times [2025-01-09 20:26:48,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:26:48,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878048569] [2025-01-09 20:26:48,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:26:48,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:26:48,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 20:26:49,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 20:26:49,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:26:49,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:26:50,275 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-01-09 20:26:50,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:26:50,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878048569] [2025-01-09 20:26:50,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878048569] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:26:50,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:26:50,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 20:26:50,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988908838] [2025-01-09 20:26:50,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:26:50,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 20:26:50,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:26:50,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 20:26:50,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:26:50,276 INFO L87 Difference]: Start difference. First operand 4011 states and 5538 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 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-01-09 20:26:54,300 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-01-09 20:26:57,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:26:57,859 INFO L93 Difference]: Finished difference Result 9265 states and 12736 transitions. [2025-01-09 20:26:57,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:26:57,859 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 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 130 [2025-01-09 20:26:57,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:26:57,880 INFO L225 Difference]: With dead ends: 9265 [2025-01-09 20:26:57,880 INFO L226 Difference]: Without dead ends: 5291 [2025-01-09 20:26:57,893 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-01-09 20:26:57,894 INFO L435 NwaCegarLoop]: 2853 mSDtfsCounter, 2790 mSDsluCounter, 8327 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2791 SdHoareTripleChecker+Valid, 11180 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:26:57,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2791 Valid, 11180 Invalid, 1086 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 1084 Invalid, 1 Unknown, 0 Unchecked, 7.1s Time] [2025-01-09 20:26:57,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5291 states. [2025-01-09 20:26:58,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5291 to 5277. [2025-01-09 20:26:58,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5277 states, 3590 states have (on average 1.2551532033426185) internal successors, (4506), 3727 states have internal predecessors, (4506), 1311 states have call successors, (1311), 355 states have call predecessors, (1311), 354 states have return successors, (1349), 1277 states have call predecessors, (1349), 1309 states have call successors, (1349) [2025-01-09 20:26:58,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5277 states to 5277 states and 7166 transitions. [2025-01-09 20:26:58,139 INFO L78 Accepts]: Start accepts. Automaton has 5277 states and 7166 transitions. Word has length 130 [2025-01-09 20:26:58,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:26:58,142 INFO L471 AbstractCegarLoop]: Abstraction has 5277 states and 7166 transitions. [2025-01-09 20:26:58,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 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-01-09 20:26:58,142 INFO L276 IsEmpty]: Start isEmpty. Operand 5277 states and 7166 transitions. [2025-01-09 20:26:58,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 20:26:58,143 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:26:58,144 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-01-09 20:26:58,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 20:26:58,144 INFO L396 AbstractCegarLoop]: === Iteration 12 === 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-01-09 20:26:58,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:26:58,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1696183749, now seen corresponding path program 1 times [2025-01-09 20:26:58,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:26:58,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411214745] [2025-01-09 20:26:58,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:26:58,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:26:58,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 20:26:58,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 20:26:58,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:26:58,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:26:58,800 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-01-09 20:26:58,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:26:58,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411214745] [2025-01-09 20:26:58,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411214745] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:26:58,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:26:58,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:26:58,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053161978] [2025-01-09 20:26:58,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:26:58,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:26:58,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:26:58,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:26:58,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:26:58,802 INFO L87 Difference]: Start difference. First operand 5277 states and 7166 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-01-09 20:26:59,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:26:59,039 INFO L93 Difference]: Finished difference Result 5283 states and 7173 transitions. [2025-01-09 20:26:59,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:26:59,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 130 [2025-01-09 20:26:59,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:26:59,059 INFO L225 Difference]: With dead ends: 5283 [2025-01-09 20:26:59,059 INFO L226 Difference]: Without dead ends: 5281 [2025-01-09 20:26:59,061 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-01-09 20:26:59,063 INFO L435 NwaCegarLoop]: 2854 mSDtfsCounter, 0 mSDsluCounter, 5702 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8556 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:26:59,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8556 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:26:59,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5281 states. [2025-01-09 20:26:59,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5281 to 5281. [2025-01-09 20:26:59,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5281 states, 3594 states have (on average 1.2543127434613244) internal successors, (4508), 3731 states have internal predecessors, (4508), 1311 states have call successors, (1311), 355 states have call predecessors, (1311), 354 states have return successors, (1349), 1277 states have call predecessors, (1349), 1309 states have call successors, (1349) [2025-01-09 20:26:59,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5281 states to 5281 states and 7168 transitions. [2025-01-09 20:26:59,300 INFO L78 Accepts]: Start accepts. Automaton has 5281 states and 7168 transitions. Word has length 130 [2025-01-09 20:26:59,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:26:59,301 INFO L471 AbstractCegarLoop]: Abstraction has 5281 states and 7168 transitions. [2025-01-09 20:26:59,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-01-09 20:26:59,301 INFO L276 IsEmpty]: Start isEmpty. Operand 5281 states and 7168 transitions. [2025-01-09 20:26:59,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 20:26:59,302 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:26:59,302 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-01-09 20:26:59,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 20:26:59,303 INFO L396 AbstractCegarLoop]: === Iteration 13 === 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-01-09 20:26:59,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:26:59,303 INFO L85 PathProgramCache]: Analyzing trace with hash -121737778, now seen corresponding path program 1 times [2025-01-09 20:26:59,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:26:59,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864291495] [2025-01-09 20:26:59,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:26:59,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:26:59,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 20:26:59,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 20:26:59,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:26:59,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:26:59,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-01-09 20:26:59,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:26:59,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864291495] [2025-01-09 20:26:59,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864291495] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:26:59,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:26:59,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:26:59,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376119944] [2025-01-09 20:26:59,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:26:59,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:26:59,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:26:59,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:26:59,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:26:59,870 INFO L87 Difference]: Start difference. First operand 5281 states and 7168 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-01-09 20:27:00,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:27:00,115 INFO L93 Difference]: Finished difference Result 5281 states and 7168 transitions. [2025-01-09 20:27:00,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:27:00,115 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-01-09 20:27:00,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:27:00,133 INFO L225 Difference]: With dead ends: 5281 [2025-01-09 20:27:00,134 INFO L226 Difference]: Without dead ends: 5279 [2025-01-09 20:27:00,136 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-01-09 20:27:00,137 INFO L435 NwaCegarLoop]: 2852 mSDtfsCounter, 2817 mSDsluCounter, 2851 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2817 SdHoareTripleChecker+Valid, 5703 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:27:00,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2817 Valid, 5703 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:27:00,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5279 states. [2025-01-09 20:27:00,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5279 to 5279. [2025-01-09 20:27:00,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5279 states, 3593 states have (on average 1.2541052045644308) internal successors, (4506), 3729 states have internal predecessors, (4506), 1311 states have call successors, (1311), 355 states have call predecessors, (1311), 354 states have return successors, (1349), 1277 states have call predecessors, (1349), 1309 states have call successors, (1349) [2025-01-09 20:27:00,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5279 states to 5279 states and 7166 transitions. [2025-01-09 20:27:00,387 INFO L78 Accepts]: Start accepts. Automaton has 5279 states and 7166 transitions. Word has length 111 [2025-01-09 20:27:00,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:27:00,387 INFO L471 AbstractCegarLoop]: Abstraction has 5279 states and 7166 transitions. [2025-01-09 20:27:00,387 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-01-09 20:27:00,387 INFO L276 IsEmpty]: Start isEmpty. Operand 5279 states and 7166 transitions. [2025-01-09 20:27:00,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 20:27:00,390 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:27:00,390 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] [2025-01-09 20:27:00,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 20:27:00,391 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-01-09 20:27:00,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:27:00,391 INFO L85 PathProgramCache]: Analyzing trace with hash 998434699, now seen corresponding path program 1 times [2025-01-09 20:27:00,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:27:00,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291328539] [2025-01-09 20:27:00,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:27:00,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:27:00,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 20:27:00,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 20:27:00,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:27:00,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:27:00,919 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-01-09 20:27:00,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:27:00,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291328539] [2025-01-09 20:27:00,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291328539] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:27:00,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:27:00,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:27:00,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093969954] [2025-01-09 20:27:00,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:27:00,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:27:00,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:27:00,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:27:00,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:27:00,922 INFO L87 Difference]: Start difference. First operand 5279 states and 7166 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-01-09 20:27:01,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:27:01,196 INFO L93 Difference]: Finished difference Result 10511 states and 14350 transitions. [2025-01-09 20:27:01,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:27:01,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 134 [2025-01-09 20:27:01,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:27:01,222 INFO L225 Difference]: With dead ends: 10511 [2025-01-09 20:27:01,223 INFO L226 Difference]: Without dead ends: 5269 [2025-01-09 20:27:01,240 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-01-09 20:27:01,241 INFO L435 NwaCegarLoop]: 2848 mSDtfsCounter, 2801 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2801 SdHoareTripleChecker+Valid, 2848 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:27:01,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2801 Valid, 2848 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:27:01,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5269 states. [2025-01-09 20:27:01,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5269 to 5269. [2025-01-09 20:27:01,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5269 states, 3584 states have (on average 1.2525111607142858) internal successors, (4489), 3719 states have internal predecessors, (4489), 1311 states have call successors, (1311), 355 states have call predecessors, (1311), 354 states have return successors, (1349), 1277 states have call predecessors, (1349), 1309 states have call successors, (1349) [2025-01-09 20:27:01,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5269 states to 5269 states and 7149 transitions. [2025-01-09 20:27:01,521 INFO L78 Accepts]: Start accepts. Automaton has 5269 states and 7149 transitions. Word has length 134 [2025-01-09 20:27:01,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:27:01,522 INFO L471 AbstractCegarLoop]: Abstraction has 5269 states and 7149 transitions. [2025-01-09 20:27:01,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-01-09 20:27:01,522 INFO L276 IsEmpty]: Start isEmpty. Operand 5269 states and 7149 transitions. [2025-01-09 20:27:01,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 20:27:01,523 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:27:01,523 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-01-09 20:27:01,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 20:27:01,524 INFO L396 AbstractCegarLoop]: === Iteration 15 === 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-01-09 20:27:01,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:27:01,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1025637071, now seen corresponding path program 1 times [2025-01-09 20:27:01,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:27:01,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961453139] [2025-01-09 20:27:01,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:27:01,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:27:01,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 20:27:01,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 20:27:01,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:27:01,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:27:02,096 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 20:27:02,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:27:02,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961453139] [2025-01-09 20:27:02,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961453139] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:27:02,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:27:02,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:27:02,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725414046] [2025-01-09 20:27:02,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:27:02,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:27:02,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:27:02,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:27:02,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:27:02,098 INFO L87 Difference]: Start difference. First operand 5269 states and 7149 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-01-09 20:27:02,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:27:02,536 INFO L93 Difference]: Finished difference Result 5269 states and 7149 transitions. [2025-01-09 20:27:02,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:27:02,537 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-01-09 20:27:02,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:27:02,567 INFO L225 Difference]: With dead ends: 5269 [2025-01-09 20:27:02,567 INFO L226 Difference]: Without dead ends: 5267 [2025-01-09 20:27:02,570 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-01-09 20:27:02,571 INFO L435 NwaCegarLoop]: 2845 mSDtfsCounter, 2808 mSDsluCounter, 2844 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2808 SdHoareTripleChecker+Valid, 5689 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:27:02,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2808 Valid, 5689 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:27:02,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5267 states. [2025-01-09 20:27:02,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5267 to 5267. [2025-01-09 20:27:02,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5267 states, 3583 states have (on average 1.2523025397711416) internal successors, (4487), 3717 states have internal predecessors, (4487), 1311 states have call successors, (1311), 355 states have call predecessors, (1311), 354 states have return successors, (1349), 1277 states have call predecessors, (1349), 1309 states have call successors, (1349) [2025-01-09 20:27:02,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5267 states to 5267 states and 7147 transitions. [2025-01-09 20:27:02,951 INFO L78 Accepts]: Start accepts. Automaton has 5267 states and 7147 transitions. Word has length 113 [2025-01-09 20:27:02,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:27:02,951 INFO L471 AbstractCegarLoop]: Abstraction has 5267 states and 7147 transitions. [2025-01-09 20:27:02,951 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-01-09 20:27:02,952 INFO L276 IsEmpty]: Start isEmpty. Operand 5267 states and 7147 transitions. [2025-01-09 20:27:02,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 20:27:02,953 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:27:02,953 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-01-09 20:27:02,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 20:27:02,954 INFO L396 AbstractCegarLoop]: === Iteration 16 === 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-01-09 20:27:02,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:27:02,955 INFO L85 PathProgramCache]: Analyzing trace with hash 2105813654, now seen corresponding path program 1 times [2025-01-09 20:27:02,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:27:02,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833469184] [2025-01-09 20:27:02,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:27:02,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:27:03,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 20:27:03,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 20:27:03,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:27:03,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:27:03,456 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 20:27:03,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:27:03,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833469184] [2025-01-09 20:27:03,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833469184] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:27:03,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:27:03,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:27:03,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259287911] [2025-01-09 20:27:03,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:27:03,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:27:03,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:27:03,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:27:03,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:27:03,459 INFO L87 Difference]: Start difference. First operand 5267 states and 7147 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-01-09 20:27:03,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:27:03,717 INFO L93 Difference]: Finished difference Result 5267 states and 7147 transitions. [2025-01-09 20:27:03,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:27:03,717 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-01-09 20:27:03,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:27:03,737 INFO L225 Difference]: With dead ends: 5267 [2025-01-09 20:27:03,738 INFO L226 Difference]: Without dead ends: 5265 [2025-01-09 20:27:03,740 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-01-09 20:27:03,740 INFO L435 NwaCegarLoop]: 2843 mSDtfsCounter, 2807 mSDsluCounter, 2842 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2807 SdHoareTripleChecker+Valid, 5685 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:27:03,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2807 Valid, 5685 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:27:03,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5265 states. [2025-01-09 20:27:03,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5265 to 5265. [2025-01-09 20:27:03,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5265 states, 3582 states have (on average 1.2520938023450587) internal successors, (4485), 3715 states have internal predecessors, (4485), 1311 states have call successors, (1311), 355 states have call predecessors, (1311), 354 states have return successors, (1349), 1277 states have call predecessors, (1349), 1309 states have call successors, (1349) [2025-01-09 20:27:04,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5265 states to 5265 states and 7145 transitions. [2025-01-09 20:27:04,009 INFO L78 Accepts]: Start accepts. Automaton has 5265 states and 7145 transitions. Word has length 119 [2025-01-09 20:27:04,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:27:04,010 INFO L471 AbstractCegarLoop]: Abstraction has 5265 states and 7145 transitions. [2025-01-09 20:27:04,010 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-01-09 20:27:04,011 INFO L276 IsEmpty]: Start isEmpty. Operand 5265 states and 7145 transitions. [2025-01-09 20:27:04,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 20:27:04,011 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:27:04,012 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-01-09 20:27:04,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 20:27:04,012 INFO L396 AbstractCegarLoop]: === Iteration 17 === 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-01-09 20:27:04,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:27:04,012 INFO L85 PathProgramCache]: Analyzing trace with hash -647014409, now seen corresponding path program 1 times [2025-01-09 20:27:04,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:27:04,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634959941] [2025-01-09 20:27:04,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:27:04,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:27:04,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 20:27:04,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 20:27:04,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:27:04,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:27:04,509 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 20:27:04,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:27:04,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634959941] [2025-01-09 20:27:04,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634959941] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:27:04,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:27:04,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:27:04,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295713120] [2025-01-09 20:27:04,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:27:04,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:27:04,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:27:04,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:27:04,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:27:04,512 INFO L87 Difference]: Start difference. First operand 5265 states and 7145 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-01-09 20:27:04,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:27:04,848 INFO L93 Difference]: Finished difference Result 5265 states and 7145 transitions. [2025-01-09 20:27:04,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:27:04,848 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-01-09 20:27:04,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:27:04,867 INFO L225 Difference]: With dead ends: 5265 [2025-01-09 20:27:04,868 INFO L226 Difference]: Without dead ends: 5263 [2025-01-09 20:27:04,870 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-01-09 20:27:04,870 INFO L435 NwaCegarLoop]: 2841 mSDtfsCounter, 2804 mSDsluCounter, 2840 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2804 SdHoareTripleChecker+Valid, 5681 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:27:04,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2804 Valid, 5681 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:27:04,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5263 states. [2025-01-09 20:27:05,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5263 to 5263. [2025-01-09 20:27:05,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5263 states, 3581 states have (on average 1.2518849483384529) internal successors, (4483), 3713 states have internal predecessors, (4483), 1311 states have call successors, (1311), 355 states have call predecessors, (1311), 354 states have return successors, (1349), 1277 states have call predecessors, (1349), 1309 states have call successors, (1349) [2025-01-09 20:27:05,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5263 states to 5263 states and 7143 transitions. [2025-01-09 20:27:05,133 INFO L78 Accepts]: Start accepts. Automaton has 5263 states and 7143 transitions. Word has length 125 [2025-01-09 20:27:05,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:27:05,133 INFO L471 AbstractCegarLoop]: Abstraction has 5263 states and 7143 transitions. [2025-01-09 20:27:05,134 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-01-09 20:27:05,134 INFO L276 IsEmpty]: Start isEmpty. Operand 5263 states and 7143 transitions. [2025-01-09 20:27:05,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 20:27:05,135 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:27:05,135 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-01-09 20:27:05,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 20:27:05,135 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:27:05,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:27:05,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1905170834, now seen corresponding path program 1 times [2025-01-09 20:27:05,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:27:05,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3581582] [2025-01-09 20:27:05,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:27:05,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:27:05,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 20:27:05,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 20:27:05,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:27:05,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:27:05,682 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 20:27:05,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:27:05,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3581582] [2025-01-09 20:27:05,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3581582] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:27:05,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:27:05,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:27:05,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480032246] [2025-01-09 20:27:05,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:27:05,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:27:05,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:27:05,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:27:05,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:27:05,685 INFO L87 Difference]: Start difference. First operand 5263 states and 7143 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-01-09 20:27:05,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:27:05,976 INFO L93 Difference]: Finished difference Result 5263 states and 7143 transitions. [2025-01-09 20:27:05,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:27:05,977 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-01-09 20:27:05,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:27:05,994 INFO L225 Difference]: With dead ends: 5263 [2025-01-09 20:27:05,994 INFO L226 Difference]: Without dead ends: 5261 [2025-01-09 20:27:05,996 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-01-09 20:27:05,997 INFO L435 NwaCegarLoop]: 2839 mSDtfsCounter, 2801 mSDsluCounter, 2838 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2801 SdHoareTripleChecker+Valid, 5677 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:27:05,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2801 Valid, 5677 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:27:06,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5261 states. [2025-01-09 20:27:06,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5261 to 5261. [2025-01-09 20:27:06,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5261 states, 3580 states have (on average 1.2516759776536313) internal successors, (4481), 3711 states have internal predecessors, (4481), 1311 states have call successors, (1311), 355 states have call predecessors, (1311), 354 states have return successors, (1349), 1277 states have call predecessors, (1349), 1309 states have call successors, (1349) [2025-01-09 20:27:06,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5261 states to 5261 states and 7141 transitions. [2025-01-09 20:27:06,264 INFO L78 Accepts]: Start accepts. Automaton has 5261 states and 7141 transitions. Word has length 131 [2025-01-09 20:27:06,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:27:06,265 INFO L471 AbstractCegarLoop]: Abstraction has 5261 states and 7141 transitions. [2025-01-09 20:27:06,265 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-01-09 20:27:06,265 INFO L276 IsEmpty]: Start isEmpty. Operand 5261 states and 7141 transitions. [2025-01-09 20:27:06,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 20:27:06,266 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:27:06,267 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-01-09 20:27:06,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 20:27:06,267 INFO L396 AbstractCegarLoop]: === Iteration 19 === 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-01-09 20:27:06,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:27:06,267 INFO L85 PathProgramCache]: Analyzing trace with hash 203696717, now seen corresponding path program 1 times [2025-01-09 20:27:06,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:27:06,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529599456] [2025-01-09 20:27:06,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:27:06,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:27:06,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 20:27:06,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 20:27:06,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:27:06,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:27:06,784 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 20:27:06,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:27:06,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529599456] [2025-01-09 20:27:06,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529599456] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:27:06,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:27:06,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:27:06,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566369235] [2025-01-09 20:27:06,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:27:06,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:27:06,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:27:06,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:27:06,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:27:06,787 INFO L87 Difference]: Start difference. First operand 5261 states and 7141 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-01-09 20:27:07,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:27:07,160 INFO L93 Difference]: Finished difference Result 5261 states and 7141 transitions. [2025-01-09 20:27:07,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:27:07,160 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-01-09 20:27:07,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:27:07,183 INFO L225 Difference]: With dead ends: 5261 [2025-01-09 20:27:07,183 INFO L226 Difference]: Without dead ends: 5259 [2025-01-09 20:27:07,186 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-01-09 20:27:07,186 INFO L435 NwaCegarLoop]: 2837 mSDtfsCounter, 2798 mSDsluCounter, 2836 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2798 SdHoareTripleChecker+Valid, 5673 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:27:07,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2798 Valid, 5673 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:27:07,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5259 states. [2025-01-09 20:27:07,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5259 to 5259. [2025-01-09 20:27:07,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5259 states, 3579 states have (on average 1.2514668901927912) internal successors, (4479), 3709 states have internal predecessors, (4479), 1311 states have call successors, (1311), 355 states have call predecessors, (1311), 354 states have return successors, (1349), 1277 states have call predecessors, (1349), 1309 states have call successors, (1349) [2025-01-09 20:27:07,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5259 states to 5259 states and 7139 transitions. [2025-01-09 20:27:07,794 INFO L78 Accepts]: Start accepts. Automaton has 5259 states and 7139 transitions. Word has length 137 [2025-01-09 20:27:07,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:27:07,795 INFO L471 AbstractCegarLoop]: Abstraction has 5259 states and 7139 transitions. [2025-01-09 20:27:07,795 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-01-09 20:27:07,795 INFO L276 IsEmpty]: Start isEmpty. Operand 5259 states and 7139 transitions. [2025-01-09 20:27:07,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 20:27:07,797 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:27:07,797 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-01-09 20:27:07,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 20:27:07,797 INFO L396 AbstractCegarLoop]: === Iteration 20 === 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-01-09 20:27:07,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:27:07,798 INFO L85 PathProgramCache]: Analyzing trace with hash -581401595, now seen corresponding path program 1 times [2025-01-09 20:27:07,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:27:07,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539179823] [2025-01-09 20:27:07,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:27:07,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:27:08,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 20:27:08,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 20:27:08,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:27:08,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:27:08,389 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 20:27:08,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:27:08,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539179823] [2025-01-09 20:27:08,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539179823] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:27:08,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:27:08,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:27:08,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347966889] [2025-01-09 20:27:08,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:27:08,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:27:08,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:27:08,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:27:08,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:27:08,391 INFO L87 Difference]: Start difference. First operand 5259 states and 7139 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-01-09 20:27:08,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:27:08,645 INFO L93 Difference]: Finished difference Result 5259 states and 7139 transitions. [2025-01-09 20:27:08,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:27:08,645 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-01-09 20:27:08,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:27:08,668 INFO L225 Difference]: With dead ends: 5259 [2025-01-09 20:27:08,668 INFO L226 Difference]: Without dead ends: 5257 [2025-01-09 20:27:08,672 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-01-09 20:27:08,672 INFO L435 NwaCegarLoop]: 2835 mSDtfsCounter, 2795 mSDsluCounter, 2834 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2795 SdHoareTripleChecker+Valid, 5669 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:27:08,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2795 Valid, 5669 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:27:08,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5257 states. [2025-01-09 20:27:09,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5257 to 5257. [2025-01-09 20:27:09,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5257 states, 3578 states have (on average 1.2512576858580213) internal successors, (4477), 3707 states have internal predecessors, (4477), 1311 states have call successors, (1311), 355 states have call predecessors, (1311), 354 states have return successors, (1349), 1277 states have call predecessors, (1349), 1309 states have call successors, (1349) [2025-01-09 20:27:09,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5257 states to 5257 states and 7137 transitions. [2025-01-09 20:27:09,053 INFO L78 Accepts]: Start accepts. Automaton has 5257 states and 7137 transitions. Word has length 143 [2025-01-09 20:27:09,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:27:09,054 INFO L471 AbstractCegarLoop]: Abstraction has 5257 states and 7137 transitions. [2025-01-09 20:27:09,054 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-01-09 20:27:09,054 INFO L276 IsEmpty]: Start isEmpty. Operand 5257 states and 7137 transitions. [2025-01-09 20:27:09,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-01-09 20:27:09,056 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:27:09,056 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-01-09 20:27:09,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 20:27:09,056 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:27:09,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:27:09,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1047719675, now seen corresponding path program 1 times [2025-01-09 20:27:09,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:27:09,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413115581] [2025-01-09 20:27:09,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:27:09,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:27:09,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 20:27:09,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 20:27:09,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:27:09,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:27:10,365 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2025-01-09 20:27:10,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:27:10,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413115581] [2025-01-09 20:27:10,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413115581] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:27:10,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227666515] [2025-01-09 20:27:10,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:27:10,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:27:10,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:27:10,371 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-01-09 20:27:10,373 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