./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--mtd--sm_ftl.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 66513110c58cbfd09ef37c44af5b1d4813bd7e87bef538ae0fb21419e856753a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 05:51:41,749 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 05:51:41,814 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 05:51:41,819 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 05:51:41,822 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 05:51:41,846 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 05:51:41,848 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 05:51:41,848 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 05:51:41,848 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 05:51:41,848 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 05:51:41,849 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 05:51:41,849 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 05:51:41,849 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 05:51:41,849 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 05:51:41,849 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 05:51:41,849 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 05:51:41,850 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 05:51:41,850 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 05:51:41,850 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 05:51:41,850 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 05:51:41,851 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 05:51:41,851 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 05:51:41,851 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 05:51:41,851 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 05:51:41,851 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 05:51:41,851 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 05:51:41,851 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 05:51:41,851 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 05:51:41,851 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 05:51:41,851 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 05:51:41,851 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 05:51:41,851 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 05:51:41,851 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 05:51:41,851 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 05:51:41,851 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 05:51:41,851 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 05:51:41,851 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 05:51:41,851 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 05:51:41,851 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 05:51:41,851 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 05:51:41,851 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 66513110c58cbfd09ef37c44af5b1d4813bd7e87bef538ae0fb21419e856753a [2025-03-04 05:51:42,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 05:51:42,117 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 05:51:42,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 05:51:42,120 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 05:51:42,121 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 05:51:42,122 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i [2025-03-04 05:51:43,297 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b46b2ccb5/ea26b203483e49d0b988b1bebfc67723/FLAG746787f21 [2025-03-04 05:51:43,869 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 05:51:43,870 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i [2025-03-04 05:51:43,914 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b46b2ccb5/ea26b203483e49d0b988b1bebfc67723/FLAG746787f21 [2025-03-04 05:51:44,369 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b46b2ccb5/ea26b203483e49d0b988b1bebfc67723 [2025-03-04 05:51:44,371 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 05:51:44,372 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 05:51:44,373 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 05:51:44,373 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 05:51:44,376 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 05:51:44,377 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 05:51:44" (1/1) ... [2025-03-04 05:51:44,378 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f6666ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:51:44, skipping insertion in model container [2025-03-04 05:51:44,378 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 05:51:44" (1/1) ... [2025-03-04 05:51:44,461 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 05:51:47,353 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[260078,260091] [2025-03-04 05:51:47,356 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[260223,260236] [2025-03-04 05:51:47,356 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[260369,260382] [2025-03-04 05:51:47,357 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[260534,260547] [2025-03-04 05:51:47,357 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[260692,260705] [2025-03-04 05:51:47,357 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[260850,260863] [2025-03-04 05:51:47,357 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261008,261021] [2025-03-04 05:51:47,357 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261168,261181] [2025-03-04 05:51:47,357 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261327,261340] [2025-03-04 05:51:47,358 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261466,261479] [2025-03-04 05:51:47,358 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261608,261621] [2025-03-04 05:51:47,358 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261757,261770] [2025-03-04 05:51:47,358 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261896,261909] [2025-03-04 05:51:47,358 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262051,262064] [2025-03-04 05:51:47,359 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262211,262224] [2025-03-04 05:51:47,359 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262362,262375] [2025-03-04 05:51:47,359 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262513,262526] [2025-03-04 05:51:47,359 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262665,262678] [2025-03-04 05:51:47,359 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262814,262827] [2025-03-04 05:51:47,360 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262962,262975] [2025-03-04 05:51:47,360 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[263119,263132] [2025-03-04 05:51:47,360 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[263268,263281] [2025-03-04 05:51:47,361 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[263424,263437] [2025-03-04 05:51:47,361 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[263577,263590] [2025-03-04 05:51:47,361 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[263723,263736] [2025-03-04 05:51:47,361 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[263866,263879] [2025-03-04 05:51:47,363 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[264018,264031] [2025-03-04 05:51:47,363 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[264164,264177] [2025-03-04 05:51:47,363 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[264309,264322] [2025-03-04 05:51:47,364 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[264463,264476] [2025-03-04 05:51:47,364 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[264614,264627] [2025-03-04 05:51:47,364 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[264769,264782] [2025-03-04 05:51:47,365 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[264921,264934] [2025-03-04 05:51:47,365 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[265076,265089] [2025-03-04 05:51:47,365 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[265240,265253] [2025-03-04 05:51:47,365 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[265396,265409] [2025-03-04 05:51:47,365 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[265560,265573] [2025-03-04 05:51:47,366 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[265702,265715] [2025-03-04 05:51:47,366 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[265860,265873] [2025-03-04 05:51:47,366 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266027,266040] [2025-03-04 05:51:47,367 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266186,266199] [2025-03-04 05:51:47,367 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266345,266358] [2025-03-04 05:51:47,368 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266494,266507] [2025-03-04 05:51:47,368 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266641,266654] [2025-03-04 05:51:47,368 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266780,266793] [2025-03-04 05:51:47,369 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266943,266956] [2025-03-04 05:51:47,370 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[267109,267122] [2025-03-04 05:51:47,370 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[267273,267286] [2025-03-04 05:51:47,370 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[267438,267451] [2025-03-04 05:51:47,370 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[267603,267616] [2025-03-04 05:51:47,370 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[267769,267782] [2025-03-04 05:51:47,371 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[267934,267947] [2025-03-04 05:51:47,371 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[268101,268114] [2025-03-04 05:51:47,371 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[268261,268274] [2025-03-04 05:51:47,371 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[268423,268436] [2025-03-04 05:51:47,371 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[268582,268595] [2025-03-04 05:51:47,371 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[268728,268741] [2025-03-04 05:51:47,372 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[268871,268884] [2025-03-04 05:51:47,372 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[269015,269028] [2025-03-04 05:51:47,372 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[269158,269171] [2025-03-04 05:51:47,372 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[269302,269315] [2025-03-04 05:51:47,376 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[269443,269456] [2025-03-04 05:51:47,377 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[269581,269594] [2025-03-04 05:51:47,377 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[269739,269752] [2025-03-04 05:51:47,378 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[269898,269911] [2025-03-04 05:51:47,378 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[270054,270067] [2025-03-04 05:51:47,379 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[270203,270216] [2025-03-04 05:51:47,379 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[270355,270368] [2025-03-04 05:51:47,379 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[270506,270519] [2025-03-04 05:51:47,380 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[270655,270668] [2025-03-04 05:51:47,381 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[270807,270820] [2025-03-04 05:51:47,381 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[270955,270968] [2025-03-04 05:51:47,381 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[271108,271121] [2025-03-04 05:51:47,382 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[271259,271272] [2025-03-04 05:51:47,382 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[271409,271422] [2025-03-04 05:51:47,382 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[271556,271569] [2025-03-04 05:51:47,383 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[271707,271720] [2025-03-04 05:51:47,383 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[271858,271871] [2025-03-04 05:51:47,384 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272006,272019] [2025-03-04 05:51:47,385 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272172,272185] [2025-03-04 05:51:47,385 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272341,272354] [2025-03-04 05:51:47,385 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272508,272521] [2025-03-04 05:51:47,385 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272676,272689] [2025-03-04 05:51:47,385 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272826,272839] [2025-03-04 05:51:47,385 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272973,272986] [2025-03-04 05:51:47,386 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[273134,273147] [2025-03-04 05:51:47,386 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[273304,273317] [2025-03-04 05:51:47,386 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[273466,273479] [2025-03-04 05:51:47,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 05:51:47,415 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 05:51:47,488 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)); [3944] [2025-03-04 05:51:47,489 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("bt %2,%1\n\tsbb %0,%0": "=r" (oldbit): "m" (*((unsigned long *)addr)), "Ir" (nr)); [3952-3953] [2025-03-04 05:51:47,490 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("661:\n\tcall __sw_hweight32\n662:\n.pushsection .altinstructions,\"a\"\n .long 661b - .\n .long 6631f - .\n .word ( 4*32+23)\n .byte 662b-661b\n .byte 6641f-6631f\n.popsection\n.pushsection .discard,\"aw\",@progbits\n .byte 0xff + (6641f-6631f) - (662b-661b)\n.popsection\n.pushsection .altinstr_replacement, \"ax\"\n6631:\n\t.byte 0xf3,0x40,0x0f,0xb8,0xc7\n6641:\n\t.popsection": "=a" (res): "D" (w)); [3965] [2025-03-04 05:51:47,518 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 *)"drivers/mtd/sm_ftl.c"), "i" (326), "i" (12UL)); [4717-4718] [2025-03-04 05:51:47,524 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 *)"drivers/mtd/sm_ftl.c"), "i" (471), "i" (12UL)); [4937-4938] [2025-03-04 05:51:47,536 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 *)"drivers/mtd/sm_ftl.c"), "i" (883), "i" (12UL)); [5594-5595] [2025-03-04 05:51:47,538 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 *)"drivers/mtd/sm_ftl.c"), "i" (943), "i" (12UL)); [5691-5692] [2025-03-04 05:51:47,542 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 *)"drivers/mtd/sm_ftl.c"), "i" (1063), "i" (12UL)); [5888-5889] [2025-03-04 05:51:47,618 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[260078,260091] [2025-03-04 05:51:47,619 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[260223,260236] [2025-03-04 05:51:47,619 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[260369,260382] [2025-03-04 05:51:47,619 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[260534,260547] [2025-03-04 05:51:47,619 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[260692,260705] [2025-03-04 05:51:47,620 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[260850,260863] [2025-03-04 05:51:47,620 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261008,261021] [2025-03-04 05:51:47,620 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261168,261181] [2025-03-04 05:51:47,620 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261327,261340] [2025-03-04 05:51:47,620 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261466,261479] [2025-03-04 05:51:47,621 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261608,261621] [2025-03-04 05:51:47,621 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261757,261770] [2025-03-04 05:51:47,621 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261896,261909] [2025-03-04 05:51:47,621 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262051,262064] [2025-03-04 05:51:47,621 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262211,262224] [2025-03-04 05:51:47,622 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262362,262375] [2025-03-04 05:51:47,622 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262513,262526] [2025-03-04 05:51:47,622 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262665,262678] [2025-03-04 05:51:47,622 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262814,262827] [2025-03-04 05:51:47,622 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262962,262975] [2025-03-04 05:51:47,623 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[263119,263132] [2025-03-04 05:51:47,623 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[263268,263281] [2025-03-04 05:51:47,623 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[263424,263437] [2025-03-04 05:51:47,623 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[263577,263590] [2025-03-04 05:51:47,623 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[263723,263736] [2025-03-04 05:51:47,624 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[263866,263879] [2025-03-04 05:51:47,624 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[264018,264031] [2025-03-04 05:51:47,624 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[264164,264177] [2025-03-04 05:51:47,624 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[264309,264322] [2025-03-04 05:51:47,624 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[264463,264476] [2025-03-04 05:51:47,625 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[264614,264627] [2025-03-04 05:51:47,625 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[264769,264782] [2025-03-04 05:51:47,625 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[264921,264934] [2025-03-04 05:51:47,625 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[265076,265089] [2025-03-04 05:51:47,625 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[265240,265253] [2025-03-04 05:51:47,626 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[265396,265409] [2025-03-04 05:51:47,626 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[265560,265573] [2025-03-04 05:51:47,626 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[265702,265715] [2025-03-04 05:51:47,626 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[265860,265873] [2025-03-04 05:51:47,626 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266027,266040] [2025-03-04 05:51:47,627 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266186,266199] [2025-03-04 05:51:47,627 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266345,266358] [2025-03-04 05:51:47,627 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266494,266507] [2025-03-04 05:51:47,627 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266641,266654] [2025-03-04 05:51:47,627 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266780,266793] [2025-03-04 05:51:47,628 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266943,266956] [2025-03-04 05:51:47,628 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[267109,267122] [2025-03-04 05:51:47,628 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[267273,267286] [2025-03-04 05:51:47,628 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[267438,267451] [2025-03-04 05:51:47,628 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[267603,267616] [2025-03-04 05:51:47,629 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[267769,267782] [2025-03-04 05:51:47,629 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[267934,267947] [2025-03-04 05:51:47,629 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[268101,268114] [2025-03-04 05:51:47,629 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[268261,268274] [2025-03-04 05:51:47,629 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[268423,268436] [2025-03-04 05:51:47,629 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[268582,268595] [2025-03-04 05:51:47,630 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[268728,268741] [2025-03-04 05:51:47,630 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[268871,268884] [2025-03-04 05:51:47,630 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[269015,269028] [2025-03-04 05:51:47,630 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[269158,269171] [2025-03-04 05:51:47,630 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[269302,269315] [2025-03-04 05:51:47,630 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[269443,269456] [2025-03-04 05:51:47,631 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[269581,269594] [2025-03-04 05:51:47,631 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[269739,269752] [2025-03-04 05:51:47,631 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[269898,269911] [2025-03-04 05:51:47,631 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[270054,270067] [2025-03-04 05:51:47,631 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[270203,270216] [2025-03-04 05:51:47,631 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[270355,270368] [2025-03-04 05:51:47,631 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[270506,270519] [2025-03-04 05:51:47,631 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[270655,270668] [2025-03-04 05:51:47,632 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[270807,270820] [2025-03-04 05:51:47,632 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[270955,270968] [2025-03-04 05:51:47,632 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[271108,271121] [2025-03-04 05:51:47,632 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[271259,271272] [2025-03-04 05:51:47,632 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[271409,271422] [2025-03-04 05:51:47,632 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[271556,271569] [2025-03-04 05:51:47,633 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[271707,271720] [2025-03-04 05:51:47,633 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[271858,271871] [2025-03-04 05:51:47,633 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272006,272019] [2025-03-04 05:51:47,634 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272172,272185] [2025-03-04 05:51:47,634 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272341,272354] [2025-03-04 05:51:47,634 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272508,272521] [2025-03-04 05:51:47,634 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272676,272689] [2025-03-04 05:51:47,634 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272826,272839] [2025-03-04 05:51:47,635 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272973,272986] [2025-03-04 05:51:47,635 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[273134,273147] [2025-03-04 05:51:47,635 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[273304,273317] [2025-03-04 05:51:47,635 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[273466,273479] [2025-03-04 05:51:47,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 05:51:47,710 INFO L204 MainTranslator]: Completed translation [2025-03-04 05:51:47,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:51:47 WrapperNode [2025-03-04 05:51:47,711 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 05:51:47,712 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 05:51:47,712 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 05:51:47,712 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 05:51:47,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:51:47" (1/1) ... [2025-03-04 05:51:47,761 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:51:47" (1/1) ... [2025-03-04 05:51:47,894 INFO L138 Inliner]: procedures = 497, calls = 1452, calls flagged for inlining = 215, calls inlined = 136, statements flattened = 3328 [2025-03-04 05:51:47,896 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 05:51:47,898 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 05:51:47,898 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 05:51:47,898 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 05:51:47,905 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:51:47" (1/1) ... [2025-03-04 05:51:47,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:51:47" (1/1) ... [2025-03-04 05:51:47,926 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:51:47" (1/1) ... [2025-03-04 05:51:48,147 INFO L175 MemorySlicer]: Split 483 memory accesses to 22 slices as follows [7, 7, 6, 295, 5, 6, 2, 3, 8, 10, 23, 1, 8, 2, 3, 57, 11, 7, 8, 4, 6, 4]. 61 percent of accesses are in the largest equivalence class. The 27 initializations are split as follows [0, 0, 0, 13, 0, 0, 0, 3, 8, 0, 0, 1, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0]. The 227 writes are split as follows [1, 3, 3, 114, 1, 5, 1, 0, 0, 8, 3, 0, 6, 0, 3, 53, 11, 5, 2, 4, 0, 4]. [2025-03-04 05:51:48,147 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:51:47" (1/1) ... [2025-03-04 05:51:48,148 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:51:47" (1/1) ... [2025-03-04 05:51:48,211 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:51:47" (1/1) ... [2025-03-04 05:51:48,218 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:51:47" (1/1) ... [2025-03-04 05:51:48,234 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:51:47" (1/1) ... [2025-03-04 05:51:48,247 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:51:47" (1/1) ... [2025-03-04 05:51:48,269 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 05:51:48,270 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 05:51:48,270 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 05:51:48,270 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 05:51:48,271 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:51:47" (1/1) ... [2025-03-04 05:51:48,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 05:51:48,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:51:48,316 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 05:51:48,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 05:51:48,338 INFO L130 BoogieDeclarations]: Found specification of procedure sm_mark_block_bad [2025-03-04 05:51:48,338 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_mark_block_bad [2025-03-04 05:51:48,338 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2025-03-04 05:51:48,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2025-03-04 05:51:48,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-03-04 05:51:48,339 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-03-04 05:51:48,339 INFO L130 BoogieDeclarations]: Found specification of procedure variable_test_bit [2025-03-04 05:51:48,339 INFO L138 BoogieDeclarations]: Found implementation of procedure variable_test_bit [2025-03-04 05:51:48,339 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mutex_of_sm_ftl [2025-03-04 05:51:48,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mutex_of_sm_ftl [2025-03-04 05:51:48,339 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-04 05:51:48,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-04 05:51:48,340 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-03-04 05:51:48,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-03-04 05:51:48,340 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2025-03-04 05:51:48,340 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2025-03-04 05:51:48,340 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2025-03-04 05:51:48,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2025-03-04 05:51:48,340 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2025-03-04 05:51:48,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2025-03-04 05:51:48,340 INFO L130 BoogieDeclarations]: Found specification of procedure sm_read_lba [2025-03-04 05:51:48,340 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_read_lba [2025-03-04 05:51:48,340 INFO L130 BoogieDeclarations]: Found specification of procedure sm_check_block [2025-03-04 05:51:48,340 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_check_block [2025-03-04 05:51:48,340 INFO L130 BoogieDeclarations]: Found specification of procedure sm_release [2025-03-04 05:51:48,340 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_release [2025-03-04 05:51:48,340 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2025-03-04 05:51:48,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2025-03-04 05:51:48,340 INFO L130 BoogieDeclarations]: Found specification of procedure sm_cache_init [2025-03-04 05:51:48,340 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_cache_init [2025-03-04 05:51:48,340 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-03-04 05:51:48,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-03-04 05:51:48,340 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2025-03-04 05:51:48,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2025-03-04 05:51:48,340 INFO L130 BoogieDeclarations]: Found specification of procedure sm_read_sector [2025-03-04 05:51:48,340 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_read_sector [2025-03-04 05:51:48,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 05:51:48,340 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2025-03-04 05:51:48,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2025-03-04 05:51:48,340 INFO L130 BoogieDeclarations]: Found specification of procedure sm_write_sector [2025-03-04 05:51:48,340 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_write_sector [2025-03-04 05:51:48,340 INFO L130 BoogieDeclarations]: Found specification of procedure __nand_calculate_ecc [2025-03-04 05:51:48,340 INFO L138 BoogieDeclarations]: Found implementation of procedure __nand_calculate_ecc [2025-03-04 05:51:48,340 INFO L130 BoogieDeclarations]: Found specification of procedure __kfifo_uint_must_check_helper [2025-03-04 05:51:48,340 INFO L138 BoogieDeclarations]: Found implementation of procedure __kfifo_uint_must_check_helper [2025-03-04 05:51:48,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-04 05:51:48,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-04 05:51:48,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-04 05:51:48,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-04 05:51:48,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-04 05:51:48,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-04 05:51:48,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-04 05:51:48,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-03-04 05:51:48,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-03-04 05:51:48,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-03-04 05:51:48,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-03-04 05:51:48,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-03-04 05:51:48,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-03-04 05:51:48,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-03-04 05:51:48,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-03-04 05:51:48,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-03-04 05:51:48,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#16 [2025-03-04 05:51:48,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#17 [2025-03-04 05:51:48,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#18 [2025-03-04 05:51:48,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#19 [2025-03-04 05:51:48,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#20 [2025-03-04 05:51:48,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#21 [2025-03-04 05:51:48,343 INFO L130 BoogieDeclarations]: Found specification of procedure sm_remove_dev [2025-03-04 05:51:48,343 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_remove_dev [2025-03-04 05:51:48,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 05:51:48,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 05:51:48,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 05:51:48,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 05:51:48,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 05:51:48,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 05:51:48,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 05:51:48,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 05:51:48,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 05:51:48,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-04 05:51:48,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-04 05:51:48,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-04 05:51:48,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-04 05:51:48,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-04 05:51:48,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-04 05:51:48,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-04 05:51:48,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-04 05:51:48,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-03-04 05:51:48,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-03-04 05:51:48,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-03-04 05:51:48,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-03-04 05:51:48,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-03-04 05:51:48,343 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2025-03-04 05:51:48,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2025-03-04 05:51:48,343 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2025-03-04 05:51:48,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2025-03-04 05:51:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mutex_of_sm_ftl [2025-03-04 05:51:48,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mutex_of_sm_ftl [2025-03-04 05:51:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-03-04 05:51:48,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-03-04 05:51:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 05:51:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 05:51:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 05:51:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 05:51:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 05:51:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 05:51:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 05:51:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 05:51:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 05:51:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 05:51:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 05:51:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 05:51:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 05:51:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-04 05:51:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-04 05:51:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-04 05:51:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-04 05:51:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-04 05:51:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-04 05:51:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-03-04 05:51:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-03-04 05:51:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-03-04 05:51:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2025-03-04 05:51:48,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2025-03-04 05:51:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2025-03-04 05:51:48,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2025-03-04 05:51:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure sm_recheck_media [2025-03-04 05:51:48,344 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_recheck_media [2025-03-04 05:51:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2025-03-04 05:51:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2025-03-04 05:51:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2025-03-04 05:51:48,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2025-03-04 05:51:48,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2025-03-04 05:51:48,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2025-03-04 05:51:48,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2025-03-04 05:51:48,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2025-03-04 05:51:48,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2025-03-04 05:51:48,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#9 [2025-03-04 05:51:48,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#10 [2025-03-04 05:51:48,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#11 [2025-03-04 05:51:48,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#12 [2025-03-04 05:51:48,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#13 [2025-03-04 05:51:48,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#14 [2025-03-04 05:51:48,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#15 [2025-03-04 05:51:48,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#16 [2025-03-04 05:51:48,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#17 [2025-03-04 05:51:48,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#18 [2025-03-04 05:51:48,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#19 [2025-03-04 05:51:48,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#20 [2025-03-04 05:51:48,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#21 [2025-03-04 05:51:48,347 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2025-03-04 05:51:48,347 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2025-03-04 05:51:48,347 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2025-03-04 05:51:48,347 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2025-03-04 05:51:48,347 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2025-03-04 05:51:48,347 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2025-03-04 05:51:48,347 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2025-03-04 05:51:48,347 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2025-03-04 05:51:48,347 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2025-03-04 05:51:48,347 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#9 [2025-03-04 05:51:48,347 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#10 [2025-03-04 05:51:48,347 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#11 [2025-03-04 05:51:48,347 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#12 [2025-03-04 05:51:48,347 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#13 [2025-03-04 05:51:48,347 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#14 [2025-03-04 05:51:48,347 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#15 [2025-03-04 05:51:48,347 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#16 [2025-03-04 05:51:48,347 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#17 [2025-03-04 05:51:48,347 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#18 [2025-03-04 05:51:48,347 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#19 [2025-03-04 05:51:48,347 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#20 [2025-03-04 05:51:48,347 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#21 [2025-03-04 05:51:48,347 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2025-03-04 05:51:48,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2025-03-04 05:51:48,347 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2025-03-04 05:51:48,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2025-03-04 05:51:48,348 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2025-03-04 05:51:48,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2025-03-04 05:51:48,348 INFO L130 BoogieDeclarations]: Found specification of procedure sm_cache_put [2025-03-04 05:51:48,348 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_cache_put [2025-03-04 05:51:48,348 INFO L130 BoogieDeclarations]: Found specification of procedure sm_read_cis [2025-03-04 05:51:48,348 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_read_cis [2025-03-04 05:51:48,348 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-03-04 05:51:48,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-03-04 05:51:48,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 05:51:48,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 05:51:48,348 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-03-04 05:51:48,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-03-04 05:51:48,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 05:51:48,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 05:51:48,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 05:51:48,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 05:51:48,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 05:51:48,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 05:51:48,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 05:51:48,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 05:51:48,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 05:51:48,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 05:51:48,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-04 05:51:48,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-04 05:51:48,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-04 05:51:48,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-04 05:51:48,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-04 05:51:48,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-04 05:51:48,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-04 05:51:48,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-04 05:51:48,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-04 05:51:48,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-03-04 05:51:48,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-03-04 05:51:48,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-03-04 05:51:48,350 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2025-03-04 05:51:48,350 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2025-03-04 05:51:48,350 INFO L130 BoogieDeclarations]: Found specification of procedure __kfifo_out [2025-03-04 05:51:48,350 INFO L138 BoogieDeclarations]: Found implementation of procedure __kfifo_out [2025-03-04 05:51:48,350 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2025-03-04 05:51:48,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2025-03-04 05:51:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2025-03-04 05:51:48,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2025-03-04 05:51:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure sm_cache_flush [2025-03-04 05:51:48,351 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_cache_flush [2025-03-04 05:51:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 05:51:48,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 05:51:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2025-03-04 05:51:48,351 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2025-03-04 05:51:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure sm_get_zone [2025-03-04 05:51:48,351 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_get_zone [2025-03-04 05:51:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-04 05:51:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-04 05:51:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-04 05:51:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-04 05:51:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-04 05:51:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-04 05:51:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-04 05:51:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-03-04 05:51:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-03-04 05:51:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-03-04 05:51:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-03-04 05:51:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-03-04 05:51:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-03-04 05:51:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-03-04 05:51:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-03-04 05:51:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-03-04 05:51:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#16 [2025-03-04 05:51:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#17 [2025-03-04 05:51:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#18 [2025-03-04 05:51:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#19 [2025-03-04 05:51:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#20 [2025-03-04 05:51:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#21 [2025-03-04 05:51:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure __arch_hweight16 [2025-03-04 05:51:48,351 INFO L138 BoogieDeclarations]: Found implementation of procedure __arch_hweight16 [2025-03-04 05:51:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 05:51:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 05:51:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 05:51:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 05:51:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 05:51:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 05:51:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 05:51:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 05:51:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-04 05:51:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-04 05:51:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-04 05:51:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-04 05:51:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-04 05:51:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-04 05:51:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-04 05:51:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-04 05:51:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-03-04 05:51:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-03-04 05:51:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-03-04 05:51:48,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-03-04 05:51:48,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2025-03-04 05:51:48,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#21 [2025-03-04 05:51:48,354 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-04 05:51:48,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-04 05:51:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_workqueue [2025-03-04 05:51:48,355 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_workqueue [2025-03-04 05:51:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure sm_mkoffset [2025-03-04 05:51:48,355 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_mkoffset [2025-03-04 05:51:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 05:51:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 05:51:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 05:51:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-03-04 05:51:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-03-04 05:51:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-03-04 05:51:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-03-04 05:51:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-03-04 05:51:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-03-04 05:51:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2025-03-04 05:51:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2025-03-04 05:51:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#11 [2025-03-04 05:51:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#12 [2025-03-04 05:51:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#13 [2025-03-04 05:51:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#14 [2025-03-04 05:51:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#15 [2025-03-04 05:51:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#16 [2025-03-04 05:51:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#17 [2025-03-04 05:51:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#18 [2025-03-04 05:51:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#19 [2025-03-04 05:51:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#20 [2025-03-04 05:51:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#21 [2025-03-04 05:51:48,355 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 05:51:48,355 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 05:51:48,355 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 05:51:48,355 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-03-04 05:51:48,355 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-03-04 05:51:48,355 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-03-04 05:51:48,355 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-03-04 05:51:48,355 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-03-04 05:51:48,355 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-03-04 05:51:48,355 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2025-03-04 05:51:48,355 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2025-03-04 05:51:48,355 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#11 [2025-03-04 05:51:48,355 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#12 [2025-03-04 05:51:48,355 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#13 [2025-03-04 05:51:48,355 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#14 [2025-03-04 05:51:48,355 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#15 [2025-03-04 05:51:48,355 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#16 [2025-03-04 05:51:48,355 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#17 [2025-03-04 05:51:48,355 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#18 [2025-03-04 05:51:48,355 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#19 [2025-03-04 05:51:48,355 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#20 [2025-03-04 05:51:48,355 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#21 [2025-03-04 05:51:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure sm_get_lba [2025-03-04 05:51:48,355 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_get_lba [2025-03-04 05:51:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2025-03-04 05:51:48,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2025-03-04 05:51:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2025-03-04 05:51:48,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2025-03-04 05:51:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 05:51:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2025-03-04 05:51:48,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2025-03-04 05:51:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-04 05:51:48,356 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure mtd_is_eccerr [2025-03-04 05:51:48,356 INFO L138 BoogieDeclarations]: Found implementation of procedure mtd_is_eccerr [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-03-04 05:51:48,356 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2025-03-04 05:51:48,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2025-03-04 05:51:48,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure __kfifo_in [2025-03-04 05:51:48,356 INFO L138 BoogieDeclarations]: Found implementation of procedure __kfifo_in [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-03-04 05:51:48,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-03-04 05:51:48,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-03-04 05:51:48,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2025-03-04 05:51:48,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure __nand_correct_data [2025-03-04 05:51:48,356 INFO L138 BoogieDeclarations]: Found implementation of procedure __nand_correct_data [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-03-04 05:51:48,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-04 05:51:48,356 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-03-04 05:51:48,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 05:51:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 05:51:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-04 05:51:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-04 05:51:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-04 05:51:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-04 05:51:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-04 05:51:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-04 05:51:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-03-04 05:51:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-03-04 05:51:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-03-04 05:51:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2025-03-04 05:51:48,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2025-03-04 05:51:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure is_power_of_2 [2025-03-04 05:51:48,357 INFO L138 BoogieDeclarations]: Found implementation of procedure is_power_of_2 [2025-03-04 05:51:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-04 05:51:48,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-04 05:51:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2025-03-04 05:51:48,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2025-03-04 05:51:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure sm_sector_valid [2025-03-04 05:51:48,357 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_sector_valid [2025-03-04 05:51:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure sm_erase_block [2025-03-04 05:51:48,357 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_erase_block [2025-03-04 05:51:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2025-03-04 05:51:48,357 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2025-03-04 05:51:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2025-03-04 05:51:48,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2025-03-04 05:51:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure sm_break_offset [2025-03-04 05:51:48,357 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_break_offset [2025-03-04 05:51:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure sm_block_valid [2025-03-04 05:51:48,357 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_block_valid [2025-03-04 05:51:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-03-04 05:51:48,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-03-04 05:51:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 05:51:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 05:51:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 05:51:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 05:51:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 05:51:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 05:51:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 05:51:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 05:51:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 05:51:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 05:51:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 05:51:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 05:51:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 05:51:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-04 05:51:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-04 05:51:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-04 05:51:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-04 05:51:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-04 05:51:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-04 05:51:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-04 05:51:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-03-04 05:51:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-03-04 05:51:48,890 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 05:51:48,892 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 05:51:49,372 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4153: call ULTIMATE.dealloc(sm_block_erased_~#erased_pattern~0#1.base, sm_block_erased_~#erased_pattern~0#1.offset);havoc sm_block_erased_~#erased_pattern~0#1.base, sm_block_erased_~#erased_pattern~0#1.offset; [2025-03-04 05:51:49,372 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5361: call ULTIMATE.dealloc(sm_init_zone_~#oob~5#1.base, sm_init_zone_~#oob~5#1.offset);havoc sm_init_zone_~#oob~5#1.base, sm_init_zone_~#oob~5#1.offset;call ULTIMATE.dealloc(sm_init_zone_~#block~1#1.base, sm_init_zone_~#block~1#1.offset);havoc sm_init_zone_~#block~1#1.base, sm_init_zone_~#block~1#1.offset;call ULTIMATE.dealloc(sm_init_zone_~#i~3#1.base, sm_init_zone_~#i~3#1.offset);havoc sm_init_zone_~#i~3#1.base, sm_init_zone_~#i~3#1.offset; [2025-03-04 05:51:49,372 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11043: havoc __kfifo_alloc_#t~nondet694#1; [2025-03-04 05:51:49,456 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4867: call ULTIMATE.dealloc(~#oob~1.base, ~#oob~1.offset);havoc ~#oob~1.base, ~#oob~1.offset; [2025-03-04 05:51:49,922 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-04 05:51:50,094 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4480: havoc #t~mem160; [2025-03-04 05:51:50,121 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4330: havoc #t~mem130;havoc #t~mem131;havoc #t~bitwise132; [2025-03-04 05:51:50,159 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4335: call ULTIMATE.dealloc(~#erased_pattern~1.base, ~#erased_pattern~1.offset);havoc ~#erased_pattern~1.base, ~#erased_pattern~1.offset; [2025-03-04 05:51:50,780 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5007: call ULTIMATE.dealloc(~#oob~2.base, ~#oob~2.offset);havoc ~#oob~2.base, ~#oob~2.offset;call ULTIMATE.dealloc(~#lbas~0.base, ~#lbas~0.offset);havoc ~#lbas~0.base, ~#lbas~0.offset; [2025-03-04 05:51:50,805 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6305-1: ldv_del_timer_sync_#res#1 := ldv_del_timer_sync_~arg0#1; [2025-03-04 05:51:50,805 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11072: havoc cancel_work_sync_#t~nondet699#1; [2025-03-04 05:51:50,805 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11087: havoc del_timer_sync_#t~nondet702#1; [2025-03-04 05:51:50,805 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6909-1: ldv_del_timer_sync_97_#res#1 := ldv_del_timer_sync_97_~ldv_func_res~2#1; [2025-03-04 05:51:50,937 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4534: call ULTIMATE.dealloc(~#ops~0#1.base, ~#ops~0#1.offset);havoc ~#ops~0#1.base, ~#ops~0#1.offset;call ULTIMATE.dealloc(~#tmp_oob~0#1.base, ~#tmp_oob~0#1.offset);havoc ~#tmp_oob~0#1.base, ~#tmp_oob~0#1.offset; [2025-03-04 05:51:50,938 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4505: call ULTIMATE.dealloc(sm_correct_sector_~#ecc~0#1.base, sm_correct_sector_~#ecc~0#1.offset);havoc sm_correct_sector_~#ecc~0#1.base, sm_correct_sector_~#ecc~0#1.offset; [2025-03-04 05:51:50,938 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11128: havoc mtd_read_oob_#t~nondet708#1; [2025-03-04 05:51:50,940 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11132: havoc #t~nondet709; [2025-03-04 05:51:51,030 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4701: call ULTIMATE.dealloc(~#ops~1#1.base, ~#ops~1#1.offset);havoc ~#ops~1#1.base, ~#ops~1#1.offset; [2025-03-04 05:51:51,036 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11050: havoc #t~nondet695; [2025-03-04 05:51:51,079 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11079: havoc del_mtd_blktrans_dev_#t~nondet700#1; [2025-03-04 05:51:51,109 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11064: havoc #t~nondet697; [2025-03-04 05:51:51,210 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3982: havoc #t~bitwise6;havoc #t~short7; [2025-03-04 05:51:51,238 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5193: call ULTIMATE.dealloc(~#oob~3.base, ~#oob~3.offset);havoc ~#oob~3.base, ~#oob~3.offset; [2025-03-04 05:51:51,347 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11124: havoc mtd_erase_#t~nondet707#1; [2025-03-04 05:51:51,347 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4904: call ULTIMATE.dealloc(~#block#1.base, ~#block#1.offset);havoc ~#block#1.base, ~#block#1.offset;call ULTIMATE.dealloc(~#erase~0#1.base, ~#erase~0#1.offset);havoc ~#erase~0#1.base, ~#erase~0#1.offset; [2025-03-04 05:51:51,379 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11054: havoc #t~nondet696; [2025-03-04 05:51:51,489 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5661: call ULTIMATE.dealloc(~#write_sector~0#1.base, ~#write_sector~0#1.offset);havoc ~#write_sector~0#1.base, ~#write_sector~0#1.offset; [2025-03-04 05:51:51,489 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4383: call ULTIMATE.dealloc(sm_write_lba_~#tmp~13#1.base, sm_write_lba_~#tmp~13#1.offset);havoc sm_write_lba_~#tmp~13#1.base, sm_write_lba_~#tmp~13#1.offset; [2025-03-04 05:51:51,489 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4788: call ULTIMATE.dealloc(sm_write_block_~#invalid_bitmap#1.base, sm_write_block_~#invalid_bitmap#1.offset);havoc sm_write_block_~#invalid_bitmap#1.base, sm_write_block_~#invalid_bitmap#1.offset;call ULTIMATE.dealloc(sm_write_block_~#oob~0#1.base, sm_write_block_~#oob~0#1.offset);havoc sm_write_block_~#oob~0#1.base, sm_write_block_~#oob~0#1.offset; [2025-03-04 05:51:58,365 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11068: havoc add_mtd_blktrans_dev_#t~nondet698#1; [2025-03-04 05:51:58,365 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11036: havoc __alloc_workqueue_key_#t~ret693#1.base, __alloc_workqueue_key_#t~ret693#1.offset; [2025-03-04 05:51:58,365 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11136: havoc queue_work_on_#t~nondet710#1; [2025-03-04 05:51:58,365 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11103: havoc kstrndup_#t~ret704#1.base, kstrndup_#t~ret704#1.offset; [2025-03-04 05:51:58,365 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6942-1: ldv_register_mtd_blktrans_100_#res#1 := ldv_register_mtd_blktrans_100_~ldv_func_res~3#1; [2025-03-04 05:51:58,365 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6317-1: ldv_deregister_mtd_blktrans_#res#1 := ldv_deregister_mtd_blktrans_~arg0#1; [2025-03-04 05:51:58,365 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11140: havoc register_mtd_blktrans_#t~nondet711#1; [2025-03-04 05:51:58,366 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6191: call ULTIMATE.dealloc(sm_module_init_~#__key~2#1.base, sm_module_init_~#__key~2#1.offset);havoc sm_module_init_~#__key~2#1.base, sm_module_init_~#__key~2#1.offset; [2025-03-04 05:51:58,366 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5234: call ULTIMATE.dealloc(sm_find_cis_~#oob~4#1.base, sm_find_cis_~#oob~4#1.offset);havoc sm_find_cis_~#oob~4#1.base, sm_find_cis_~#oob~4#1.offset; [2025-03-04 05:51:58,366 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6524-1: ldv_register_mtd_blktrans_#res#1 := ldv_register_mtd_blktrans_~arg0#1; [2025-03-04 05:51:58,366 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11116: havoc mod_timer_#t~nondet705#1; [2025-03-04 05:51:58,366 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11083: havoc del_timer_#t~nondet701#1; [2025-03-04 05:51:58,366 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6296-1: ldv_del_timer_#res#1 := ldv_del_timer_~arg0#1; [2025-03-04 05:51:58,366 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6957-1: ldv_deregister_mtd_blktrans_101_#res#1 := ldv_deregister_mtd_blktrans_101_~ldv_func_res~4#1; [2025-03-04 05:51:58,366 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6858-1: ldv_mod_timer_92_#res#1 := ldv_mod_timer_92_~ldv_func_res~1#1; [2025-03-04 05:51:58,367 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11120: havoc msecs_to_jiffies_#t~nondet706#1; [2025-03-04 05:51:58,367 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5803: call ULTIMATE.dealloc(sm_read_~#zone_num~1#1.base, sm_read_~#zone_num~1#1.offset);havoc sm_read_~#zone_num~1#1.base, sm_read_~#zone_num~1#1.offset;call ULTIMATE.dealloc(sm_read_~#block~2#1.base, sm_read_~#block~2#1.offset);havoc sm_read_~#block~2#1.base, sm_read_~#block~2#1.offset;call ULTIMATE.dealloc(sm_read_~#boffset~4#1.base, sm_read_~#boffset~4#1.offset);havoc sm_read_~#boffset~4#1.base, sm_read_~#boffset~4#1.offset; [2025-03-04 05:51:58,367 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4219: call ULTIMATE.dealloc(sm_create_sysfs_attributes_~#__key~0#1.base, sm_create_sysfs_attributes_~#__key~0#1.offset);havoc sm_create_sysfs_attributes_~#__key~0#1.base, sm_create_sysfs_attributes_~#__key~0#1.offset; [2025-03-04 05:51:58,367 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4088: havoc mtd_has_oob_#t~mem83#1.base, mtd_has_oob_#t~mem83#1.offset;havoc mtd_has_oob_#t~mem84#1.base, mtd_has_oob_#t~mem84#1.offset;havoc mtd_has_oob_#t~short85#1; [2025-03-04 05:51:58,367 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11091: havoc deregister_mtd_blktrans_#t~nondet703#1; [2025-03-04 05:51:58,367 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6500-1: ldv_mod_timer_#res#1 := ldv_mod_timer_~arg0#1; [2025-03-04 05:51:58,367 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5873: call ULTIMATE.dealloc(sm_write_~#zone_num~2#1.base, sm_write_~#zone_num~2#1.offset);havoc sm_write_~#zone_num~2#1.base, sm_write_~#zone_num~2#1.offset;call ULTIMATE.dealloc(sm_write_~#block~3#1.base, sm_write_~#block~3#1.offset);havoc sm_write_~#block~3#1.base, sm_write_~#block~3#1.offset;call ULTIMATE.dealloc(sm_write_~#boffset~5#1.base, sm_write_~#boffset~5#1.offset);havoc sm_write_~#boffset~5#1.base, sm_write_~#boffset~5#1.offset; [2025-03-04 05:51:58,367 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6834-1: ldv_del_timer_90_#res#1 := ldv_del_timer_90_~ldv_func_res~0#1; [2025-03-04 05:51:58,368 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5978: call ULTIMATE.dealloc(sm_add_mtd_~#__key~1#1.base, sm_add_mtd_~#__key~1#1.offset);havoc sm_add_mtd_~#__key~1#1.base, sm_add_mtd_~#__key~1#1.offset;call ULTIMATE.dealloc(sm_add_mtd_~#__key___0~0#1.base, sm_add_mtd_~#__key___0~0#1.offset);havoc sm_add_mtd_~#__key___0~0#1.base, sm_add_mtd_~#__key___0~0#1.offset;call ULTIMATE.dealloc(sm_add_mtd_~#__key___1~0#1.base, sm_add_mtd_~#__key___1~0#1.offset);havoc sm_add_mtd_~#__key___1~0#1.base, sm_add_mtd_~#__key___1~0#1.offset;call ULTIMATE.dealloc(sm_add_mtd_~#__constr_expr_0~0#1.base, sm_add_mtd_~#__constr_expr_0~0#1.offset);havoc sm_add_mtd_~#__constr_expr_0~0#1.base, sm_add_mtd_~#__constr_expr_0~0#1.offset; [2025-03-04 05:51:58,846 INFO L? ?]: Removed 1772 outVars from TransFormulas that were not future-live. [2025-03-04 05:51:58,846 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 05:51:58,906 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 05:51:58,907 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 05:51:58,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 05:51:58 BoogieIcfgContainer [2025-03-04 05:51:58,907 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 05:51:58,908 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 05:51:58,909 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 05:51:58,912 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 05:51:58,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 05:51:44" (1/3) ... [2025-03-04 05:51:58,913 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db6967 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 05:51:58, skipping insertion in model container [2025-03-04 05:51:58,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:51:47" (2/3) ... [2025-03-04 05:51:58,913 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db6967 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 05:51:58, skipping insertion in model container [2025-03-04 05:51:58,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 05:51:58" (3/3) ... [2025-03-04 05:51:58,914 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i [2025-03-04 05:51:58,924 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 05:51:58,930 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i that has 122 procedures, 1434 locations, 1 initial locations, 66 loop locations, and 27 error locations. [2025-03-04 05:51:58,998 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 05:51:59,009 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;@744e8a88, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 05:51:59,010 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2025-03-04 05:51:59,015 INFO L276 IsEmpty]: Start isEmpty. Operand has 1244 states, 857 states have (on average 1.3208868144690782) internal successors, (1132), 908 states have internal predecessors, (1132), 281 states have call successors, (281), 79 states have call predecessors, (281), 78 states have return successors, (278), 276 states have call predecessors, (278), 278 states have call successors, (278) [2025-03-04 05:51:59,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-04 05:51:59,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:51:59,022 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 05:51:59,022 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2025-03-04 05:51:59,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:51:59,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1501934528, now seen corresponding path program 1 times [2025-03-04 05:51:59,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:51:59,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007973764] [2025-03-04 05:51:59,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:51:59,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:51:59,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 05:52:00,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 05:52:00,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:52:00,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:52:00,612 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 05:52:00,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:52:00,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007973764] [2025-03-04 05:52:00,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007973764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:52:00,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:52:00,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:52:00,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588548139] [2025-03-04 05:52:00,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:52:00,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:52:00,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:52:00,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:52:00,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:52:00,639 INFO L87 Difference]: Start difference. First operand has 1244 states, 857 states have (on average 1.3208868144690782) internal successors, (1132), 908 states have internal predecessors, (1132), 281 states have call successors, (281), 79 states have call predecessors, (281), 78 states have return successors, (278), 276 states have call predecessors, (278), 278 states have call successors, (278) Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 05:52:00,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:52:00,905 INFO L93 Difference]: Finished difference Result 2457 states and 3436 transitions. [2025-03-04 05:52:00,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:52:00,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 62 [2025-03-04 05:52:00,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:52:00,928 INFO L225 Difference]: With dead ends: 2457 [2025-03-04 05:52:00,928 INFO L226 Difference]: Without dead ends: 1228 [2025-03-04 05:52:00,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:52:00,939 INFO L435 NwaCegarLoop]: 1644 mSDtfsCounter, 1628 mSDsluCounter, 1643 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1628 SdHoareTripleChecker+Valid, 3287 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-03-04 05:52:00,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1628 Valid, 3287 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:52:00,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2025-03-04 05:52:01,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1228. [2025-03-04 05:52:01,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 847 states have (on average 1.2798110979929163) internal successors, (1084), 895 states have internal predecessors, (1084), 278 states have call successors, (278), 78 states have call predecessors, (278), 77 states have return successors, (276), 274 states have call predecessors, (276), 276 states have call successors, (276) [2025-03-04 05:52:01,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 1638 transitions. [2025-03-04 05:52:01,035 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 1638 transitions. Word has length 62 [2025-03-04 05:52:01,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:52:01,036 INFO L471 AbstractCegarLoop]: Abstraction has 1228 states and 1638 transitions. [2025-03-04 05:52:01,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 05:52:01,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1638 transitions. [2025-03-04 05:52:01,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-04 05:52:01,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:52:01,040 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 05:52:01,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 05:52:01,040 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2025-03-04 05:52:01,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:52:01,041 INFO L85 PathProgramCache]: Analyzing trace with hash -783391565, now seen corresponding path program 1 times [2025-03-04 05:52:01,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:52:01,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687264084] [2025-03-04 05:52:01,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:52:01,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:52:01,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 05:52:01,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 05:52:01,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:52:01,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:52:02,025 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 05:52:02,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:52:02,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687264084] [2025-03-04 05:52:02,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687264084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:52:02,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:52:02,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:52:02,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980205868] [2025-03-04 05:52:02,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:52:02,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:52:02,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:52:02,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:52:02,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:52:02,028 INFO L87 Difference]: Start difference. First operand 1228 states and 1638 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 05:52:02,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:52:02,196 INFO L93 Difference]: Finished difference Result 1228 states and 1638 transitions. [2025-03-04 05:52:02,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:52:02,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (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 68 [2025-03-04 05:52:02,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:52:02,206 INFO L225 Difference]: With dead ends: 1228 [2025-03-04 05:52:02,206 INFO L226 Difference]: Without dead ends: 1226 [2025-03-04 05:52:02,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:52:02,207 INFO L435 NwaCegarLoop]: 1628 mSDtfsCounter, 1611 mSDsluCounter, 1627 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1611 SdHoareTripleChecker+Valid, 3255 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-03-04 05:52:02,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1611 Valid, 3255 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:52:02,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2025-03-04 05:52:02,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 1226. [2025-03-04 05:52:02,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 846 states have (on average 1.2789598108747045) internal successors, (1082), 893 states have internal predecessors, (1082), 278 states have call successors, (278), 78 states have call predecessors, (278), 77 states have return successors, (276), 274 states have call predecessors, (276), 276 states have call successors, (276) [2025-03-04 05:52:02,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1636 transitions. [2025-03-04 05:52:02,261 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1636 transitions. Word has length 68 [2025-03-04 05:52:02,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:52:02,261 INFO L471 AbstractCegarLoop]: Abstraction has 1226 states and 1636 transitions. [2025-03-04 05:52:02,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 05:52:02,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1636 transitions. [2025-03-04 05:52:02,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-04 05:52:02,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:52:02,265 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:52:02,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 05:52:02,266 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2025-03-04 05:52:02,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:52:02,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1772084575, now seen corresponding path program 1 times [2025-03-04 05:52:02,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:52:02,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778281515] [2025-03-04 05:52:02,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:52:02,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:52:02,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 05:52:03,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 05:52:03,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:52:03,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:52:03,889 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 05:52:03,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:52:03,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778281515] [2025-03-04 05:52:03,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778281515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:52:03,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:52:03,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 05:52:03,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790284491] [2025-03-04 05:52:03,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:52:03,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 05:52:03,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:52:03,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 05:52:03,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 05:52:03,890 INFO L87 Difference]: Start difference. First operand 1226 states and 1636 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 05:52:04,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:52:04,440 INFO L93 Difference]: Finished difference Result 2686 states and 3529 transitions. [2025-03-04 05:52:04,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 05:52:04,441 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 74 [2025-03-04 05:52:04,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:52:04,449 INFO L225 Difference]: With dead ends: 2686 [2025-03-04 05:52:04,449 INFO L226 Difference]: Without dead ends: 1469 [2025-03-04 05:52:04,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 05:52:04,453 INFO L435 NwaCegarLoop]: 1628 mSDtfsCounter, 271 mSDsluCounter, 6492 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 8120 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 05:52:04,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 8120 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 05:52:04,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2025-03-04 05:52:04,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1282. [2025-03-04 05:52:04,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 881 states have (on average 1.2701475595913734) internal successors, (1119), 930 states have internal predecessors, (1119), 290 states have call successors, (290), 86 states have call predecessors, (290), 86 states have return successors, (289), 285 states have call predecessors, (289), 288 states have call successors, (289) [2025-03-04 05:52:04,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1698 transitions. [2025-03-04 05:52:04,506 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1698 transitions. Word has length 74 [2025-03-04 05:52:04,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:52:04,507 INFO L471 AbstractCegarLoop]: Abstraction has 1282 states and 1698 transitions. [2025-03-04 05:52:04,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 05:52:04,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1698 transitions. [2025-03-04 05:52:04,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-04 05:52:04,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:52:04,508 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 05:52:04,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 05:52:04,509 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2025-03-04 05:52:04,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:52:04,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1966518330, now seen corresponding path program 1 times [2025-03-04 05:52:04,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:52:04,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406730700] [2025-03-04 05:52:04,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:52:04,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:52:05,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 05:52:05,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 05:52:05,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:52:05,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:52:05,252 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 05:52:05,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:52:05,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406730700] [2025-03-04 05:52:05,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406730700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:52:05,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:52:05,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:52:05,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971008976] [2025-03-04 05:52:05,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:52:05,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:52:05,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:52:05,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:52:05,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:52:05,254 INFO L87 Difference]: Start difference. First operand 1282 states and 1698 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 05:52:05,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:52:05,387 INFO L93 Difference]: Finished difference Result 1282 states and 1698 transitions. [2025-03-04 05:52:05,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:52:05,388 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (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 74 [2025-03-04 05:52:05,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:52:05,395 INFO L225 Difference]: With dead ends: 1282 [2025-03-04 05:52:05,395 INFO L226 Difference]: Without dead ends: 1280 [2025-03-04 05:52:05,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:52:05,396 INFO L435 NwaCegarLoop]: 1626 mSDtfsCounter, 1608 mSDsluCounter, 1625 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1608 SdHoareTripleChecker+Valid, 3251 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-03-04 05:52:05,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1608 Valid, 3251 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:52:05,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2025-03-04 05:52:05,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 1280. [2025-03-04 05:52:05,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 880 states have (on average 1.2693181818181818) internal successors, (1117), 928 states have internal predecessors, (1117), 290 states have call successors, (290), 86 states have call predecessors, (290), 86 states have return successors, (289), 285 states have call predecessors, (289), 288 states have call successors, (289) [2025-03-04 05:52:05,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1696 transitions. [2025-03-04 05:52:05,451 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1696 transitions. Word has length 74 [2025-03-04 05:52:05,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:52:05,451 INFO L471 AbstractCegarLoop]: Abstraction has 1280 states and 1696 transitions. [2025-03-04 05:52:05,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 05:52:05,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1696 transitions. [2025-03-04 05:52:05,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-04 05:52:05,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:52:05,452 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 05:52:05,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 05:52:05,452 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2025-03-04 05:52:05,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:52:05,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1674587215, now seen corresponding path program 1 times [2025-03-04 05:52:05,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:52:05,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413721383] [2025-03-04 05:52:05,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:52:05,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:52:05,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 05:52:05,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 05:52:05,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:52:05,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:52:06,268 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 05:52:06,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:52:06,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413721383] [2025-03-04 05:52:06,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413721383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:52:06,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:52:06,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:52:06,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975359192] [2025-03-04 05:52:06,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:52:06,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:52:06,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:52:06,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:52:06,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:52:06,270 INFO L87 Difference]: Start difference. First operand 1280 states and 1696 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 05:52:06,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:52:06,461 INFO L93 Difference]: Finished difference Result 1280 states and 1696 transitions. [2025-03-04 05:52:06,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:52:06,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (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 80 [2025-03-04 05:52:06,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:52:06,469 INFO L225 Difference]: With dead ends: 1280 [2025-03-04 05:52:06,470 INFO L226 Difference]: Without dead ends: 1278 [2025-03-04 05:52:06,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:52:06,471 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 1605 mSDsluCounter, 1623 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1605 SdHoareTripleChecker+Valid, 3247 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-03-04 05:52:06,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1605 Valid, 3247 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:52:06,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2025-03-04 05:52:06,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 1278. [2025-03-04 05:52:06,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1278 states, 879 states have (on average 1.2684869169510808) internal successors, (1115), 926 states have internal predecessors, (1115), 290 states have call successors, (290), 86 states have call predecessors, (290), 86 states have return successors, (289), 285 states have call predecessors, (289), 288 states have call successors, (289) [2025-03-04 05:52:06,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 1694 transitions. [2025-03-04 05:52:06,552 INFO L78 Accepts]: Start accepts. Automaton has 1278 states and 1694 transitions. Word has length 80 [2025-03-04 05:52:06,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:52:06,553 INFO L471 AbstractCegarLoop]: Abstraction has 1278 states and 1694 transitions. [2025-03-04 05:52:06,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 05:52:06,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 1694 transitions. [2025-03-04 05:52:06,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 05:52:06,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:52:06,554 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:52:06,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 05:52:06,555 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2025-03-04 05:52:06,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:52:06,555 INFO L85 PathProgramCache]: Analyzing trace with hash -63191186, now seen corresponding path program 1 times [2025-03-04 05:52:06,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:52:06,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47902548] [2025-03-04 05:52:06,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:52:06,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:52:07,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 05:52:07,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 05:52:07,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:52:07,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:52:07,410 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 05:52:07,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:52:07,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47902548] [2025-03-04 05:52:07,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47902548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:52:07,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:52:07,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:52:07,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472355638] [2025-03-04 05:52:07,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:52:07,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:52:07,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:52:07,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:52:07,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:52:07,413 INFO L87 Difference]: Start difference. First operand 1278 states and 1694 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 05:52:07,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:52:07,595 INFO L93 Difference]: Finished difference Result 1278 states and 1694 transitions. [2025-03-04 05:52:07,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:52:07,596 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (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 86 [2025-03-04 05:52:07,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:52:07,604 INFO L225 Difference]: With dead ends: 1278 [2025-03-04 05:52:07,604 INFO L226 Difference]: Without dead ends: 1276 [2025-03-04 05:52:07,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:52:07,606 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 1602 mSDsluCounter, 1621 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1602 SdHoareTripleChecker+Valid, 3243 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-03-04 05:52:07,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1602 Valid, 3243 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:52:07,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2025-03-04 05:52:07,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1276. [2025-03-04 05:52:07,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1276 states, 878 states have (on average 1.2676537585421412) internal successors, (1113), 924 states have internal predecessors, (1113), 290 states have call successors, (290), 86 states have call predecessors, (290), 86 states have return successors, (289), 285 states have call predecessors, (289), 288 states have call successors, (289) [2025-03-04 05:52:07,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1692 transitions. [2025-03-04 05:52:07,677 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1692 transitions. Word has length 86 [2025-03-04 05:52:07,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:52:07,677 INFO L471 AbstractCegarLoop]: Abstraction has 1276 states and 1692 transitions. [2025-03-04 05:52:07,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 05:52:07,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1692 transitions. [2025-03-04 05:52:07,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 05:52:07,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:52:07,679 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2025-03-04 05:52:07,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 05:52:07,679 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2025-03-04 05:52:07,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:52:07,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1811673724, now seen corresponding path program 1 times [2025-03-04 05:52:07,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:52:07,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192314778] [2025-03-04 05:52:07,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:52:07,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:52:08,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 05:52:08,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 05:52:08,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:52:08,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:52:08,715 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-04 05:52:08,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:52:08,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192314778] [2025-03-04 05:52:08,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192314778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:52:08,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:52:08,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 05:52:08,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084910656] [2025-03-04 05:52:08,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:52:08,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 05:52:08,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:52:08,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 05:52:08,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:52:08,716 INFO L87 Difference]: Start difference. First operand 1276 states and 1692 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 05:52:08,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:52:08,982 INFO L93 Difference]: Finished difference Result 1516 states and 1999 transitions. [2025-03-04 05:52:08,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 05:52:08,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 90 [2025-03-04 05:52:08,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:52:08,990 INFO L225 Difference]: With dead ends: 1516 [2025-03-04 05:52:08,990 INFO L226 Difference]: Without dead ends: 1514 [2025-03-04 05:52:08,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 05:52:08,992 INFO L435 NwaCegarLoop]: 1863 mSDtfsCounter, 933 mSDsluCounter, 4690 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 6553 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:52:08,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [934 Valid, 6553 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:52:08,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2025-03-04 05:52:09,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1510. [2025-03-04 05:52:09,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1510 states, 1040 states have (on average 1.271153846153846) internal successors, (1322), 1091 states have internal predecessors, (1322), 337 states have call successors, (337), 112 states have call predecessors, (337), 112 states have return successors, (336), 332 states have call predecessors, (336), 335 states have call successors, (336) [2025-03-04 05:52:09,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 1995 transitions. [2025-03-04 05:52:09,062 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 1995 transitions. Word has length 90 [2025-03-04 05:52:09,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:52:09,062 INFO L471 AbstractCegarLoop]: Abstraction has 1510 states and 1995 transitions. [2025-03-04 05:52:09,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 05:52:09,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 1995 transitions. [2025-03-04 05:52:09,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 05:52:09,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:52:09,064 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:52:09,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 05:52:09,064 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2025-03-04 05:52:09,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:52:09,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1174429238, now seen corresponding path program 1 times [2025-03-04 05:52:09,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:52:09,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182359583] [2025-03-04 05:52:09,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:52:09,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:52:09,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 05:52:09,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 05:52:09,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:52:09,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:52:09,847 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 05:52:09,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:52:09,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182359583] [2025-03-04 05:52:09,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182359583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:52:09,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:52:09,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:52:09,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680946096] [2025-03-04 05:52:09,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:52:09,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:52:09,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:52:09,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:52:09,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:52:09,849 INFO L87 Difference]: Start difference. First operand 1510 states and 1995 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 05:52:10,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:52:10,028 INFO L93 Difference]: Finished difference Result 1510 states and 1995 transitions. [2025-03-04 05:52:10,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:52:10,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (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 92 [2025-03-04 05:52:10,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:52:10,037 INFO L225 Difference]: With dead ends: 1510 [2025-03-04 05:52:10,037 INFO L226 Difference]: Without dead ends: 1508 [2025-03-04 05:52:10,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:52:10,039 INFO L435 NwaCegarLoop]: 1618 mSDtfsCounter, 1597 mSDsluCounter, 1617 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1597 SdHoareTripleChecker+Valid, 3235 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-03-04 05:52:10,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1597 Valid, 3235 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:52:10,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2025-03-04 05:52:10,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1508. [2025-03-04 05:52:10,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1508 states, 1039 states have (on average 1.2704523580365736) internal successors, (1320), 1089 states have internal predecessors, (1320), 337 states have call successors, (337), 112 states have call predecessors, (337), 112 states have return successors, (336), 332 states have call predecessors, (336), 335 states have call successors, (336) [2025-03-04 05:52:10,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 1993 transitions. [2025-03-04 05:52:10,116 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 1993 transitions. Word has length 92 [2025-03-04 05:52:10,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:52:10,116 INFO L471 AbstractCegarLoop]: Abstraction has 1508 states and 1993 transitions. [2025-03-04 05:52:10,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 05:52:10,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 1993 transitions. [2025-03-04 05:52:10,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-04 05:52:10,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:52:10,119 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:52:10,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 05:52:10,119 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2025-03-04 05:52:10,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:52:10,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1618009437, now seen corresponding path program 1 times [2025-03-04 05:52:10,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:52:10,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423150743] [2025-03-04 05:52:10,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:52:10,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:52:10,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 05:52:10,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 05:52:10,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:52:10,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:52:11,011 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 05:52:11,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:52:11,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423150743] [2025-03-04 05:52:11,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423150743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:52:11,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:52:11,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:52:11,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443892060] [2025-03-04 05:52:11,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:52:11,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:52:11,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:52:11,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:52:11,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:52:11,012 INFO L87 Difference]: Start difference. First operand 1508 states and 1993 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 05:52:11,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:52:11,179 INFO L93 Difference]: Finished difference Result 1508 states and 1993 transitions. [2025-03-04 05:52:11,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:52:11,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (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 98 [2025-03-04 05:52:11,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:52:11,188 INFO L225 Difference]: With dead ends: 1508 [2025-03-04 05:52:11,188 INFO L226 Difference]: Without dead ends: 1506 [2025-03-04 05:52:11,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:52:11,191 INFO L435 NwaCegarLoop]: 1616 mSDtfsCounter, 1594 mSDsluCounter, 1615 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1594 SdHoareTripleChecker+Valid, 3231 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-03-04 05:52:11,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1594 Valid, 3231 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:52:11,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2025-03-04 05:52:11,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2025-03-04 05:52:11,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1038 states have (on average 1.2697495183044316) internal successors, (1318), 1087 states have internal predecessors, (1318), 337 states have call successors, (337), 112 states have call predecessors, (337), 112 states have return successors, (336), 332 states have call predecessors, (336), 335 states have call successors, (336) [2025-03-04 05:52:11,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 1991 transitions. [2025-03-04 05:52:11,261 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 1991 transitions. Word has length 98 [2025-03-04 05:52:11,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:52:11,262 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 1991 transitions. [2025-03-04 05:52:11,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 05:52:11,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 1991 transitions. [2025-03-04 05:52:11,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 05:52:11,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:52:11,265 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:52:11,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 05:52:11,266 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_check_alloc_flagsErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2025-03-04 05:52:11,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:52:11,266 INFO L85 PathProgramCache]: Analyzing trace with hash 333632598, now seen corresponding path program 1 times [2025-03-04 05:52:11,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:52:11,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283186341] [2025-03-04 05:52:11,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:52:11,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:52:11,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 05:52:11,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 05:52:11,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:52:11,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:52:12,855 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-04 05:52:12,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:52:12,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283186341] [2025-03-04 05:52:12,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283186341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:52:12,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:52:12,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 05:52:12,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986825465] [2025-03-04 05:52:12,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:52:12,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 05:52:12,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:52:12,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 05:52:12,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 05:52:12,858 INFO L87 Difference]: Start difference. First operand 1506 states and 1991 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 05:52:16,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 05:52:21,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:52:21,021 INFO L93 Difference]: Finished difference Result 2935 states and 3901 transitions. [2025-03-04 05:52:21,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 05:52:21,022 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 99 [2025-03-04 05:52:21,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:52:21,030 INFO L225 Difference]: With dead ends: 2935 [2025-03-04 05:52:21,030 INFO L226 Difference]: Without dead ends: 1506 [2025-03-04 05:52:21,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 05:52:21,035 INFO L435 NwaCegarLoop]: 1614 mSDtfsCounter, 1588 mSDsluCounter, 4279 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1589 SdHoareTripleChecker+Valid, 5893 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2025-03-04 05:52:21,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1589 Valid, 5893 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 594 Invalid, 1 Unknown, 0 Unchecked, 7.8s Time] [2025-03-04 05:52:21,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2025-03-04 05:52:21,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2025-03-04 05:52:21,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1038 states have (on average 1.2678227360308285) internal successors, (1316), 1087 states have internal predecessors, (1316), 337 states have call successors, (337), 112 states have call predecessors, (337), 112 states have return successors, (336), 332 states have call predecessors, (336), 335 states have call successors, (336) [2025-03-04 05:52:21,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 1989 transitions. [2025-03-04 05:52:21,108 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 1989 transitions. Word has length 99 [2025-03-04 05:52:21,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:52:21,108 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 1989 transitions. [2025-03-04 05:52:21,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 05:52:21,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 1989 transitions. [2025-03-04 05:52:21,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 05:52:21,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:52:21,111 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:52:21,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 05:52:21,112 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_check_alloc_flagsErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2025-03-04 05:52:21,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:52:21,112 INFO L85 PathProgramCache]: Analyzing trace with hash 333662389, now seen corresponding path program 1 times [2025-03-04 05:52:21,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:52:21,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218246884] [2025-03-04 05:52:21,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:52:21,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:52:21,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 05:52:21,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 05:52:21,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:52:21,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:52:22,004 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-04 05:52:22,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:52:22,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218246884] [2025-03-04 05:52:22,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218246884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:52:22,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:52:22,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:52:22,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380924806] [2025-03-04 05:52:22,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:52:22,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:52:22,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:52:22,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:52:22,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:52:22,006 INFO L87 Difference]: Start difference. First operand 1506 states and 1989 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 05:52:22,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:52:22,198 INFO L93 Difference]: Finished difference Result 1506 states and 1989 transitions. [2025-03-04 05:52:22,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:52:22,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 99 [2025-03-04 05:52:22,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:52:22,206 INFO L225 Difference]: With dead ends: 1506 [2025-03-04 05:52:22,206 INFO L226 Difference]: Without dead ends: 1504 [2025-03-04 05:52:22,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:52:22,208 INFO L435 NwaCegarLoop]: 1613 mSDtfsCounter, 0 mSDsluCounter, 3222 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4835 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:52:22,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4835 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:52:22,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2025-03-04 05:52:22,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1504. [2025-03-04 05:52:22,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1504 states, 1037 states have (on average 1.266152362584378) internal successors, (1313), 1085 states have internal predecessors, (1313), 337 states have call successors, (337), 112 states have call predecessors, (337), 112 states have return successors, (336), 332 states have call predecessors, (336), 335 states have call successors, (336) [2025-03-04 05:52:22,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 1986 transitions. [2025-03-04 05:52:22,292 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 1986 transitions. Word has length 99 [2025-03-04 05:52:22,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:52:22,292 INFO L471 AbstractCegarLoop]: Abstraction has 1504 states and 1986 transitions. [2025-03-04 05:52:22,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 05:52:22,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 1986 transitions. [2025-03-04 05:52:22,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 05:52:22,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:52:22,294 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:52:22,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 05:52:22,294 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2025-03-04 05:52:22,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:52:22,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1849663054, now seen corresponding path program 1 times [2025-03-04 05:52:22,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:52:22,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503720055] [2025-03-04 05:52:22,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:52:22,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:52:22,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 05:52:22,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 05:52:22,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:52:22,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:52:23,057 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-04 05:52:23,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:52:23,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503720055] [2025-03-04 05:52:23,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503720055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:52:23,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:52:23,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 05:52:23,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699985735] [2025-03-04 05:52:23,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:52:23,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 05:52:23,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:52:23,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 05:52:23,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 05:52:23,059 INFO L87 Difference]: Start difference. First operand 1504 states and 1986 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 05:52:23,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:52:23,176 INFO L93 Difference]: Finished difference Result 2925 states and 3884 transitions. [2025-03-04 05:52:23,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 05:52:23,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 103 [2025-03-04 05:52:23,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:52:23,185 INFO L225 Difference]: With dead ends: 2925 [2025-03-04 05:52:23,185 INFO L226 Difference]: Without dead ends: 1498 [2025-03-04 05:52:23,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 05:52:23,191 INFO L435 NwaCegarLoop]: 1609 mSDtfsCounter, 1577 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1577 SdHoareTripleChecker+Valid, 1609 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 05:52:23,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1577 Valid, 1609 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 05:52:23,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2025-03-04 05:52:23,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1498. [2025-03-04 05:52:23,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1498 states, 1032 states have (on average 1.2635658914728682) internal successors, (1304), 1079 states have internal predecessors, (1304), 337 states have call successors, (337), 112 states have call predecessors, (337), 112 states have return successors, (336), 332 states have call predecessors, (336), 335 states have call successors, (336) [2025-03-04 05:52:23,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1498 states and 1977 transitions. [2025-03-04 05:52:23,265 INFO L78 Accepts]: Start accepts. Automaton has 1498 states and 1977 transitions. Word has length 103 [2025-03-04 05:52:23,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:52:23,265 INFO L471 AbstractCegarLoop]: Abstraction has 1498 states and 1977 transitions. [2025-03-04 05:52:23,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 05:52:23,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 1977 transitions. [2025-03-04 05:52:23,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 05:52:23,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:52:23,267 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:52:23,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 05:52:23,267 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2025-03-04 05:52:23,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:52:23,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1819791676, now seen corresponding path program 1 times [2025-03-04 05:52:23,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:52:23,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361219982] [2025-03-04 05:52:23,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:52:23,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:52:23,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 05:52:23,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 05:52:23,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:52:23,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:52:24,068 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 05:52:24,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:52:24,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361219982] [2025-03-04 05:52:24,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361219982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:52:24,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:52:24,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:52:24,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434343376] [2025-03-04 05:52:24,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:52:24,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:52:24,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:52:24,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:52:24,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:52:24,070 INFO L87 Difference]: Start difference. First operand 1498 states and 1977 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 05:52:24,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:52:24,295 INFO L93 Difference]: Finished difference Result 1498 states and 1977 transitions. [2025-03-04 05:52:24,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:52:24,296 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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 104 [2025-03-04 05:52:24,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:52:24,303 INFO L225 Difference]: With dead ends: 1498 [2025-03-04 05:52:24,303 INFO L226 Difference]: Without dead ends: 1496 [2025-03-04 05:52:24,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:52:24,304 INFO L435 NwaCegarLoop]: 1606 mSDtfsCounter, 1583 mSDsluCounter, 1605 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1583 SdHoareTripleChecker+Valid, 3211 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-03-04 05:52:24,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1583 Valid, 3211 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:52:24,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2025-03-04 05:52:24,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1496. [2025-03-04 05:52:24,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1496 states, 1031 states have (on average 1.2628516003879728) internal successors, (1302), 1077 states have internal predecessors, (1302), 337 states have call successors, (337), 112 states have call predecessors, (337), 112 states have return successors, (336), 332 states have call predecessors, (336), 335 states have call successors, (336) [2025-03-04 05:52:24,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1975 transitions. [2025-03-04 05:52:24,434 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 1975 transitions. Word has length 104 [2025-03-04 05:52:24,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:52:24,436 INFO L471 AbstractCegarLoop]: Abstraction has 1496 states and 1975 transitions. [2025-03-04 05:52:24,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 05:52:24,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 1975 transitions. [2025-03-04 05:52:24,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-04 05:52:24,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:52:24,438 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:52:24,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 05:52:24,438 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2025-03-04 05:52:24,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:52:24,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1376765385, now seen corresponding path program 1 times [2025-03-04 05:52:24,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:52:24,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441955259] [2025-03-04 05:52:24,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:52:24,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:52:24,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 05:52:25,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 05:52:25,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:52:25,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:52:25,482 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-04 05:52:25,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:52:25,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441955259] [2025-03-04 05:52:25,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441955259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:52:25,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:52:25,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 05:52:25,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128253198] [2025-03-04 05:52:25,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:52:25,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 05:52:25,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:52:25,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 05:52:25,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:52:25,484 INFO L87 Difference]: Start difference. First operand 1496 states and 1975 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 05:52:29,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 05:52:29,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:52:29,883 INFO L93 Difference]: Finished difference Result 1496 states and 1975 transitions. [2025-03-04 05:52:29,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 05:52:29,884 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 108 [2025-03-04 05:52:29,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:52:29,892 INFO L225 Difference]: With dead ends: 1496 [2025-03-04 05:52:29,892 INFO L226 Difference]: Without dead ends: 1494 [2025-03-04 05:52:29,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 05:52:29,893 INFO L435 NwaCegarLoop]: 1657 mSDtfsCounter, 959 mSDsluCounter, 4253 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 960 SdHoareTripleChecker+Valid, 5910 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-04 05:52:29,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [960 Valid, 5910 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-04 05:52:29,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2025-03-04 05:52:29,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1494. [2025-03-04 05:52:29,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1494 states, 1030 states have (on average 1.2621359223300972) internal successors, (1300), 1075 states have internal predecessors, (1300), 337 states have call successors, (337), 112 states have call predecessors, (337), 112 states have return successors, (336), 332 states have call predecessors, (336), 335 states have call successors, (336) [2025-03-04 05:52:29,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 1973 transitions. [2025-03-04 05:52:29,972 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 1973 transitions. Word has length 108 [2025-03-04 05:52:29,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:52:29,972 INFO L471 AbstractCegarLoop]: Abstraction has 1494 states and 1973 transitions. [2025-03-04 05:52:29,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 05:52:29,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 1973 transitions. [2025-03-04 05:52:29,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 05:52:29,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:52:29,975 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:52:29,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 05:52:29,975 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2025-03-04 05:52:29,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:52:29,975 INFO L85 PathProgramCache]: Analyzing trace with hash -768053185, now seen corresponding path program 1 times [2025-03-04 05:52:29,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:52:29,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548755084] [2025-03-04 05:52:29,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:52:29,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:52:30,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 05:52:30,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 05:52:30,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:52:30,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:52:30,766 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 05:52:30,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:52:30,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548755084] [2025-03-04 05:52:30,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548755084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:52:30,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:52:30,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:52:30,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697192373] [2025-03-04 05:52:30,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:52:30,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:52:30,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:52:30,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:52:30,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:52:30,768 INFO L87 Difference]: Start difference. First operand 1494 states and 1973 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 05:52:30,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:52:30,984 INFO L93 Difference]: Finished difference Result 1494 states and 1973 transitions. [2025-03-04 05:52:30,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:52:30,984 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, (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 106 [2025-03-04 05:52:30,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:52:30,990 INFO L225 Difference]: With dead ends: 1494 [2025-03-04 05:52:30,990 INFO L226 Difference]: Without dead ends: 1492 [2025-03-04 05:52:30,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:52:30,991 INFO L435 NwaCegarLoop]: 1602 mSDtfsCounter, 1577 mSDsluCounter, 1601 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1577 SdHoareTripleChecker+Valid, 3203 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-03-04 05:52:30,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1577 Valid, 3203 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:52:30,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2025-03-04 05:52:31,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 1492. [2025-03-04 05:52:31,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1492 states, 1029 states have (on average 1.261418853255588) internal successors, (1298), 1073 states have internal predecessors, (1298), 337 states have call successors, (337), 112 states have call predecessors, (337), 112 states have return successors, (336), 332 states have call predecessors, (336), 335 states have call successors, (336) [2025-03-04 05:52:31,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 1971 transitions. [2025-03-04 05:52:31,068 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 1971 transitions. Word has length 106 [2025-03-04 05:52:31,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:52:31,068 INFO L471 AbstractCegarLoop]: Abstraction has 1492 states and 1971 transitions. [2025-03-04 05:52:31,068 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 05:52:31,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 1971 transitions. [2025-03-04 05:52:31,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-04 05:52:31,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:52:31,070 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:52:31,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 05:52:31,070 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2025-03-04 05:52:31,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:52:31,071 INFO L85 PathProgramCache]: Analyzing trace with hash -491242453, now seen corresponding path program 1 times [2025-03-04 05:52:31,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:52:31,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524307609] [2025-03-04 05:52:31,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:52:31,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:52:31,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-04 05:52:31,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 05:52:31,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:52:31,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:52:32,043 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 05:52:32,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:52:32,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524307609] [2025-03-04 05:52:32,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524307609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:52:32,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:52:32,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:52:32,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244131495] [2025-03-04 05:52:32,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:52:32,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:52:32,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:52:32,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:52:32,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:52:32,047 INFO L87 Difference]: Start difference. First operand 1492 states and 1971 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 05:52:32,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:52:32,305 INFO L93 Difference]: Finished difference Result 1492 states and 1971 transitions. [2025-03-04 05:52:32,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:52:32,306 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (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 112 [2025-03-04 05:52:32,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:52:32,313 INFO L225 Difference]: With dead ends: 1492 [2025-03-04 05:52:32,313 INFO L226 Difference]: Without dead ends: 1490 [2025-03-04 05:52:32,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:52:32,314 INFO L435 NwaCegarLoop]: 1600 mSDtfsCounter, 1576 mSDsluCounter, 1599 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1576 SdHoareTripleChecker+Valid, 3199 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-03-04 05:52:32,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1576 Valid, 3199 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:52:32,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2025-03-04 05:52:32,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1490. [2025-03-04 05:52:32,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1490 states, 1028 states have (on average 1.2607003891050583) internal successors, (1296), 1071 states have internal predecessors, (1296), 337 states have call successors, (337), 112 states have call predecessors, (337), 112 states have return successors, (336), 332 states have call predecessors, (336), 335 states have call successors, (336) [2025-03-04 05:52:32,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 1969 transitions. [2025-03-04 05:52:32,457 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 1969 transitions. Word has length 112 [2025-03-04 05:52:32,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:52:32,457 INFO L471 AbstractCegarLoop]: Abstraction has 1490 states and 1969 transitions. [2025-03-04 05:52:32,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 05:52:32,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 1969 transitions. [2025-03-04 05:52:32,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 05:52:32,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:52:32,460 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:52:32,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 05:52:32,460 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, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2025-03-04 05:52:32,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:52:32,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1187821304, now seen corresponding path program 1 times [2025-03-04 05:52:32,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:52:32,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637803429] [2025-03-04 05:52:32,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:52:32,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:52:33,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 05:52:33,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 05:52:33,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:52:33,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:52:33,302 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 05:52:33,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:52:33,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637803429] [2025-03-04 05:52:33,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637803429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:52:33,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:52:33,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:52:33,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113947100] [2025-03-04 05:52:33,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:52:33,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:52:33,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:52:33,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:52:33,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:52:33,304 INFO L87 Difference]: Start difference. First operand 1490 states and 1969 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 05:52:33,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:52:33,496 INFO L93 Difference]: Finished difference Result 1490 states and 1969 transitions. [2025-03-04 05:52:33,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:52:33,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (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 118 [2025-03-04 05:52:33,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:52:33,503 INFO L225 Difference]: With dead ends: 1490 [2025-03-04 05:52:33,503 INFO L226 Difference]: Without dead ends: 1488 [2025-03-04 05:52:33,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:52:33,504 INFO L435 NwaCegarLoop]: 1598 mSDtfsCounter, 1573 mSDsluCounter, 1597 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1573 SdHoareTripleChecker+Valid, 3195 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-03-04 05:52:33,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1573 Valid, 3195 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:52:33,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2025-03-04 05:52:33,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1488. [2025-03-04 05:52:33,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1488 states, 1027 states have (on average 1.2599805258033105) internal successors, (1294), 1069 states have internal predecessors, (1294), 337 states have call successors, (337), 112 states have call predecessors, (337), 112 states have return successors, (336), 332 states have call predecessors, (336), 335 states have call successors, (336) [2025-03-04 05:52:33,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 1967 transitions. [2025-03-04 05:52:33,601 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 1967 transitions. Word has length 118 [2025-03-04 05:52:33,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:52:33,601 INFO L471 AbstractCegarLoop]: Abstraction has 1488 states and 1967 transitions. [2025-03-04 05:52:33,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 05:52:33,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 1967 transitions. [2025-03-04 05:52:33,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 05:52:33,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:52:33,603 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:52:33,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 05:52:33,604 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, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2025-03-04 05:52:33,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:52:33,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1720698200, now seen corresponding path program 1 times [2025-03-04 05:52:33,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:52:33,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742931042] [2025-03-04 05:52:33,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:52:33,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:52:34,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 05:52:34,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 05:52:34,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:52:34,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:52:34,319 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 05:52:34,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:52:34,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742931042] [2025-03-04 05:52:34,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742931042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:52:34,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:52:34,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:52:34,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726175027] [2025-03-04 05:52:34,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:52:34,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:52:34,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:52:34,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:52:34,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:52:34,321 INFO L87 Difference]: Start difference. First operand 1488 states and 1967 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 05:52:34,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:52:34,512 INFO L93 Difference]: Finished difference Result 1488 states and 1967 transitions. [2025-03-04 05:52:34,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:52:34,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (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 124 [2025-03-04 05:52:34,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:52:34,519 INFO L225 Difference]: With dead ends: 1488 [2025-03-04 05:52:34,519 INFO L226 Difference]: Without dead ends: 1486 [2025-03-04 05:52:34,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:52:34,520 INFO L435 NwaCegarLoop]: 1596 mSDtfsCounter, 1570 mSDsluCounter, 1595 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1570 SdHoareTripleChecker+Valid, 3191 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-03-04 05:52:34,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1570 Valid, 3191 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:52:34,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2025-03-04 05:52:34,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1486. [2025-03-04 05:52:34,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1486 states, 1026 states have (on average 1.2592592592592593) internal successors, (1292), 1067 states have internal predecessors, (1292), 337 states have call successors, (337), 112 states have call predecessors, (337), 112 states have return successors, (336), 332 states have call predecessors, (336), 335 states have call successors, (336) [2025-03-04 05:52:34,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 1965 transitions. [2025-03-04 05:52:34,600 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 1965 transitions. Word has length 124 [2025-03-04 05:52:34,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:52:34,601 INFO L471 AbstractCegarLoop]: Abstraction has 1486 states and 1965 transitions. [2025-03-04 05:52:34,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 05:52:34,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 1965 transitions. [2025-03-04 05:52:34,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 05:52:34,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:52:34,604 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:52:34,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 05:52:34,604 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, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2025-03-04 05:52:34,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:52:34,605 INFO L85 PathProgramCache]: Analyzing trace with hash -303413638, now seen corresponding path program 1 times [2025-03-04 05:52:34,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:52:34,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647943474] [2025-03-04 05:52:34,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:52:34,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:52:35,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 05:52:35,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 05:52:35,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:52:35,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:52:35,425 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 05:52:35,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:52:35,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647943474] [2025-03-04 05:52:35,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647943474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:52:35,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:52:35,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:52:35,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769682742] [2025-03-04 05:52:35,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:52:35,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:52:35,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:52:35,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:52:35,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:52:35,427 INFO L87 Difference]: Start difference. First operand 1486 states and 1965 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 05:52:35,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:52:35,704 INFO L93 Difference]: Finished difference Result 1486 states and 1965 transitions. [2025-03-04 05:52:35,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:52:35,704 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (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 130 [2025-03-04 05:52:35,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:52:35,711 INFO L225 Difference]: With dead ends: 1486 [2025-03-04 05:52:35,711 INFO L226 Difference]: Without dead ends: 1484 [2025-03-04 05:52:35,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:52:35,712 INFO L435 NwaCegarLoop]: 1594 mSDtfsCounter, 1567 mSDsluCounter, 1593 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1567 SdHoareTripleChecker+Valid, 3187 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-03-04 05:52:35,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1567 Valid, 3187 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:52:35,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2025-03-04 05:52:35,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 1484. [2025-03-04 05:52:35,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1484 states, 1025 states have (on average 1.2585365853658537) internal successors, (1290), 1065 states have internal predecessors, (1290), 337 states have call successors, (337), 112 states have call predecessors, (337), 112 states have return successors, (336), 332 states have call predecessors, (336), 335 states have call successors, (336) [2025-03-04 05:52:35,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 1484 states and 1963 transitions. [2025-03-04 05:52:35,817 INFO L78 Accepts]: Start accepts. Automaton has 1484 states and 1963 transitions. Word has length 130 [2025-03-04 05:52:35,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:52:35,818 INFO L471 AbstractCegarLoop]: Abstraction has 1484 states and 1963 transitions. [2025-03-04 05:52:35,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 05:52:35,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 1963 transitions. [2025-03-04 05:52:35,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-04 05:52:35,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:52:35,820 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:52:35,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 05:52:35,820 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, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2025-03-04 05:52:35,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:52:35,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1007121419, now seen corresponding path program 1 times [2025-03-04 05:52:35,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:52:35,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033428452] [2025-03-04 05:52:35,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:52:35,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:52:36,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 05:52:36,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 05:52:36,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:52:36,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:52:36,505 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 05:52:36,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:52:36,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033428452] [2025-03-04 05:52:36,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033428452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:52:36,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:52:36,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:52:36,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286682163] [2025-03-04 05:52:36,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:52:36,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:52:36,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:52:36,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:52:36,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:52:36,506 INFO L87 Difference]: Start difference. First operand 1484 states and 1963 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 05:52:36,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:52:36,698 INFO L93 Difference]: Finished difference Result 1484 states and 1963 transitions. [2025-03-04 05:52:36,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:52:36,699 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (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 136 [2025-03-04 05:52:36,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:52:36,708 INFO L225 Difference]: With dead ends: 1484 [2025-03-04 05:52:36,708 INFO L226 Difference]: Without dead ends: 1482 [2025-03-04 05:52:36,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:52:36,709 INFO L435 NwaCegarLoop]: 1592 mSDtfsCounter, 1564 mSDsluCounter, 1591 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1564 SdHoareTripleChecker+Valid, 3183 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-03-04 05:52:36,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1564 Valid, 3183 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:52:36,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2025-03-04 05:52:36,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1482. [2025-03-04 05:52:36,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 1024 states have (on average 1.2578125) internal successors, (1288), 1063 states have internal predecessors, (1288), 337 states have call successors, (337), 112 states have call predecessors, (337), 112 states have return successors, (336), 332 states have call predecessors, (336), 335 states have call successors, (336) [2025-03-04 05:52:36,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 1961 transitions. [2025-03-04 05:52:36,795 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 1961 transitions. Word has length 136 [2025-03-04 05:52:36,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:52:36,795 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 1961 transitions. [2025-03-04 05:52:36,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 05:52:36,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 1961 transitions. [2025-03-04 05:52:36,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-04 05:52:36,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:52:36,798 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:52:36,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 05:52:36,799 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2025-03-04 05:52:36,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:52:36,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1255310717, now seen corresponding path program 1 times [2025-03-04 05:52:36,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:52:36,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176358131] [2025-03-04 05:52:36,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:52:36,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:52:37,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-04 05:52:37,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-04 05:52:37,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:52:37,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:52:37,557 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 05:52:37,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:52:37,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176358131] [2025-03-04 05:52:37,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176358131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:52:37,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:52:37,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:52:37,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629595137] [2025-03-04 05:52:37,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:52:37,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:52:37,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:52:37,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:52:37,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:52:37,559 INFO L87 Difference]: Start difference. First operand 1482 states and 1961 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-04 05:52:37,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:52:37,781 INFO L93 Difference]: Finished difference Result 1482 states and 1961 transitions. [2025-03-04 05:52:37,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:52:37,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (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 142 [2025-03-04 05:52:37,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:52:37,788 INFO L225 Difference]: With dead ends: 1482 [2025-03-04 05:52:37,788 INFO L226 Difference]: Without dead ends: 1480 [2025-03-04 05:52:37,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:52:37,789 INFO L435 NwaCegarLoop]: 1590 mSDtfsCounter, 1561 mSDsluCounter, 1589 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1561 SdHoareTripleChecker+Valid, 3179 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-03-04 05:52:37,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1561 Valid, 3179 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:52:37,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2025-03-04 05:52:37,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1480. [2025-03-04 05:52:37,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1480 states, 1023 states have (on average 1.2570869990224829) internal successors, (1286), 1061 states have internal predecessors, (1286), 337 states have call successors, (337), 112 states have call predecessors, (337), 112 states have return successors, (336), 332 states have call predecessors, (336), 335 states have call successors, (336) [2025-03-04 05:52:37,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 1959 transitions. [2025-03-04 05:52:37,878 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 1959 transitions. Word has length 142 [2025-03-04 05:52:37,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:52:37,879 INFO L471 AbstractCegarLoop]: Abstraction has 1480 states and 1959 transitions. [2025-03-04 05:52:37,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-04 05:52:37,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 1959 transitions. [2025-03-04 05:52:37,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-04 05:52:37,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:52:37,882 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:52:37,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 05:52:37,882 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting sm_cache_flushErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2025-03-04 05:52:37,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:52:37,882 INFO L85 PathProgramCache]: Analyzing trace with hash 945661802, now seen corresponding path program 1 times [2025-03-04 05:52:37,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:52:37,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795586106] [2025-03-04 05:52:37,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:52:37,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:52:38,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-04 05:52:38,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-04 05:52:38,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:52:38,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:52:38,681 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-03-04 05:52:38,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:52:38,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795586106] [2025-03-04 05:52:38,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795586106] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:52:38,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:52:38,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 05:52:38,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102602644] [2025-03-04 05:52:38,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:52:38,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 05:52:38,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:52:38,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 05:52:38,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:52:38,682 INFO L87 Difference]: Start difference. First operand 1480 states and 1959 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-04 05:52:38,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:52:38,977 INFO L93 Difference]: Finished difference Result 2889 states and 3842 transitions. [2025-03-04 05:52:38,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 05:52:38,979 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) Word has length 149 [2025-03-04 05:52:38,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:52:38,985 INFO L225 Difference]: With dead ends: 2889 [2025-03-04 05:52:38,985 INFO L226 Difference]: Without dead ends: 1486 [2025-03-04 05:52:38,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:52:38,995 INFO L435 NwaCegarLoop]: 1590 mSDtfsCounter, 0 mSDsluCounter, 4762 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6352 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 05:52:38,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6352 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 05:52:38,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2025-03-04 05:52:39,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1484. [2025-03-04 05:52:39,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1484 states, 1026 states have (on average 1.256335282651072) internal successors, (1289), 1064 states have internal predecessors, (1289), 337 states have call successors, (337), 112 states have call predecessors, (337), 113 states have return successors, (341), 333 states have call predecessors, (341), 335 states have call successors, (341) [2025-03-04 05:52:39,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 1484 states and 1967 transitions. [2025-03-04 05:52:39,089 INFO L78 Accepts]: Start accepts. Automaton has 1484 states and 1967 transitions. Word has length 149 [2025-03-04 05:52:39,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:52:39,089 INFO L471 AbstractCegarLoop]: Abstraction has 1484 states and 1967 transitions. [2025-03-04 05:52:39,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-04 05:52:39,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 1967 transitions. [2025-03-04 05:52:39,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-04 05:52:39,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:52:39,092 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:52:39,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 05:52:39,092 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2025-03-04 05:52:39,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:52:39,093 INFO L85 PathProgramCache]: Analyzing trace with hash -854677433, now seen corresponding path program 1 times [2025-03-04 05:52:39,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:52:39,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603492053] [2025-03-04 05:52:39,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:52:39,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:52:39,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 05:52:39,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 05:52:39,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:52:39,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:52:39,935 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 05:52:39,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:52:39,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603492053] [2025-03-04 05:52:39,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603492053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:52:39,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:52:39,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:52:39,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531891888] [2025-03-04 05:52:39,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:52:39,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:52:39,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:52:39,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:52:39,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:52:39,936 INFO L87 Difference]: Start difference. First operand 1484 states and 1967 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 05:52:40,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:52:40,137 INFO L93 Difference]: Finished difference Result 1484 states and 1967 transitions. [2025-03-04 05:52:40,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:52:40,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 148 [2025-03-04 05:52:40,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:52:40,144 INFO L225 Difference]: With dead ends: 1484 [2025-03-04 05:52:40,144 INFO L226 Difference]: Without dead ends: 1482 [2025-03-04 05:52:40,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:52:40,145 INFO L435 NwaCegarLoop]: 1588 mSDtfsCounter, 1558 mSDsluCounter, 1587 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1558 SdHoareTripleChecker+Valid, 3175 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-03-04 05:52:40,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1558 Valid, 3175 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:52:40,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2025-03-04 05:52:40,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1482. [2025-03-04 05:52:40,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 1025 states have (on average 1.255609756097561) internal successors, (1287), 1062 states have internal predecessors, (1287), 337 states have call successors, (337), 112 states have call predecessors, (337), 113 states have return successors, (341), 333 states have call predecessors, (341), 335 states have call successors, (341) [2025-03-04 05:52:40,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 1965 transitions. [2025-03-04 05:52:40,239 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 1965 transitions. Word has length 148 [2025-03-04 05:52:40,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:52:40,239 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 1965 transitions. [2025-03-04 05:52:40,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 05:52:40,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 1965 transitions. [2025-03-04 05:52:40,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 05:52:40,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:52:40,242 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:52:40,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 05:52:40,242 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting sm_cache_flushErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2025-03-04 05:52:40,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:52:40,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1639072151, now seen corresponding path program 1 times [2025-03-04 05:52:40,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:52:40,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222901423] [2025-03-04 05:52:40,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:52:40,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:52:40,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 05:52:40,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 05:52:40,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:52:40,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:52:41,085 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-03-04 05:52:41,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:52:41,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222901423] [2025-03-04 05:52:41,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222901423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:52:41,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:52:41,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:52:41,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62870250] [2025-03-04 05:52:41,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:52:41,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:52:41,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:52:41,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:52:41,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:52:41,086 INFO L87 Difference]: Start difference. First operand 1482 states and 1965 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (24), 1 states have call predecessors, (24), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 05:52:41,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:52:41,435 INFO L93 Difference]: Finished difference Result 2896 states and 3889 transitions. [2025-03-04 05:52:41,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 05:52:41,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (24), 1 states have call predecessors, (24), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 153 [2025-03-04 05:52:41,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:52:41,447 INFO L225 Difference]: With dead ends: 2896 [2025-03-04 05:52:41,447 INFO L226 Difference]: Without dead ends: 1489 [2025-03-04 05:52:41,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:52:41,454 INFO L435 NwaCegarLoop]: 1586 mSDtfsCounter, 4 mSDsluCounter, 3164 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4750 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 05:52:41,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4750 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 05:52:41,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1489 states. [2025-03-04 05:52:41,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1489 to 1488. [2025-03-04 05:52:41,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1488 states, 1030 states have (on average 1.2563106796116505) internal successors, (1294), 1067 states have internal predecessors, (1294), 337 states have call successors, (337), 113 states have call predecessors, (337), 114 states have return successors, (342), 333 states have call predecessors, (342), 335 states have call successors, (342) [2025-03-04 05:52:41,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 1973 transitions. [2025-03-04 05:52:41,597 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 1973 transitions. Word has length 153 [2025-03-04 05:52:41,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:52:41,597 INFO L471 AbstractCegarLoop]: Abstraction has 1488 states and 1973 transitions. [2025-03-04 05:52:41,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (24), 1 states have call predecessors, (24), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 05:52:41,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 1973 transitions. [2025-03-04 05:52:41,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-04 05:52:41,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:52:41,602 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:52:41,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 05:52:41,602 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting sm_cache_flushErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2025-03-04 05:52:41,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:52:41,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1108109816, now seen corresponding path program 1 times [2025-03-04 05:52:41,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:52:41,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844574686] [2025-03-04 05:52:41,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:52:41,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:52:42,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 05:52:42,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 05:52:42,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:52:42,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:52:42,435 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-03-04 05:52:42,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:52:42,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844574686] [2025-03-04 05:52:42,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844574686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:52:42,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:52:42,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:52:42,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815626302] [2025-03-04 05:52:42,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:52:42,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:52:42,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:52:42,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:52:42,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:52:42,436 INFO L87 Difference]: Start difference. First operand 1488 states and 1973 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 05:52:42,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:52:42,649 INFO L93 Difference]: Finished difference Result 2907 states and 3906 transitions. [2025-03-04 05:52:42,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:52:42,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 154 [2025-03-04 05:52:42,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:52:42,656 INFO L225 Difference]: With dead ends: 2907 [2025-03-04 05:52:42,656 INFO L226 Difference]: Without dead ends: 1496 [2025-03-04 05:52:42,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:52:42,661 INFO L435 NwaCegarLoop]: 1588 mSDtfsCounter, 4 mSDsluCounter, 3164 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4752 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:52:42,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 4752 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:52:42,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2025-03-04 05:52:42,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1492. [2025-03-04 05:52:42,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1492 states, 1034 states have (on average 1.2553191489361701) internal successors, (1298), 1071 states have internal predecessors, (1298), 337 states have call successors, (337), 113 states have call predecessors, (337), 114 states have return successors, (342), 333 states have call predecessors, (342), 335 states have call successors, (342) [2025-03-04 05:52:42,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 1977 transitions. [2025-03-04 05:52:42,753 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 1977 transitions. Word has length 154 [2025-03-04 05:52:42,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:52:42,754 INFO L471 AbstractCegarLoop]: Abstraction has 1492 states and 1977 transitions. [2025-03-04 05:52:42,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 05:52:42,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 1977 transitions. [2025-03-04 05:52:42,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-04 05:52:42,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:52:42,756 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:52:42,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 05:52:42,756 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting sm_cache_flushErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2025-03-04 05:52:42,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:52:42,757 INFO L85 PathProgramCache]: Analyzing trace with hash 723903805, now seen corresponding path program 1 times [2025-03-04 05:52:42,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:52:42,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808487606] [2025-03-04 05:52:42,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:52:42,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:52:43,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 05:52:43,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 05:52:43,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:52:43,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:52:43,720 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-03-04 05:52:43,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:52:43,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808487606] [2025-03-04 05:52:43,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808487606] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:52:43,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438775021] [2025-03-04 05:52:43,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:52:43,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:52:43,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:52:43,723 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 05:52:43,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 05:52:45,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 05:52:45,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 05:52:45,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:52:45,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:52:45,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 2081 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-04 05:52:45,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 05:52:46,007 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 66 proven. 3 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-04 05:52:46,008 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 05:52:47,717 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-04 05:52:47,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438775021] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 05:52:47,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 05:52:47,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 8] total 17 [2025-03-04 05:52:47,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111685328] [2025-03-04 05:52:47,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 05:52:47,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 05:52:47,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:52:47,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 05:52:47,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2025-03-04 05:52:47,720 INFO L87 Difference]: Start difference. First operand 1492 states and 1977 transitions. Second operand has 17 states, 16 states have (on average 9.3125) internal successors, (149), 15 states have internal predecessors, (149), 5 states have call successors, (50), 2 states have call predecessors, (50), 6 states have return successors, (50), 6 states have call predecessors, (50), 5 states have call successors, (50) [2025-03-04 05:52:49,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:52:49,999 INFO L93 Difference]: Finished difference Result 2916 states and 3912 transitions. [2025-03-04 05:52:49,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 05:52:49,999 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 9.3125) internal successors, (149), 15 states have internal predecessors, (149), 5 states have call successors, (50), 2 states have call predecessors, (50), 6 states have return successors, (50), 6 states have call predecessors, (50), 5 states have call successors, (50) Word has length 157 [2025-03-04 05:52:50,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:52:50,009 INFO L225 Difference]: With dead ends: 2916 [2025-03-04 05:52:50,010 INFO L226 Difference]: Without dead ends: 1499 [2025-03-04 05:52:50,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2025-03-04 05:52:50,014 INFO L435 NwaCegarLoop]: 1563 mSDtfsCounter, 276 mSDsluCounter, 18030 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 19593 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-04 05:52:50,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 19593 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-04 05:52:50,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2025-03-04 05:52:50,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1496. [2025-03-04 05:52:50,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1496 states, 1037 states have (on average 1.2545805207328833) internal successors, (1301), 1075 states have internal predecessors, (1301), 337 states have call successors, (337), 113 states have call predecessors, (337), 115 states have return successors, (343), 333 states have call predecessors, (343), 335 states have call successors, (343) [2025-03-04 05:52:50,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1981 transitions. [2025-03-04 05:52:50,115 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 1981 transitions. Word has length 157 [2025-03-04 05:52:50,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:52:50,115 INFO L471 AbstractCegarLoop]: Abstraction has 1496 states and 1981 transitions. [2025-03-04 05:52:50,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 9.3125) internal successors, (149), 15 states have internal predecessors, (149), 5 states have call successors, (50), 2 states have call predecessors, (50), 6 states have return successors, (50), 6 states have call predecessors, (50), 5 states have call successors, (50) [2025-03-04 05:52:50,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 1981 transitions. [2025-03-04 05:52:50,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-04 05:52:50,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:52:50,123 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:52:50,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 05:52:50,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-04 05:52:50,324 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2025-03-04 05:52:50,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:52:50,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1754823872, now seen corresponding path program 1 times [2025-03-04 05:52:50,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:52:50,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363890570] [2025-03-04 05:52:50,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:52:50,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:52:50,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 05:52:50,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 05:52:50,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:52:50,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:52:51,040 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 05:52:51,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:52:51,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363890570] [2025-03-04 05:52:51,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363890570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:52:51,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:52:51,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:52:51,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366504184] [2025-03-04 05:52:51,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:52:51,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:52:51,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:52:51,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:52:51,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:52:51,042 INFO L87 Difference]: Start difference. First operand 1496 states and 1981 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-04 05:52:51,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:52:51,215 INFO L93 Difference]: Finished difference Result 1496 states and 1981 transitions. [2025-03-04 05:52:51,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:52:51,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 154 [2025-03-04 05:52:51,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:52:51,221 INFO L225 Difference]: With dead ends: 1496 [2025-03-04 05:52:51,221 INFO L226 Difference]: Without dead ends: 1494 [2025-03-04 05:52:51,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:52:51,222 INFO L435 NwaCegarLoop]: 1585 mSDtfsCounter, 1554 mSDsluCounter, 1584 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1554 SdHoareTripleChecker+Valid, 3169 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-03-04 05:52:51,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1554 Valid, 3169 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:52:51,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2025-03-04 05:52:51,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1494. [2025-03-04 05:52:51,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1494 states, 1036 states have (on average 1.2538610038610039) internal successors, (1299), 1073 states have internal predecessors, (1299), 337 states have call successors, (337), 113 states have call predecessors, (337), 115 states have return successors, (343), 333 states have call predecessors, (343), 335 states have call successors, (343) [2025-03-04 05:52:51,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 1979 transitions. [2025-03-04 05:52:51,318 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 1979 transitions. Word has length 154 [2025-03-04 05:52:51,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:52:51,318 INFO L471 AbstractCegarLoop]: Abstraction has 1494 states and 1979 transitions. [2025-03-04 05:52:51,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-04 05:52:51,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 1979 transitions. [2025-03-04 05:52:51,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-04 05:52:51,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:52:51,321 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:52:51,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 05:52:51,321 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting sm_cache_flushErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2025-03-04 05:52:51,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:52:51,321 INFO L85 PathProgramCache]: Analyzing trace with hash 2046382317, now seen corresponding path program 1 times [2025-03-04 05:52:51,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:52:51,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986603475] [2025-03-04 05:52:51,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:52:51,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:52:51,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-04 05:52:51,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-04 05:52:51,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:52:51,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:52:52,443 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-03-04 05:52:52,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:52:52,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986603475] [2025-03-04 05:52:52,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986603475] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:52:52,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886521499] [2025-03-04 05:52:52,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:52:52,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:52:52,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:52:52,446 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 05:52:52,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 05:52:53,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes.