./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--input--touchscreen--elants_i2c.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--input--touchscreen--elants_i2c.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 c80eb64b2f9217863d1cee53bd309527a1698bb6d7dac474881d4795c24080c8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 05:50:40,147 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 05:50:40,209 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 05:50:40,215 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 05:50:40,216 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 05:50:40,237 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 05:50:40,238 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 05:50:40,238 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 05:50:40,238 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 05:50:40,238 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 05:50:40,239 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 05:50:40,239 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 05:50:40,239 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 05:50:40,239 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 05:50:40,239 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 05:50:40,239 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 05:50:40,239 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 05:50:40,239 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 05:50:40,239 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 05:50:40,239 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 05:50:40,239 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 05:50:40,241 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 05:50:40,241 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 05:50:40,241 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 05:50:40,241 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 05:50:40,241 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 05:50:40,241 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 05:50:40,241 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 05:50:40,241 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 05:50:40,241 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 05:50:40,242 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 05:50:40,242 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 05:50:40,242 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 05:50:40,242 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 05:50:40,242 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 05:50:40,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 05:50:40,242 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 05:50:40,242 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 05:50:40,242 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 05:50:40,242 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 05:50:40,242 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 -> c80eb64b2f9217863d1cee53bd309527a1698bb6d7dac474881d4795c24080c8 [2025-03-04 05:50:40,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 05:50:40,528 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 05:50:40,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 05:50:40,533 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 05:50:40,533 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 05:50:40,534 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--input--touchscreen--elants_i2c.ko.cil.i [2025-03-04 05:50:41,709 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/502b3a693/489ceec148f5495582369a5e398186b4/FLAG2c079399c [2025-03-04 05:50:42,188 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 05:50:42,189 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i [2025-03-04 05:50:42,232 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/502b3a693/489ceec148f5495582369a5e398186b4/FLAG2c079399c [2025-03-04 05:50:42,246 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/502b3a693/489ceec148f5495582369a5e398186b4 [2025-03-04 05:50:42,249 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 05:50:42,250 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 05:50:42,253 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 05:50:42,253 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 05:50:42,257 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 05:50:42,258 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 05:50:42" (1/1) ... [2025-03-04 05:50:42,259 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@116a02a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:50:42, skipping insertion in model container [2025-03-04 05:50:42,259 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 05:50:42" (1/1) ... [2025-03-04 05:50:42,334 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 05:50:45,707 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[301233,301246] [2025-03-04 05:50:45,710 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[301378,301391] [2025-03-04 05:50:45,711 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[301524,301537] [2025-03-04 05:50:45,712 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[301689,301702] [2025-03-04 05:50:45,716 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[301847,301860] [2025-03-04 05:50:45,716 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[302005,302018] [2025-03-04 05:50:45,716 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[302163,302176] [2025-03-04 05:50:45,717 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[302323,302336] [2025-03-04 05:50:45,717 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[302482,302495] [2025-03-04 05:50:45,717 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[302621,302634] [2025-03-04 05:50:45,717 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[302763,302776] [2025-03-04 05:50:45,717 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[302912,302925] [2025-03-04 05:50:45,718 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[303051,303064] [2025-03-04 05:50:45,718 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[303206,303219] [2025-03-04 05:50:45,718 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[303366,303379] [2025-03-04 05:50:45,718 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[303517,303530] [2025-03-04 05:50:45,718 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[303668,303681] [2025-03-04 05:50:45,723 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[303820,303833] [2025-03-04 05:50:45,723 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[303969,303982] [2025-03-04 05:50:45,723 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[304117,304130] [2025-03-04 05:50:45,724 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[304274,304287] [2025-03-04 05:50:45,724 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[304423,304436] [2025-03-04 05:50:45,724 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[304579,304592] [2025-03-04 05:50:45,724 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[304732,304745] [2025-03-04 05:50:45,724 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[304878,304891] [2025-03-04 05:50:45,724 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[305021,305034] [2025-03-04 05:50:45,724 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[305173,305186] [2025-03-04 05:50:45,725 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[305319,305332] [2025-03-04 05:50:45,725 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[305464,305477] [2025-03-04 05:50:45,725 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[305618,305631] [2025-03-04 05:50:45,725 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[305769,305782] [2025-03-04 05:50:45,725 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[305924,305937] [2025-03-04 05:50:45,730 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[306076,306089] [2025-03-04 05:50:45,730 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[306231,306244] [2025-03-04 05:50:45,730 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[306395,306408] [2025-03-04 05:50:45,730 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[306551,306564] [2025-03-04 05:50:45,731 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[306715,306728] [2025-03-04 05:50:45,731 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[306857,306870] [2025-03-04 05:50:45,731 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[307015,307028] [2025-03-04 05:50:45,731 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[307182,307195] [2025-03-04 05:50:45,731 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[307341,307354] [2025-03-04 05:50:45,731 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[307500,307513] [2025-03-04 05:50:45,732 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[307649,307662] [2025-03-04 05:50:45,732 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[307796,307809] [2025-03-04 05:50:45,732 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[307935,307948] [2025-03-04 05:50:45,732 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[308098,308111] [2025-03-04 05:50:45,732 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[308264,308277] [2025-03-04 05:50:45,733 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[308428,308441] [2025-03-04 05:50:45,733 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[308593,308606] [2025-03-04 05:50:45,733 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[308758,308771] [2025-03-04 05:50:45,735 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[308924,308937] [2025-03-04 05:50:45,736 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[309089,309102] [2025-03-04 05:50:45,736 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[309256,309269] [2025-03-04 05:50:45,736 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[309416,309429] [2025-03-04 05:50:45,736 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[309578,309591] [2025-03-04 05:50:45,737 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[309737,309750] [2025-03-04 05:50:45,737 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[309883,309896] [2025-03-04 05:50:45,737 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[310026,310039] [2025-03-04 05:50:45,737 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[310170,310183] [2025-03-04 05:50:45,738 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[310313,310326] [2025-03-04 05:50:45,738 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[310457,310470] [2025-03-04 05:50:45,738 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[310598,310611] [2025-03-04 05:50:45,740 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[310736,310749] [2025-03-04 05:50:45,740 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[310894,310907] [2025-03-04 05:50:45,740 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[311053,311066] [2025-03-04 05:50:45,740 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[311209,311222] [2025-03-04 05:50:45,741 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[311358,311371] [2025-03-04 05:50:45,741 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[311510,311523] [2025-03-04 05:50:45,741 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[311661,311674] [2025-03-04 05:50:45,741 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[311810,311823] [2025-03-04 05:50:45,742 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[311962,311975] [2025-03-04 05:50:45,742 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[312110,312123] [2025-03-04 05:50:45,743 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[312263,312276] [2025-03-04 05:50:45,744 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[312414,312427] [2025-03-04 05:50:45,744 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[312564,312577] [2025-03-04 05:50:45,744 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[312711,312724] [2025-03-04 05:50:45,744 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[312862,312875] [2025-03-04 05:50:45,744 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[313013,313026] [2025-03-04 05:50:45,745 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[313161,313174] [2025-03-04 05:50:45,745 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[313327,313340] [2025-03-04 05:50:45,746 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[313496,313509] [2025-03-04 05:50:45,746 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[313663,313676] [2025-03-04 05:50:45,746 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[313831,313844] [2025-03-04 05:50:45,746 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[313981,313994] [2025-03-04 05:50:45,746 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[314128,314141] [2025-03-04 05:50:45,747 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[314289,314302] [2025-03-04 05:50:45,747 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[314459,314472] [2025-03-04 05:50:45,748 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[314621,314634] [2025-03-04 05:50:45,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 05:50:45,796 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 05:50:45,877 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("bts %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [4392] [2025-03-04 05:50:46,072 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[301233,301246] [2025-03-04 05:50:46,073 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[301378,301391] [2025-03-04 05:50:46,073 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[301524,301537] [2025-03-04 05:50:46,073 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[301689,301702] [2025-03-04 05:50:46,074 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[301847,301860] [2025-03-04 05:50:46,074 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[302005,302018] [2025-03-04 05:50:46,074 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[302163,302176] [2025-03-04 05:50:46,075 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[302323,302336] [2025-03-04 05:50:46,075 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[302482,302495] [2025-03-04 05:50:46,075 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[302621,302634] [2025-03-04 05:50:46,075 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[302763,302776] [2025-03-04 05:50:46,076 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[302912,302925] [2025-03-04 05:50:46,076 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[303051,303064] [2025-03-04 05:50:46,076 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[303206,303219] [2025-03-04 05:50:46,076 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[303366,303379] [2025-03-04 05:50:46,077 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[303517,303530] [2025-03-04 05:50:46,077 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[303668,303681] [2025-03-04 05:50:46,077 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[303820,303833] [2025-03-04 05:50:46,078 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[303969,303982] [2025-03-04 05:50:46,078 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[304117,304130] [2025-03-04 05:50:46,078 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[304274,304287] [2025-03-04 05:50:46,079 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[304423,304436] [2025-03-04 05:50:46,079 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[304579,304592] [2025-03-04 05:50:46,079 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[304732,304745] [2025-03-04 05:50:46,080 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[304878,304891] [2025-03-04 05:50:46,080 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[305021,305034] [2025-03-04 05:50:46,080 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[305173,305186] [2025-03-04 05:50:46,080 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[305319,305332] [2025-03-04 05:50:46,080 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[305464,305477] [2025-03-04 05:50:46,080 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[305618,305631] [2025-03-04 05:50:46,081 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[305769,305782] [2025-03-04 05:50:46,081 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[305924,305937] [2025-03-04 05:50:46,082 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[306076,306089] [2025-03-04 05:50:46,082 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[306231,306244] [2025-03-04 05:50:46,083 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[306395,306408] [2025-03-04 05:50:46,084 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[306551,306564] [2025-03-04 05:50:46,084 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[306715,306728] [2025-03-04 05:50:46,084 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[306857,306870] [2025-03-04 05:50:46,084 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[307015,307028] [2025-03-04 05:50:46,085 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[307182,307195] [2025-03-04 05:50:46,085 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[307341,307354] [2025-03-04 05:50:46,085 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[307500,307513] [2025-03-04 05:50:46,085 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[307649,307662] [2025-03-04 05:50:46,085 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[307796,307809] [2025-03-04 05:50:46,085 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[307935,307948] [2025-03-04 05:50:46,085 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[308098,308111] [2025-03-04 05:50:46,086 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[308264,308277] [2025-03-04 05:50:46,086 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[308428,308441] [2025-03-04 05:50:46,086 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[308593,308606] [2025-03-04 05:50:46,086 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[308758,308771] [2025-03-04 05:50:46,086 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[308924,308937] [2025-03-04 05:50:46,086 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[309089,309102] [2025-03-04 05:50:46,087 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[309256,309269] [2025-03-04 05:50:46,087 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[309416,309429] [2025-03-04 05:50:46,087 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[309578,309591] [2025-03-04 05:50:46,087 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[309737,309750] [2025-03-04 05:50:46,088 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[309883,309896] [2025-03-04 05:50:46,088 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[310026,310039] [2025-03-04 05:50:46,088 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[310170,310183] [2025-03-04 05:50:46,088 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[310313,310326] [2025-03-04 05:50:46,088 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[310457,310470] [2025-03-04 05:50:46,089 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[310598,310611] [2025-03-04 05:50:46,089 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[310736,310749] [2025-03-04 05:50:46,089 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[310894,310907] [2025-03-04 05:50:46,089 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[311053,311066] [2025-03-04 05:50:46,089 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[311209,311222] [2025-03-04 05:50:46,090 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[311358,311371] [2025-03-04 05:50:46,090 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[311510,311523] [2025-03-04 05:50:46,090 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[311661,311674] [2025-03-04 05:50:46,090 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[311810,311823] [2025-03-04 05:50:46,090 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[311962,311975] [2025-03-04 05:50:46,091 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[312110,312123] [2025-03-04 05:50:46,091 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[312263,312276] [2025-03-04 05:50:46,092 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[312414,312427] [2025-03-04 05:50:46,092 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[312564,312577] [2025-03-04 05:50:46,092 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[312711,312724] [2025-03-04 05:50:46,092 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[312862,312875] [2025-03-04 05:50:46,092 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[313013,313026] [2025-03-04 05:50:46,093 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[313161,313174] [2025-03-04 05:50:46,093 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[313327,313340] [2025-03-04 05:50:46,093 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[313496,313509] [2025-03-04 05:50:46,094 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[313663,313676] [2025-03-04 05:50:46,094 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[313831,313844] [2025-03-04 05:50:46,094 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[313981,313994] [2025-03-04 05:50:46,094 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[314128,314141] [2025-03-04 05:50:46,095 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[314289,314302] [2025-03-04 05:50:46,095 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[314459,314472] [2025-03-04 05:50:46,095 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[314621,314634] [2025-03-04 05:50:46,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 05:50:46,225 INFO L204 MainTranslator]: Completed translation [2025-03-04 05:50:46,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:50:46 WrapperNode [2025-03-04 05:50:46,225 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 05:50:46,226 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 05:50:46,226 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 05:50:46,227 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 05:50:46,232 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:50:46" (1/1) ... [2025-03-04 05:50:46,304 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:50:46" (1/1) ... [2025-03-04 05:50:46,477 INFO L138 Inliner]: procedures = 537, calls = 1979, calls flagged for inlining = 255, calls inlined = 172, statements flattened = 4321 [2025-03-04 05:50:46,478 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 05:50:46,478 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 05:50:46,478 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 05:50:46,478 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 05:50:46,486 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:50:46" (1/1) ... [2025-03-04 05:50:46,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:50:46" (1/1) ... [2025-03-04 05:50:46,514 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:50:46" (1/1) ... [2025-03-04 05:50:46,894 INFO L175 MemorySlicer]: Split 720 memory accesses to 22 slices as follows [2, 4, 4, 4, 1, 11, 33, 46, 2, 40, 156, 4, 7, 4, 4, 5, 84, 10, 4, 4, 2, 289]. 40 percent of accesses are in the largest equivalence class. The 76 initializations are split as follows [0, 0, 0, 0, 1, 0, 0, 0, 2, 0, 0, 4, 7, 0, 0, 0, 0, 0, 0, 0, 0, 62]. The 436 writes are split as follows [2, 4, 4, 4, 0, 11, 33, 34, 0, 0, 156, 0, 0, 4, 0, 0, 72, 9, 4, 0, 0, 99]. [2025-03-04 05:50:46,894 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:50:46" (1/1) ... [2025-03-04 05:50:46,895 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:50:46" (1/1) ... [2025-03-04 05:50:46,990 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:50:46" (1/1) ... [2025-03-04 05:50:47,003 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:50:46" (1/1) ... [2025-03-04 05:50:47,031 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:50:46" (1/1) ... [2025-03-04 05:50:47,049 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:50:46" (1/1) ... [2025-03-04 05:50:47,078 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 05:50:47,079 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 05:50:47,079 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 05:50:47,080 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 05:50:47,081 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:50:46" (1/1) ... [2025-03-04 05:50:47,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 05:50:47,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:50:47,109 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:50:47,115 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:50:47,129 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_nonpositive [2025-03-04 05:50:47,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_nonpositive [2025-03-04 05:50:47,129 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2025-03-04 05:50:47,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2025-03-04 05:50:47,130 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-04 05:50:47,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-04 05:50:47,130 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-03-04 05:50:47,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-03-04 05:50:47,130 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2025-03-04 05:50:47,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2025-03-04 05:50:47,130 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2025-03-04 05:50:47,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2025-03-04 05:50:47,130 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_parse_version [2025-03-04 05:50:47,130 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_parse_version [2025-03-04 05:50:47,130 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2025-03-04 05:50:47,130 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event [2025-03-04 05:50:47,130 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2025-03-04 05:50:47,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2025-03-04 05:50:47,130 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_remove_sysfs_group [2025-03-04 05:50:47,131 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_remove_sysfs_group [2025-03-04 05:50:47,131 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-03-04 05:50:47,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-03-04 05:50:47,131 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2025-03-04 05:50:47,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2025-03-04 05:50:47,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 05:50:47,131 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2025-03-04 05:50:47,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2025-03-04 05:50:47,131 INFO L130 BoogieDeclarations]: Found specification of procedure input_abs_set_res [2025-03-04 05:50:47,131 INFO L138 BoogieDeclarations]: Found implementation of procedure input_abs_set_res [2025-03-04 05:50:47,131 INFO L130 BoogieDeclarations]: Found specification of procedure write_update_fw [2025-03-04 05:50:47,131 INFO L138 BoogieDeclarations]: Found implementation of procedure write_update_fw [2025-03-04 05:50:47,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-04 05:50:47,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-04 05:50:47,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-04 05:50:47,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-04 05:50:47,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-04 05:50:47,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-04 05:50:47,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-04 05:50:47,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-03-04 05:50:47,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-03-04 05:50:47,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-03-04 05:50:47,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-03-04 05:50:47,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-03-04 05:50:47,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-03-04 05:50:47,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-03-04 05:50:47,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-03-04 05:50:47,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-03-04 05:50:47,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#16 [2025-03-04 05:50:47,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#17 [2025-03-04 05:50:47,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#18 [2025-03-04 05:50:47,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#19 [2025-03-04 05:50:47,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#20 [2025-03-04 05:50:47,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#21 [2025-03-04 05:50:47,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 05:50:47,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 05:50:47,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 05:50:47,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 05:50:47,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 05:50:47,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 05:50:47,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 05:50:47,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 05:50:47,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 05:50:47,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-04 05:50:47,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-04 05:50:47,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-04 05:50:47,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-04 05:50:47,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-04 05:50:47,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-04 05:50:47,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-04 05:50:47,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-04 05:50:47,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-03-04 05:50:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-03-04 05:50:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-03-04 05:50:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-03-04 05:50:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-03-04 05:50:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure _dev_info [2025-03-04 05:50:47,134 INFO L138 BoogieDeclarations]: Found implementation of procedure _dev_info [2025-03-04 05:50:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2025-03-04 05:50:47,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2025-03-04 05:50:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-03-04 05:50:47,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-03-04 05:50:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 05:50:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 05:50:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 05:50:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 05:50:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 05:50:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 05:50:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 05:50:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 05:50:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 05:50:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 05:50:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 05:50:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 05:50:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 05:50:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-04 05:50:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-04 05:50:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-04 05:50:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-04 05:50:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-04 05:50:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-04 05:50:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-03-04 05:50:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-03-04 05:50:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-03-04 05:50:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2025-03-04 05:50:47,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2025-03-04 05:50:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure i2c_get_clientdata [2025-03-04 05:50:47,134 INFO L138 BoogieDeclarations]: Found implementation of procedure i2c_get_clientdata [2025-03-04 05:50:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2025-03-04 05:50:47,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2025-03-04 05:50:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_suspend [2025-03-04 05:50:47,134 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_suspend [2025-03-04 05:50:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2025-03-04 05:50:47,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2025-03-04 05:50:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_dev_dbg [2025-03-04 05:50:47,134 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_dev_dbg [2025-03-04 05:50:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-03-04 05:50:47,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-03-04 05:50:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 05:50:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 05:50:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-03-04 05:50:47,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-03-04 05:50:47,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 05:50:47,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 05:50:47,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 05:50:47,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 05:50:47,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 05:50:47,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 05:50:47,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 05:50:47,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 05:50:47,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 05:50:47,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 05:50:47,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-04 05:50:47,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-04 05:50:47,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-04 05:50:47,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-04 05:50:47,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-04 05:50:47,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-04 05:50:47,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-04 05:50:47,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-04 05:50:47,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-04 05:50:47,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-03-04 05:50:47,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-03-04 05:50:47,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-03-04 05:50:47,136 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-03-04 05:50:47,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-03-04 05:50:47,136 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2025-03-04 05:50:47,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2025-03-04 05:50:47,136 INFO L130 BoogieDeclarations]: Found specification of procedure i2c_master_recv [2025-03-04 05:50:47,136 INFO L138 BoogieDeclarations]: Found implementation of procedure i2c_master_recv [2025-03-04 05:50:47,136 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2025-03-04 05:50:47,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2025-03-04 05:50:47,136 INFO L130 BoogieDeclarations]: Found specification of procedure dev_warn [2025-03-04 05:50:47,136 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_warn [2025-03-04 05:50:47,137 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_send [2025-03-04 05:50:47,137 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_send [2025-03-04 05:50:47,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 05:50:47,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 05:50:47,137 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2025-03-04 05:50:47,137 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2025-03-04 05:50:47,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-04 05:50:47,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-04 05:50:47,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-04 05:50:47,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-04 05:50:47,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-04 05:50:47,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-04 05:50:47,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-04 05:50:47,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-03-04 05:50:47,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-03-04 05:50:47,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-03-04 05:50:47,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-03-04 05:50:47,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-03-04 05:50:47,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-03-04 05:50:47,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-03-04 05:50:47,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-03-04 05:50:47,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-03-04 05:50:47,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#16 [2025-03-04 05:50:47,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#17 [2025-03-04 05:50:47,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#18 [2025-03-04 05:50:47,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#19 [2025-03-04 05:50:47,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#20 [2025-03-04 05:50:47,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#21 [2025-03-04 05:50:47,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 05:50:47,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 05:50:47,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 05:50:47,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 05:50:47,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 05:50:47,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 05:50:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 05:50:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 05:50:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-04 05:50:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-04 05:50:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-04 05:50:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-04 05:50:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-04 05:50:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-04 05:50:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-04 05:50:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-04 05:50:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-03-04 05:50:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-03-04 05:50:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-03-04 05:50:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-03-04 05:50:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2025-03-04 05:50:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#21 [2025-03-04 05:50:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-04 05:50:47,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-04 05:50:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure elants_version_attribute_show [2025-03-04 05:50:47,138 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_version_attribute_show [2025-03-04 05:50:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure disable_irq [2025-03-04 05:50:47,138 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_irq [2025-03-04 05:50:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_sw_reset [2025-03-04 05:50:47,138 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_sw_reset [2025-03-04 05:50:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2025-03-04 05:50:47,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2025-03-04 05:50:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_calibrate [2025-03-04 05:50:47,138 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_calibrate [2025-03-04 05:50:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2025-03-04 05:50:47,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2025-03-04 05:50:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 05:50:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2025-03-04 05:50:47,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2025-03-04 05:50:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 05:50:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 05:50:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 05:50:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 05:50:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 05:50:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 05:50:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 05:50:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 05:50:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 05:50:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 05:50:47,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-04 05:50:47,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-04 05:50:47,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-04 05:50:47,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-04 05:50:47,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-04 05:50:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-04 05:50:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-04 05:50:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-04 05:50:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-04 05:50:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-03-04 05:50:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-03-04 05:50:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-03-04 05:50:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2025-03-04 05:50:47,140 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2025-03-04 05:50:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 05:50:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 05:50:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 05:50:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 05:50:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 05:50:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-04 05:50:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-04 05:50:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-04 05:50:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-04 05:50:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-04 05:50:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-04 05:50:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-04 05:50:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-04 05:50:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-04 05:50:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-04 05:50:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-04 05:50:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-04 05:50:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-04 05:50:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-03-04 05:50:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-03-04 05:50:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-03-04 05:50:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2025-03-04 05:50:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_resume [2025-03-04 05:50:47,141 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_resume [2025-03-04 05:50:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-03-04 05:50:47,141 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-03-04 05:50:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure calibrate_store [2025-03-04 05:50:47,141 INFO L138 BoogieDeclarations]: Found implementation of procedure calibrate_store [2025-03-04 05:50:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2025-03-04 05:50:47,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2025-03-04 05:50:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2025-03-04 05:50:47,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2025-03-04 05:50:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-03-04 05:50:47,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-03-04 05:50:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-03-04 05:50:47,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-03-04 05:50:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2025-03-04 05:50:47,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2025-03-04 05:50:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure irq_set_irq_wake [2025-03-04 05:50:47,141 INFO L138 BoogieDeclarations]: Found implementation of procedure irq_set_irq_wake [2025-03-04 05:50:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure get_unaligned_be16 [2025-03-04 05:50:47,141 INFO L138 BoogieDeclarations]: Found implementation of procedure get_unaligned_be16 [2025-03-04 05:50:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-03-04 05:50:47,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-03-04 05:50:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-03-04 05:50:47,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-03-04 05:50:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 05:50:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 05:50:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 05:50:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 05:50:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 05:50:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 05:50:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 05:50:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 05:50:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 05:50:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 05:50:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 05:50:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 05:50:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 05:50:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-04 05:50:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-04 05:50:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-04 05:50:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-04 05:50:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-04 05:50:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-04 05:50:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-03-04 05:50:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-03-04 05:50:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-03-04 05:50:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2025-03-04 05:50:47,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2025-03-04 05:50:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_initialize [2025-03-04 05:50:47,142 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_initialize [2025-03-04 05:50:47,142 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-04 05:50:47,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-04 05:50:47,143 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_sysfs_mutex_of_elants_data [2025-03-04 05:50:47,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_sysfs_mutex_of_elants_data [2025-03-04 05:50:47,143 INFO L130 BoogieDeclarations]: Found specification of procedure enable_irq [2025-03-04 05:50:47,143 INFO L138 BoogieDeclarations]: Found implementation of procedure enable_irq [2025-03-04 05:50:47,143 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2025-03-04 05:50:47,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2025-03-04 05:50:47,143 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2025-03-04 05:50:47,143 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2025-03-04 05:50:47,143 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_read [2025-03-04 05:50:47,143 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_read [2025-03-04 05:50:47,143 INFO L130 BoogieDeclarations]: Found specification of procedure __set_bit [2025-03-04 05:50:47,143 INFO L138 BoogieDeclarations]: Found implementation of procedure __set_bit [2025-03-04 05:50:47,143 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_sysfs_mutex_of_elants_data [2025-03-04 05:50:47,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_sysfs_mutex_of_elants_data [2025-03-04 05:50:47,143 INFO L130 BoogieDeclarations]: Found specification of procedure device_may_wakeup [2025-03-04 05:50:47,143 INFO L138 BoogieDeclarations]: Found implementation of procedure device_may_wakeup [2025-03-04 05:50:47,143 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_execute_command [2025-03-04 05:50:47,143 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_execute_command [2025-03-04 05:50:47,143 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2025-03-04 05:50:47,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2025-03-04 05:50:47,143 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-03-04 05:50:47,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-03-04 05:50:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 05:50:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 05:50:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 05:50:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 05:50:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 05:50:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 05:50:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 05:50:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 05:50:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 05:50:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 05:50:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 05:50:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 05:50:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 05:50:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-04 05:50:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-04 05:50:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-04 05:50:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-04 05:50:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-04 05:50:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-04 05:50:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-04 05:50:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-03-04 05:50:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-03-04 05:50:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_event [2025-03-04 05:50:47,144 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_event [2025-03-04 05:50:47,771 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 05:50:47,773 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 05:50:47,813 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-04 05:50:47,918 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4830: call ULTIMATE.dealloc(~#soft_rst_cmd~0.base, ~#soft_rst_cmd~0.offset);havoc ~#soft_rst_cmd~0.base, ~#soft_rst_cmd~0.offset; [2025-03-04 05:50:48,066 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12276: havoc msecs_to_jiffies_#t~nondet709#1; [2025-03-04 05:50:48,066 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4772: call ULTIMATE.dealloc(~#w_flashkey~0#1.base, ~#w_flashkey~0#1.offset);havoc ~#w_flashkey~0#1.base, ~#w_flashkey~0#1.offset;call ULTIMATE.dealloc(~#rek~0#1.base, ~#rek~0#1.offset);havoc ~#rek~0#1.base, ~#rek~0#1.offset;call ULTIMATE.dealloc(~#rek_resp~0#1.base, ~#rek_resp~0#1.offset);havoc ~#rek_resp~0#1.base, ~#rek_resp~0#1.offset; [2025-03-04 05:50:48,066 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12290: havoc wait_for_completion_interruptible_timeout_#t~nondet711#1; [2025-03-04 05:50:48,166 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6382: call ULTIMATE.dealloc(~#set_active_cmd~0#1.base, ~#set_active_cmd~0#1.offset);havoc ~#set_active_cmd~0#1.base, ~#set_active_cmd~0#1.offset; [2025-03-04 05:50:48,537 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5593: call ULTIMATE.dealloc(elants_i2c_fw_update_~#fw~0#1.base, elants_i2c_fw_update_~#fw~0#1.offset);havoc elants_i2c_fw_update_~#fw~0#1.base, elants_i2c_fw_update_~#fw~0#1.offset; [2025-03-04 05:50:48,537 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6015: call ULTIMATE.dealloc(~#descriptor~8#1.base, ~#descriptor~8#1.offset);havoc ~#descriptor~8#1.base, ~#descriptor~8#1.offset; [2025-03-04 05:50:48,537 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12286: havoc request_firmware_#t~nondet710#1; [2025-03-04 05:50:48,537 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5353: call ULTIMATE.dealloc(elants_i2c_fw_write_page_~#ack_ok~0#1.base, elants_i2c_fw_write_page_~#ack_ok~0#1.offset);havoc elants_i2c_fw_write_page_~#ack_ok~0#1.base, elants_i2c_fw_write_page_~#ack_ok~0#1.offset;call ULTIMATE.dealloc(elants_i2c_fw_write_page_~#buf~1#1.base, elants_i2c_fw_write_page_~#buf~1#1.offset);havoc elants_i2c_fw_write_page_~#buf~1#1.base, elants_i2c_fw_write_page_~#buf~1#1.offset; [2025-03-04 05:50:48,537 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5411: call ULTIMATE.dealloc(elants_i2c_do_update_firmware_~#enter_iap~0#1.base, elants_i2c_do_update_firmware_~#enter_iap~0#1.offset);havoc elants_i2c_do_update_firmware_~#enter_iap~0#1.base, elants_i2c_do_update_firmware_~#enter_iap~0#1.offset;call ULTIMATE.dealloc(elants_i2c_do_update_firmware_~#enter_iap2~0#1.base, elants_i2c_do_update_firmware_~#enter_iap2~0#1.offset);havoc elants_i2c_do_update_firmware_~#enter_iap2~0#1.base, elants_i2c_do_update_firmware_~#enter_iap2~0#1.offset;call ULTIMATE.dealloc(elants_i2c_do_update_firmware_~#iap_ack~0#1.base, elants_i2c_do_update_firmware_~#iap_ack~0#1.offset);havoc elants_i2c_do_update_firmware_~#iap_ack~0#1.base, elants_i2c_do_update_firmware_~#iap_ack~0#1.offset;call ULTIMATE.dealloc(elants_i2c_do_update_firmware_~#buf~2#1.base, elants_i2c_do_update_firmware_~#buf~2#1.offset);havoc elants_i2c_do_update_firmware_~#buf~2#1.base, elants_i2c_do_update_firmware_~#buf~2#1.offset;call ULTIMATE.dealloc(elants_i2c_do_update_firmware_~#send_id~0#1.base, elants_i2c_do_update_firmware_~#send_id~0#1.offset);havoc elants_i2c_do_update_firmware_~#send_id~0#1.base, elants_i2c_do_update_firmware_~#send_id~0#1.offset;call ULTIMATE.dealloc(elants_i2c_do_update_firmware_~#descriptor~5#1.base, elants_i2c_do_update_firmware_~#descriptor~5#1.offset);havoc elants_i2c_do_update_firmware_~#descriptor~5#1.base, elants_i2c_do_update_firmware_~#descriptor~5#1.offset;call ULTIMATE.dealloc(elants_i2c_do_update_firmware_~#descriptor___0~0#1.base, elants_i2c_do_update_firmware_~#descriptor___0~0#1.offset);havoc elants_i2c_do_update_firmware_~#descriptor___0~0#1.base, elants_i2c_do_update_firmware_~#descriptor___0~0#1.offset;call ULTIMATE.dealloc(elants_i2c_do_update_firmware_~#descriptor___1~0#1.base, elants_i2c_do_update_firmware_~#descriptor___1~0#1.offset);havoc elants_i2c_do_update_firmware_~#descriptor___1~0#1.base, elants_i2c_do_update_firmware_~#descriptor___1~0#1.offset; [2025-03-04 05:50:48,567 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4501: havoc dev_get_drvdata_#t~mem43#1.base, dev_get_drvdata_#t~mem43#1.offset; [2025-03-04 05:50:48,569 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12263: havoc #t~nondet708; [2025-03-04 05:50:48,603 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4399: havoc __fswab16_#t~bitwise4#1; [2025-03-04 05:50:48,636 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6319: call ULTIMATE.dealloc(~#set_sleep_cmd~0#1.base, ~#set_sleep_cmd~0#1.offset);havoc ~#set_sleep_cmd~0#1.base, ~#set_sleep_cmd~0#1.offset; [2025-03-04 05:50:49,308 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4990: call ULTIMATE.dealloc(elants_i2c_query_test_version_~#cmd~2#1.base, elants_i2c_query_test_version_~#cmd~2#1.offset);havoc elants_i2c_query_test_version_~#cmd~2#1.base, elants_i2c_query_test_version_~#cmd~2#1.offset;call ULTIMATE.dealloc(elants_i2c_query_test_version_~#resp~2#1.base, elants_i2c_query_test_version_~#resp~2#1.offset);havoc elants_i2c_query_test_version_~#resp~2#1.base, elants_i2c_query_test_version_~#resp~2#1.offset;call ULTIMATE.dealloc(elants_i2c_query_test_version_~#descriptor~2#1.base, elants_i2c_query_test_version_~#descriptor~2#1.offset);havoc elants_i2c_query_test_version_~#descriptor~2#1.base, elants_i2c_query_test_version_~#descriptor~2#1.offset; [2025-03-04 05:50:49,308 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5081: call ULTIMATE.dealloc(elants_i2c_query_ts_info_~#resp~4#1.base, elants_i2c_query_ts_info_~#resp~4#1.offset);havoc elants_i2c_query_ts_info_~#resp~4#1.base, elants_i2c_query_ts_info_~#resp~4#1.offset;call ULTIMATE.dealloc(elants_i2c_query_ts_info_~#get_resolution_cmd~0#1.base, elants_i2c_query_ts_info_~#get_resolution_cmd~0#1.offset);havoc elants_i2c_query_ts_info_~#get_resolution_cmd~0#1.base, elants_i2c_query_ts_info_~#get_resolution_cmd~0#1.offset;call ULTIMATE.dealloc(elants_i2c_query_ts_info_~#get_osr_cmd~0#1.base, elants_i2c_query_ts_info_~#get_osr_cmd~0#1.offset);havoc elants_i2c_query_ts_info_~#get_osr_cmd~0#1.base, elants_i2c_query_ts_info_~#get_osr_cmd~0#1.offset;call ULTIMATE.dealloc(elants_i2c_query_ts_info_~#get_physical_scan_cmd~0#1.base, elants_i2c_query_ts_info_~#get_physical_scan_cmd~0#1.offset);havoc elants_i2c_query_ts_info_~#get_physical_scan_cmd~0#1.base, elants_i2c_query_ts_info_~#get_physical_scan_cmd~0#1.offset;call ULTIMATE.dealloc(elants_i2c_query_ts_info_~#get_physical_drive_cmd~0#1.base, elants_i2c_query_ts_info_~#get_physical_drive_cmd~0#1.offset);havoc elants_i2c_query_ts_info_~#get_physical_drive_cmd~0#1.base, elants_i2c_query_ts_info_~#get_physical_drive_cmd~0#1.offset;call ULTIMATE.dealloc(elants_i2c_query_ts_info_~#descriptor~3#1.base, elants_i2c_query_ts_info_~#descriptor~3#1.offset);havoc elants_i2c_query_ts_info_~#descriptor~3#1.base, elants_i2c_query_ts_info_~#descriptor~3#1.offset; [2025-03-04 05:50:49,308 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5206: call ULTIMATE.dealloc(elants_i2c_fastboot_~#boot_cmd~0#1.base, elants_i2c_fastboot_~#boot_cmd~0#1.offset);havoc elants_i2c_fastboot_~#boot_cmd~0#1.base, elants_i2c_fastboot_~#boot_cmd~0#1.offset;call ULTIMATE.dealloc(elants_i2c_fastboot_~#descriptor~4#1.base, elants_i2c_fastboot_~#descriptor~4#1.offset);havoc elants_i2c_fastboot_~#descriptor~4#1.base, elants_i2c_fastboot_~#descriptor~4#1.offset; [2025-03-04 05:50:49,308 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4869: call ULTIMATE.dealloc(elants_i2c_query_fw_id_~#cmd~0#1.base, elants_i2c_query_fw_id_~#cmd~0#1.offset);havoc elants_i2c_query_fw_id_~#cmd~0#1.base, elants_i2c_query_fw_id_~#cmd~0#1.offset;call ULTIMATE.dealloc(elants_i2c_query_fw_id_~#resp~0#1.base, elants_i2c_query_fw_id_~#resp~0#1.offset);havoc elants_i2c_query_fw_id_~#resp~0#1.base, elants_i2c_query_fw_id_~#resp~0#1.offset;call ULTIMATE.dealloc(elants_i2c_query_fw_id_~#descriptor~0#1.base, elants_i2c_query_fw_id_~#descriptor~0#1.offset);havoc elants_i2c_query_fw_id_~#descriptor~0#1.base, elants_i2c_query_fw_id_~#descriptor~0#1.offset; [2025-03-04 05:50:49,309 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5249: call ULTIMATE.dealloc(~#hello_packet~0#1.base, ~#hello_packet~0#1.offset);havoc ~#hello_packet~0#1.base, ~#hello_packet~0#1.offset;call ULTIMATE.dealloc(~#recov_packet~0#1.base, ~#recov_packet~0#1.offset);havoc ~#recov_packet~0#1.base, ~#recov_packet~0#1.offset;call ULTIMATE.dealloc(~#buf~0#1.base, ~#buf~0#1.offset);havoc ~#buf~0#1.base, ~#buf~0#1.offset; [2025-03-04 05:50:49,309 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4929: call ULTIMATE.dealloc(elants_i2c_query_fw_version_~#cmd~1#1.base, elants_i2c_query_fw_version_~#cmd~1#1.offset);havoc elants_i2c_query_fw_version_~#cmd~1#1.base, elants_i2c_query_fw_version_~#cmd~1#1.offset;call ULTIMATE.dealloc(elants_i2c_query_fw_version_~#resp~1#1.base, elants_i2c_query_fw_version_~#resp~1#1.offset);havoc elants_i2c_query_fw_version_~#resp~1#1.base, elants_i2c_query_fw_version_~#resp~1#1.offset;call ULTIMATE.dealloc(elants_i2c_query_fw_version_~#descriptor~1#1.base, elants_i2c_query_fw_version_~#descriptor~1#1.offset);havoc elants_i2c_query_fw_version_~#descriptor~1#1.base, elants_i2c_query_fw_version_~#descriptor~1#1.offset; [2025-03-04 05:50:49,309 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5047: call ULTIMATE.dealloc(elants_i2c_query_bc_version_~#cmd~3#1.base, elants_i2c_query_bc_version_~#cmd~3#1.offset);havoc elants_i2c_query_bc_version_~#cmd~3#1.base, elants_i2c_query_bc_version_~#cmd~3#1.offset;call ULTIMATE.dealloc(elants_i2c_query_bc_version_~#resp~3#1.base, elants_i2c_query_bc_version_~#resp~3#1.offset);havoc elants_i2c_query_bc_version_~#resp~3#1.base, elants_i2c_query_bc_version_~#resp~3#1.offset; [2025-03-04 05:50:49,348 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4494: havoc #t~mem38;havoc #t~mem39.base, #t~mem39.offset;havoc #t~short40; [2025-03-04 05:50:49,394 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12236: havoc i2c_transfer_#t~nondet705#1; [2025-03-04 05:50:49,394 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4715: call ULTIMATE.dealloc(~#msgs~0#1.base, ~#msgs~0#1.offset);havoc ~#msgs~0#1.base, ~#msgs~0#1.offset; [2025-03-04 05:50:49,402 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12220: havoc #t~nondet701; [2025-03-04 05:50:49,413 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12224: havoc i2c_master_send_#t~nondet702#1; [2025-03-04 05:50:49,524 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5668: call ULTIMATE.dealloc(elants_i2c_mt_event_~#descriptor~6#1.base, elants_i2c_mt_event_~#descriptor~6#1.offset);havoc elants_i2c_mt_event_~#descriptor~6#1.base, elants_i2c_mt_event_~#descriptor~6#1.offset;call ULTIMATE.dealloc(elants_i2c_mt_event_~#descriptor___0~1#1.base, elants_i2c_mt_event_~#descriptor___0~1#1.offset);havoc elants_i2c_mt_event_~#descriptor___0~1#1.base, elants_i2c_mt_event_~#descriptor___0~1#1.offset; [2025-03-04 05:50:54,788 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12193: havoc device_init_wakeup_#t~nondet696#1; [2025-03-04 05:50:54,788 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12197: havoc devm_add_action_#t~nondet697#1; [2025-03-04 05:50:54,788 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12200: havoc devm_input_allocate_device_#t~ret698#1.base, devm_input_allocate_device_#t~ret698#1.offset; [2025-03-04 05:50:54,788 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12203: havoc devm_kmalloc_#t~ret699#1.base, devm_kmalloc_#t~ret699#1.offset; [2025-03-04 05:50:54,788 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7845-1: ldv_devm_request_threaded_irq_105_#res#1 := ldv_devm_request_threaded_irq_105_~ldv_func_res~0#1; [2025-03-04 05:50:54,788 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12207: havoc devm_request_threaded_irq_#t~nondet700#1; [2025-03-04 05:50:54,788 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5803: call ULTIMATE.dealloc(elants_i2c_irq_~#wait_packet~0#1.base, elants_i2c_irq_~#wait_packet~0#1.offset);havoc elants_i2c_irq_~#wait_packet~0#1.base, elants_i2c_irq_~#wait_packet~0#1.offset;call ULTIMATE.dealloc(elants_i2c_irq_~#descriptor~7#1.base, elants_i2c_irq_~#descriptor~7#1.offset);havoc elants_i2c_irq_~#descriptor~7#1.base, elants_i2c_irq_~#descriptor~7#1.offset; [2025-03-04 05:50:54,788 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6605-1: ldv_devm_request_threaded_irq_#res#1 := ldv_devm_request_threaded_irq_~arg0#1; [2025-03-04 05:50:54,788 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6940-1: ldv_i2c_register_driver_#res#1 := ldv_i2c_register_driver_~arg0#1; [2025-03-04 05:50:54,788 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4628: havoc i2c_check_functionality_#t~bitwise105#1; [2025-03-04 05:50:54,788 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12228: havoc i2c_register_driver_#t~nondet703#1; [2025-03-04 05:50:54,788 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7870-1: ldv_i2c_register_driver_107_#res#1 := ldv_i2c_register_driver_107_~ldv_func_res~1#1; [2025-03-04 05:50:54,788 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12232: havoc i2c_smbus_xfer_#t~nondet704#1; [2025-03-04 05:50:54,788 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6165: call ULTIMATE.dealloc(elants_i2c_probe_~#dummy~0#1.base, elants_i2c_probe_~#dummy~0#1.offset);havoc elants_i2c_probe_~#dummy~0#1.base, elants_i2c_probe_~#dummy~0#1.offset;call ULTIMATE.dealloc(elants_i2c_probe_~#__key~0#1.base, elants_i2c_probe_~#__key~0#1.offset);havoc elants_i2c_probe_~#__key~0#1.base, elants_i2c_probe_~#__key~0#1.offset; [2025-03-04 05:50:54,788 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12246: havoc input_mt_init_slots_#t~nondet706#1; [2025-03-04 05:50:54,788 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12256: havoc input_register_device_#t~nondet707#1; [2025-03-04 05:50:55,212 INFO L? ?]: Removed 1583 outVars from TransFormulas that were not future-live. [2025-03-04 05:50:55,213 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 05:50:55,271 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 05:50:55,271 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 05:50:55,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 05:50:55 BoogieIcfgContainer [2025-03-04 05:50:55,272 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 05:50:55,274 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 05:50:55,275 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 05:50:55,279 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 05:50:55,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 05:50:42" (1/3) ... [2025-03-04 05:50:55,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57542e17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 05:50:55, skipping insertion in model container [2025-03-04 05:50:55,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:50:46" (2/3) ... [2025-03-04 05:50:55,281 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57542e17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 05:50:55, skipping insertion in model container [2025-03-04 05:50:55,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 05:50:55" (3/3) ... [2025-03-04 05:50:55,282 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i [2025-03-04 05:50:55,295 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 05:50:55,299 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i that has 70 procedures, 1312 locations, 1 initial locations, 4 loop locations, and 27 error locations. [2025-03-04 05:50:55,381 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 05:50:55,391 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;@7005788e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 05:50:55,391 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2025-03-04 05:50:55,397 INFO L276 IsEmpty]: Start isEmpty. Operand has 1311 states, 881 states have (on average 1.2883087400681044) internal successors, (1135), 944 states have internal predecessors, (1135), 334 states have call successors, (334), 69 states have call predecessors, (334), 68 states have return successors, (329), 323 states have call predecessors, (329), 329 states have call successors, (329) [2025-03-04 05:50:55,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-04 05:50:55,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:50:55,408 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:50:55,408 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:50:55,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:50:55,412 INFO L85 PathProgramCache]: Analyzing trace with hash -428414472, now seen corresponding path program 1 times [2025-03-04 05:50:55,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:50:55,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048392513] [2025-03-04 05:50:55,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:50:55,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:50:57,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 05:50:58,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 05:50:58,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:50:58,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:50:59,310 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:50:59,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:50:59,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048392513] [2025-03-04 05:50:59,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048392513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:50:59,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:50:59,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:50:59,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131306390] [2025-03-04 05:50:59,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:50:59,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:50:59,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:50:59,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:50:59,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:50:59,338 INFO L87 Difference]: Start difference. First operand has 1311 states, 881 states have (on average 1.2883087400681044) internal successors, (1135), 944 states have internal predecessors, (1135), 334 states have call successors, (334), 69 states have call predecessors, (334), 68 states have return successors, (329), 323 states have call predecessors, (329), 329 states have call successors, (329) Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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:50:59,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:50:59,835 INFO L93 Difference]: Finished difference Result 2591 states and 3612 transitions. [2025-03-04 05:50:59,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:50:59,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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 64 [2025-03-04 05:50:59,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:50:59,856 INFO L225 Difference]: With dead ends: 2591 [2025-03-04 05:50:59,857 INFO L226 Difference]: Without dead ends: 1293 [2025-03-04 05:50:59,869 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:50:59,871 INFO L435 NwaCegarLoop]: 1751 mSDtfsCounter, 1736 mSDsluCounter, 1750 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1736 SdHoareTripleChecker+Valid, 3501 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.2s IncrementalHoareTripleChecker+Time [2025-03-04 05:50:59,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1736 Valid, 3501 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 05:50:59,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2025-03-04 05:51:00,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 1293. [2025-03-04 05:51:00,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1293 states, 871 states have (on average 1.251435132032147) internal successors, (1090), 929 states have internal predecessors, (1090), 329 states have call successors, (329), 68 states have call predecessors, (329), 67 states have return successors, (327), 321 states have call predecessors, (327), 327 states have call successors, (327) [2025-03-04 05:51:00,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1293 states and 1746 transitions. [2025-03-04 05:51:00,027 INFO L78 Accepts]: Start accepts. Automaton has 1293 states and 1746 transitions. Word has length 64 [2025-03-04 05:51:00,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:51:00,029 INFO L471 AbstractCegarLoop]: Abstraction has 1293 states and 1746 transitions. [2025-03-04 05:51:00,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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:51:00,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1746 transitions. [2025-03-04 05:51:00,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 05:51:00,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:51:00,033 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:51:00,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 05:51:00,034 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:51:00,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:51:00,034 INFO L85 PathProgramCache]: Analyzing trace with hash 701722750, now seen corresponding path program 1 times [2025-03-04 05:51:00,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:51:00,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965512705] [2025-03-04 05:51:00,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:51:00,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:51:02,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 05:51:02,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 05:51:02,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:51:02,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:51:02,896 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:51:02,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:51:02,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965512705] [2025-03-04 05:51:02,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965512705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:51:02,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:51:02,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:51:02,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963411687] [2025-03-04 05:51:02,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:51:02,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:51:02,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:51:02,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:51:02,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:51:02,898 INFO L87 Difference]: Start difference. First operand 1293 states and 1746 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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:51:03,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:51:03,244 INFO L93 Difference]: Finished difference Result 1293 states and 1746 transitions. [2025-03-04 05:51:03,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:51:03,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 70 [2025-03-04 05:51:03,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:51:03,255 INFO L225 Difference]: With dead ends: 1293 [2025-03-04 05:51:03,255 INFO L226 Difference]: Without dead ends: 1291 [2025-03-04 05:51:03,256 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:51:03,257 INFO L435 NwaCegarLoop]: 1731 mSDtfsCounter, 1715 mSDsluCounter, 1730 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1715 SdHoareTripleChecker+Valid, 3461 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.2s IncrementalHoareTripleChecker+Time [2025-03-04 05:51:03,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1715 Valid, 3461 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 05:51:03,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2025-03-04 05:51:03,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1291. [2025-03-04 05:51:03,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 870 states have (on average 1.2505747126436781) internal successors, (1088), 927 states have internal predecessors, (1088), 329 states have call successors, (329), 68 states have call predecessors, (329), 67 states have return successors, (327), 321 states have call predecessors, (327), 327 states have call successors, (327) [2025-03-04 05:51:03,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1744 transitions. [2025-03-04 05:51:03,334 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1744 transitions. Word has length 70 [2025-03-04 05:51:03,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:51:03,337 INFO L471 AbstractCegarLoop]: Abstraction has 1291 states and 1744 transitions. [2025-03-04 05:51:03,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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:51:03,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1744 transitions. [2025-03-04 05:51:03,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-04 05:51:03,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:51:03,341 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:51:03,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 05:51:03,341 INFO L396 AbstractCegarLoop]: === Iteration 3 === 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:51:03,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:51:03,342 INFO L85 PathProgramCache]: Analyzing trace with hash -2133822674, now seen corresponding path program 1 times [2025-03-04 05:51:03,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:51:03,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307754659] [2025-03-04 05:51:03,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:51:03,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:51:05,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 05:51:05,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 05:51:05,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:51:05,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:51:06,281 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:51:06,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:51:06,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307754659] [2025-03-04 05:51:06,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307754659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:51:06,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:51:06,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:51:06,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955575214] [2025-03-04 05:51:06,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:51:06,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:51:06,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:51:06,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:51:06,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:51:06,282 INFO L87 Difference]: Start difference. First operand 1291 states and 1744 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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:51:06,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:51:06,638 INFO L93 Difference]: Finished difference Result 1291 states and 1744 transitions. [2025-03-04 05:51:06,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:51:06,639 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 76 [2025-03-04 05:51:06,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:51:06,648 INFO L225 Difference]: With dead ends: 1291 [2025-03-04 05:51:06,648 INFO L226 Difference]: Without dead ends: 1289 [2025-03-04 05:51:06,649 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:51:06,651 INFO L435 NwaCegarLoop]: 1729 mSDtfsCounter, 1712 mSDsluCounter, 1728 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1712 SdHoareTripleChecker+Valid, 3457 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.2s IncrementalHoareTripleChecker+Time [2025-03-04 05:51:06,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1712 Valid, 3457 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 05:51:06,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2025-03-04 05:51:06,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1289. [2025-03-04 05:51:06,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 869 states have (on average 1.2497123130034522) internal successors, (1086), 925 states have internal predecessors, (1086), 329 states have call successors, (329), 68 states have call predecessors, (329), 67 states have return successors, (327), 321 states have call predecessors, (327), 327 states have call successors, (327) [2025-03-04 05:51:06,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1742 transitions. [2025-03-04 05:51:06,713 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1742 transitions. Word has length 76 [2025-03-04 05:51:06,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:51:06,713 INFO L471 AbstractCegarLoop]: Abstraction has 1289 states and 1742 transitions. [2025-03-04 05:51:06,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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:51:06,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1742 transitions. [2025-03-04 05:51:06,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 05:51:06,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:51:06,717 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:51:06,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 05:51:06,717 INFO L396 AbstractCegarLoop]: === Iteration 4 === 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:51:06,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:51:06,718 INFO L85 PathProgramCache]: Analyzing trace with hash 252568396, now seen corresponding path program 1 times [2025-03-04 05:51:06,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:51:06,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222273895] [2025-03-04 05:51:06,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:51:06,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:51:08,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 05:51:08,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 05:51:08,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:51:08,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:51:09,311 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:51:09,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:51:09,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222273895] [2025-03-04 05:51:09,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222273895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:51:09,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:51:09,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:51:09,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531272696] [2025-03-04 05:51:09,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:51:09,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:51:09,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:51:09,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:51:09,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:51:09,315 INFO L87 Difference]: Start difference. First operand 1289 states and 1742 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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:51:09,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:51:09,604 INFO L93 Difference]: Finished difference Result 1289 states and 1742 transitions. [2025-03-04 05:51:09,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:51:09,605 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 82 [2025-03-04 05:51:09,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:51:09,611 INFO L225 Difference]: With dead ends: 1289 [2025-03-04 05:51:09,611 INFO L226 Difference]: Without dead ends: 1287 [2025-03-04 05:51:09,612 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:51:09,612 INFO L435 NwaCegarLoop]: 1727 mSDtfsCounter, 1709 mSDsluCounter, 1726 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1709 SdHoareTripleChecker+Valid, 3453 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.2s IncrementalHoareTripleChecker+Time [2025-03-04 05:51:09,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1709 Valid, 3453 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 05:51:09,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2025-03-04 05:51:09,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1287. [2025-03-04 05:51:09,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1287 states, 868 states have (on average 1.2488479262672811) internal successors, (1084), 923 states have internal predecessors, (1084), 329 states have call successors, (329), 68 states have call predecessors, (329), 67 states have return successors, (327), 321 states have call predecessors, (327), 327 states have call successors, (327) [2025-03-04 05:51:09,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 1740 transitions. [2025-03-04 05:51:09,655 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 1740 transitions. Word has length 82 [2025-03-04 05:51:09,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:51:09,655 INFO L471 AbstractCegarLoop]: Abstraction has 1287 states and 1740 transitions. [2025-03-04 05:51:09,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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:51:09,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1740 transitions. [2025-03-04 05:51:09,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-04 05:51:09,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:51:09,657 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:51:09,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 05:51:09,657 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2025-03-04 05:51:09,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:51:09,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1756845639, now seen corresponding path program 1 times [2025-03-04 05:51:09,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:51:09,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045142059] [2025-03-04 05:51:09,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:51:09,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:51:11,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 05:51:11,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 05:51:11,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:51:11,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:51:12,199 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:51:12,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:51:12,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045142059] [2025-03-04 05:51:12,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045142059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:51:12,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:51:12,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:51:12,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213509256] [2025-03-04 05:51:12,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:51:12,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:51:12,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:51:12,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:51:12,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:51:12,201 INFO L87 Difference]: Start difference. First operand 1287 states and 1740 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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:51:12,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:51:12,515 INFO L93 Difference]: Finished difference Result 1287 states and 1740 transitions. [2025-03-04 05:51:12,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:51:12,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 88 [2025-03-04 05:51:12,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:51:12,521 INFO L225 Difference]: With dead ends: 1287 [2025-03-04 05:51:12,521 INFO L226 Difference]: Without dead ends: 1285 [2025-03-04 05:51:12,522 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:51:12,523 INFO L435 NwaCegarLoop]: 1725 mSDtfsCounter, 1706 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1706 SdHoareTripleChecker+Valid, 3449 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.2s IncrementalHoareTripleChecker+Time [2025-03-04 05:51:12,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1706 Valid, 3449 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 05:51:12,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2025-03-04 05:51:12,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1285. [2025-03-04 05:51:12,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1285 states, 867 states have (on average 1.2479815455594003) internal successors, (1082), 921 states have internal predecessors, (1082), 329 states have call successors, (329), 68 states have call predecessors, (329), 67 states have return successors, (327), 321 states have call predecessors, (327), 327 states have call successors, (327) [2025-03-04 05:51:12,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 1738 transitions. [2025-03-04 05:51:12,574 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 1738 transitions. Word has length 88 [2025-03-04 05:51:12,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:51:12,575 INFO L471 AbstractCegarLoop]: Abstraction has 1285 states and 1738 transitions. [2025-03-04 05:51:12,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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:51:12,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1738 transitions. [2025-03-04 05:51:12,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 05:51:12,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:51:12,578 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:51:12,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 05:51:12,578 INFO L396 AbstractCegarLoop]: === Iteration 6 === 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:51:12,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:51:12,579 INFO L85 PathProgramCache]: Analyzing trace with hash -547908295, now seen corresponding path program 1 times [2025-03-04 05:51:12,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:51:12,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093829796] [2025-03-04 05:51:12,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:51:12,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:51:14,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 05:51:14,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 05:51:14,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:51:14,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:51:15,374 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:51:15,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:51:15,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093829796] [2025-03-04 05:51:15,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093829796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:51:15,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:51:15,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:51:15,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970971807] [2025-03-04 05:51:15,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:51:15,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:51:15,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:51:15,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:51:15,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:51:15,377 INFO L87 Difference]: Start difference. First operand 1285 states and 1738 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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:51:15,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:51:15,713 INFO L93 Difference]: Finished difference Result 1285 states and 1738 transitions. [2025-03-04 05:51:15,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:51:15,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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 94 [2025-03-04 05:51:15,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:51:15,720 INFO L225 Difference]: With dead ends: 1285 [2025-03-04 05:51:15,720 INFO L226 Difference]: Without dead ends: 1283 [2025-03-04 05:51:15,721 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:51:15,721 INFO L435 NwaCegarLoop]: 1723 mSDtfsCounter, 1703 mSDsluCounter, 1722 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1703 SdHoareTripleChecker+Valid, 3445 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.2s IncrementalHoareTripleChecker+Time [2025-03-04 05:51:15,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1703 Valid, 3445 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 05:51:15,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2025-03-04 05:51:15,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1283. [2025-03-04 05:51:15,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1283 states, 866 states have (on average 1.2471131639722863) internal successors, (1080), 919 states have internal predecessors, (1080), 329 states have call successors, (329), 68 states have call predecessors, (329), 67 states have return successors, (327), 321 states have call predecessors, (327), 327 states have call successors, (327) [2025-03-04 05:51:15,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1736 transitions. [2025-03-04 05:51:15,779 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1736 transitions. Word has length 94 [2025-03-04 05:51:15,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:51:15,779 INFO L471 AbstractCegarLoop]: Abstraction has 1283 states and 1736 transitions. [2025-03-04 05:51:15,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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:51:15,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1736 transitions. [2025-03-04 05:51:15,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 05:51:15,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:51:15,782 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:51:15,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 05:51:15,782 INFO L396 AbstractCegarLoop]: === Iteration 7 === 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:51:15,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:51:15,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1222297563, now seen corresponding path program 1 times [2025-03-04 05:51:15,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:51:15,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098368479] [2025-03-04 05:51:15,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:51:15,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:51:17,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 05:51:17,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 05:51:17,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:51:17,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:51:18,510 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:51:18,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:51:18,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098368479] [2025-03-04 05:51:18,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098368479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:51:18,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:51:18,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:51:18,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277550030] [2025-03-04 05:51:18,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:51:18,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:51:18,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:51:18,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:51:18,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:51:18,512 INFO L87 Difference]: Start difference. First operand 1283 states and 1736 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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:51:19,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:51:19,146 INFO L93 Difference]: Finished difference Result 2536 states and 3433 transitions. [2025-03-04 05:51:19,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:51:19,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 100 [2025-03-04 05:51:19,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:51:19,157 INFO L225 Difference]: With dead ends: 2536 [2025-03-04 05:51:19,157 INFO L226 Difference]: Without dead ends: 2534 [2025-03-04 05:51:19,159 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:51:19,161 INFO L435 NwaCegarLoop]: 1736 mSDtfsCounter, 1687 mSDsluCounter, 3424 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1687 SdHoareTripleChecker+Valid, 5160 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 05:51:19,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1687 Valid, 5160 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 05:51:19,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2534 states. [2025-03-04 05:51:19,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2534 to 2397. [2025-03-04 05:51:19,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2397 states, 1636 states have (on average 1.2512224938875305) internal successors, (2047), 1722 states have internal predecessors, (2047), 620 states have call successors, (620), 121 states have call predecessors, (620), 120 states have return successors, (618), 604 states have call predecessors, (618), 618 states have call successors, (618) [2025-03-04 05:51:19,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2397 states to 2397 states and 3285 transitions. [2025-03-04 05:51:19,280 INFO L78 Accepts]: Start accepts. Automaton has 2397 states and 3285 transitions. Word has length 100 [2025-03-04 05:51:19,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:51:19,281 INFO L471 AbstractCegarLoop]: Abstraction has 2397 states and 3285 transitions. [2025-03-04 05:51:19,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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:51:19,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2397 states and 3285 transitions. [2025-03-04 05:51:19,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 05:51:19,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:51:19,283 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:51:19,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 05:51:19,283 INFO L396 AbstractCegarLoop]: === Iteration 8 === 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:51:19,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:51:19,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1408675803, now seen corresponding path program 1 times [2025-03-04 05:51:19,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:51:19,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739229000] [2025-03-04 05:51:19,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:51:19,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:51:21,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 05:51:21,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 05:51:21,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:51:21,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:51:22,087 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:51:22,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:51:22,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739229000] [2025-03-04 05:51:22,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739229000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:51:22,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:51:22,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:51:22,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661464975] [2025-03-04 05:51:22,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:51:22,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:51:22,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:51:22,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:51:22,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:51:22,088 INFO L87 Difference]: Start difference. First operand 2397 states and 3285 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:51:22,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:51:22,530 INFO L93 Difference]: Finished difference Result 2397 states and 3285 transitions. [2025-03-04 05:51:22,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:51:22,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:51:22,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:51:22,544 INFO L225 Difference]: With dead ends: 2397 [2025-03-04 05:51:22,544 INFO L226 Difference]: Without dead ends: 2395 [2025-03-04 05:51:22,548 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:51:22,548 INFO L435 NwaCegarLoop]: 1721 mSDtfsCounter, 1699 mSDsluCounter, 1720 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1699 SdHoareTripleChecker+Valid, 3441 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.2s IncrementalHoareTripleChecker+Time [2025-03-04 05:51:22,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1699 Valid, 3441 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 05:51:22,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2395 states. [2025-03-04 05:51:22,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2395 to 2395. [2025-03-04 05:51:22,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2395 states, 1635 states have (on average 1.2507645259938838) internal successors, (2045), 1720 states have internal predecessors, (2045), 620 states have call successors, (620), 121 states have call predecessors, (620), 120 states have return successors, (618), 604 states have call predecessors, (618), 618 states have call successors, (618) [2025-03-04 05:51:22,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2395 states to 2395 states and 3283 transitions. [2025-03-04 05:51:22,708 INFO L78 Accepts]: Start accepts. Automaton has 2395 states and 3283 transitions. Word has length 106 [2025-03-04 05:51:22,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:51:22,708 INFO L471 AbstractCegarLoop]: Abstraction has 2395 states and 3283 transitions. [2025-03-04 05:51:22,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:51:22,708 INFO L276 IsEmpty]: Start isEmpty. Operand 2395 states and 3283 transitions. [2025-03-04 05:51:22,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-04 05:51:22,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:51:22,711 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:51:22,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 05:51:22,712 INFO L396 AbstractCegarLoop]: === Iteration 9 === 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:51:22,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:51:22,712 INFO L85 PathProgramCache]: Analyzing trace with hash 822792982, now seen corresponding path program 1 times [2025-03-04 05:51:22,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:51:22,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707294567] [2025-03-04 05:51:22,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:51:22,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:51:24,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 05:51:24,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 05:51:24,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:51:24,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:51:25,394 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:51:25,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:51:25,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707294567] [2025-03-04 05:51:25,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707294567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:51:25,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:51:25,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:51:25,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849217494] [2025-03-04 05:51:25,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:51:25,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:51:25,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:51:25,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:51:25,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:51:25,396 INFO L87 Difference]: Start difference. First operand 2395 states and 3283 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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:51:25,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:51:25,749 INFO L93 Difference]: Finished difference Result 2395 states and 3283 transitions. [2025-03-04 05:51:25,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:51:25,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 108 [2025-03-04 05:51:25,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:51:25,763 INFO L225 Difference]: With dead ends: 2395 [2025-03-04 05:51:25,763 INFO L226 Difference]: Without dead ends: 2393 [2025-03-04 05:51:25,766 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:51:25,768 INFO L435 NwaCegarLoop]: 1719 mSDtfsCounter, 1695 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1695 SdHoareTripleChecker+Valid, 3437 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.2s IncrementalHoareTripleChecker+Time [2025-03-04 05:51:25,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1695 Valid, 3437 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 05:51:25,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2393 states. [2025-03-04 05:51:25,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2393 to 2393. [2025-03-04 05:51:25,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2393 states, 1634 states have (on average 1.2503059975520197) internal successors, (2043), 1718 states have internal predecessors, (2043), 620 states have call successors, (620), 121 states have call predecessors, (620), 120 states have return successors, (618), 604 states have call predecessors, (618), 618 states have call successors, (618) [2025-03-04 05:51:25,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2393 states to 2393 states and 3281 transitions. [2025-03-04 05:51:25,885 INFO L78 Accepts]: Start accepts. Automaton has 2393 states and 3281 transitions. Word has length 108 [2025-03-04 05:51:25,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:51:25,886 INFO L471 AbstractCegarLoop]: Abstraction has 2393 states and 3281 transitions. [2025-03-04 05:51:25,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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:51:25,886 INFO L276 IsEmpty]: Start isEmpty. Operand 2393 states and 3281 transitions. [2025-03-04 05:51:25,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 05:51:25,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:51:25,888 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:51:25,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 05:51:25,888 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_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:25,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:51:25,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1782147909, now seen corresponding path program 1 times [2025-03-04 05:51:25,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:51:25,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132135096] [2025-03-04 05:51:25,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:51:25,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:51:28,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 05:51:28,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 05:51:28,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:51:28,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:51:28,377 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 05:51:28,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:51:28,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132135096] [2025-03-04 05:51:28,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132135096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:51:28,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:51:28,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 05:51:28,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491935456] [2025-03-04 05:51:28,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:51:28,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 05:51:28,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:51:28,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 05:51:28,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 05:51:28,378 INFO L87 Difference]: Start difference. First operand 2393 states and 3281 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, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 05:51:28,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:51:28,638 INFO L93 Difference]: Finished difference Result 4099 states and 5558 transitions. [2025-03-04 05:51:28,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 05:51:28,639 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, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 129 [2025-03-04 05:51:28,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:51:28,652 INFO L225 Difference]: With dead ends: 4099 [2025-03-04 05:51:28,652 INFO L226 Difference]: Without dead ends: 2387 [2025-03-04 05:51:28,659 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:51:28,660 INFO L435 NwaCegarLoop]: 1715 mSDtfsCounter, 1717 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1717 SdHoareTripleChecker+Valid, 1715 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 05:51:28,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1717 Valid, 1715 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 05:51:28,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2387 states. [2025-03-04 05:51:28,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2387 to 2387. [2025-03-04 05:51:28,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2387 states, 1629 states have (on average 1.2486187845303867) internal successors, (2034), 1712 states have internal predecessors, (2034), 620 states have call successors, (620), 121 states have call predecessors, (620), 120 states have return successors, (618), 604 states have call predecessors, (618), 618 states have call successors, (618) [2025-03-04 05:51:28,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2387 states to 2387 states and 3272 transitions. [2025-03-04 05:51:28,808 INFO L78 Accepts]: Start accepts. Automaton has 2387 states and 3272 transitions. Word has length 129 [2025-03-04 05:51:28,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:51:28,809 INFO L471 AbstractCegarLoop]: Abstraction has 2387 states and 3272 transitions. [2025-03-04 05:51:28,809 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, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 05:51:28,809 INFO L276 IsEmpty]: Start isEmpty. Operand 2387 states and 3272 transitions. [2025-03-04 05:51:28,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-04 05:51:28,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:51:28,811 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:51:28,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 05:51:28,811 INFO L396 AbstractCegarLoop]: === Iteration 11 === 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:51:28,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:51:28,812 INFO L85 PathProgramCache]: Analyzing trace with hash 340277006, now seen corresponding path program 1 times [2025-03-04 05:51:28,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:51:28,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628290490] [2025-03-04 05:51:28,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:51:28,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:51:30,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 05:51:30,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 05:51:30,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:51:30,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:51:31,334 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:51:31,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:51:31,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628290490] [2025-03-04 05:51:31,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628290490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:51:31,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:51:31,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:51:31,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136947637] [2025-03-04 05:51:31,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:51:31,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:51:31,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:51:31,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:51:31,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:51:31,336 INFO L87 Difference]: Start difference. First operand 2387 states and 3272 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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:51:31,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:51:31,685 INFO L93 Difference]: Finished difference Result 2387 states and 3272 transitions. [2025-03-04 05:51:31,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:51:31,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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 114 [2025-03-04 05:51:31,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:51:31,697 INFO L225 Difference]: With dead ends: 2387 [2025-03-04 05:51:31,698 INFO L226 Difference]: Without dead ends: 2385 [2025-03-04 05:51:31,700 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:51:31,700 INFO L435 NwaCegarLoop]: 1712 mSDtfsCounter, 1689 mSDsluCounter, 1711 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1689 SdHoareTripleChecker+Valid, 3423 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.2s IncrementalHoareTripleChecker+Time [2025-03-04 05:51:31,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1689 Valid, 3423 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 05:51:31,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states. [2025-03-04 05:51:31,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 2385. [2025-03-04 05:51:31,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2385 states, 1628 states have (on average 1.2481572481572483) internal successors, (2032), 1710 states have internal predecessors, (2032), 620 states have call successors, (620), 121 states have call predecessors, (620), 120 states have return successors, (618), 604 states have call predecessors, (618), 618 states have call successors, (618) [2025-03-04 05:51:31,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2385 states to 2385 states and 3270 transitions. [2025-03-04 05:51:31,822 INFO L78 Accepts]: Start accepts. Automaton has 2385 states and 3270 transitions. Word has length 114 [2025-03-04 05:51:31,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:51:31,825 INFO L471 AbstractCegarLoop]: Abstraction has 2385 states and 3270 transitions. [2025-03-04 05:51:31,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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:51:31,825 INFO L276 IsEmpty]: Start isEmpty. Operand 2385 states and 3270 transitions. [2025-03-04 05:51:31,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 05:51:31,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:51:31,827 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:51:31,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 05:51:31,827 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_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:31,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:51:31,827 INFO L85 PathProgramCache]: Analyzing trace with hash 783838916, now seen corresponding path program 1 times [2025-03-04 05:51:31,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:51:31,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239772640] [2025-03-04 05:51:31,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:51:31,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:51:33,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 05:51:34,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 05:51:34,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:51:34,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:51:34,530 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 05:51:34,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:51:34,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239772640] [2025-03-04 05:51:34,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239772640] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:51:34,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624176488] [2025-03-04 05:51:34,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:51:34,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:51:34,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:51:34,533 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:51:34,534 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:51:37,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 05:51:37,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 05:51:37,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:51:37,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:51:37,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 3384 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 05:51:37,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 05:51:37,974 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 05:51:37,974 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 05:51:37,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624176488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:51:37,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 05:51:37,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-04 05:51:37,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131409400] [2025-03-04 05:51:37,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:51:37,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 05:51:37,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:51:37,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 05:51:37,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 05:51:37,976 INFO L87 Difference]: Start difference. First operand 2385 states and 3270 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 05:51:38,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:51:38,212 INFO L93 Difference]: Finished difference Result 4083 states and 5536 transitions. [2025-03-04 05:51:38,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 05:51:38,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 135 [2025-03-04 05:51:38,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:51:38,224 INFO L225 Difference]: With dead ends: 4083 [2025-03-04 05:51:38,225 INFO L226 Difference]: Without dead ends: 2379 [2025-03-04 05:51:38,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 05:51:38,232 INFO L435 NwaCegarLoop]: 1708 mSDtfsCounter, 1705 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1705 SdHoareTripleChecker+Valid, 1708 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:51:38,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1705 Valid, 1708 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:51:38,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2379 states. [2025-03-04 05:51:38,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2379 to 2379. [2025-03-04 05:51:38,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2379 states, 1623 states have (on average 1.246457178065311) internal successors, (2023), 1704 states have internal predecessors, (2023), 620 states have call successors, (620), 121 states have call predecessors, (620), 120 states have return successors, (618), 604 states have call predecessors, (618), 618 states have call successors, (618) [2025-03-04 05:51:38,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2379 states to 2379 states and 3261 transitions. [2025-03-04 05:51:38,356 INFO L78 Accepts]: Start accepts. Automaton has 2379 states and 3261 transitions. Word has length 135 [2025-03-04 05:51:38,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:51:38,356 INFO L471 AbstractCegarLoop]: Abstraction has 2379 states and 3261 transitions. [2025-03-04 05:51:38,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 05:51:38,357 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 3261 transitions. [2025-03-04 05:51:38,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 05:51:38,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:51:38,359 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:51:38,376 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:51:38,559 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,SelfDestructingSolverStorable11 [2025-03-04 05:51:38,560 INFO L396 AbstractCegarLoop]: === Iteration 13 === 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:51:38,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:51:38,560 INFO L85 PathProgramCache]: Analyzing trace with hash -503106413, now seen corresponding path program 1 times [2025-03-04 05:51:38,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:51:38,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920003422] [2025-03-04 05:51:38,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:51:38,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:51:40,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 05:51:40,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 05:51:40,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:51:40,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:51:41,049 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:51:41,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:51:41,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920003422] [2025-03-04 05:51:41,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920003422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:51:41,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:51:41,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:51:41,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621863796] [2025-03-04 05:51:41,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:51:41,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:51:41,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:51:41,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:51:41,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:51:41,050 INFO L87 Difference]: Start difference. First operand 2379 states and 3261 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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:51:41,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:51:41,416 INFO L93 Difference]: Finished difference Result 2379 states and 3261 transitions. [2025-03-04 05:51:41,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:51:41,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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 120 [2025-03-04 05:51:41,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:51:41,427 INFO L225 Difference]: With dead ends: 2379 [2025-03-04 05:51:41,427 INFO L226 Difference]: Without dead ends: 2377 [2025-03-04 05:51:41,429 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:51:41,430 INFO L435 NwaCegarLoop]: 1705 mSDtfsCounter, 1681 mSDsluCounter, 1704 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1681 SdHoareTripleChecker+Valid, 3409 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.2s IncrementalHoareTripleChecker+Time [2025-03-04 05:51:41,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1681 Valid, 3409 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 05:51:41,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2377 states. [2025-03-04 05:51:41,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2377 to 2377. [2025-03-04 05:51:41,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2377 states, 1622 states have (on average 1.245992601726264) internal successors, (2021), 1702 states have internal predecessors, (2021), 620 states have call successors, (620), 121 states have call predecessors, (620), 120 states have return successors, (618), 604 states have call predecessors, (618), 618 states have call successors, (618) [2025-03-04 05:51:41,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 2377 states and 3259 transitions. [2025-03-04 05:51:41,556 INFO L78 Accepts]: Start accepts. Automaton has 2377 states and 3259 transitions. Word has length 120 [2025-03-04 05:51:41,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:51:41,556 INFO L471 AbstractCegarLoop]: Abstraction has 2377 states and 3259 transitions. [2025-03-04 05:51:41,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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:51:41,557 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 3259 transitions. [2025-03-04 05:51:41,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-04 05:51:41,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:51:41,558 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:51:41,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 05:51:41,559 INFO L396 AbstractCegarLoop]: === Iteration 14 === 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:51:41,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:51:41,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1656856128, now seen corresponding path program 1 times [2025-03-04 05:51:41,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:51:41,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270221848] [2025-03-04 05:51:41,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:51:41,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:51:43,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-04 05:51:43,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 05:51:43,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:51:43,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:51:44,031 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:51:44,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:51:44,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270221848] [2025-03-04 05:51:44,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270221848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:51:44,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:51:44,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:51:44,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702370118] [2025-03-04 05:51:44,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:51:44,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:51:44,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:51:44,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:51:44,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:51:44,033 INFO L87 Difference]: Start difference. First operand 2377 states and 3259 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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:51:44,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:51:44,393 INFO L93 Difference]: Finished difference Result 2377 states and 3259 transitions. [2025-03-04 05:51:44,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:51:44,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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 126 [2025-03-04 05:51:44,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:51:44,414 INFO L225 Difference]: With dead ends: 2377 [2025-03-04 05:51:44,416 INFO L226 Difference]: Without dead ends: 2375 [2025-03-04 05:51:44,418 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:51:44,418 INFO L435 NwaCegarLoop]: 1703 mSDtfsCounter, 1678 mSDsluCounter, 1702 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1678 SdHoareTripleChecker+Valid, 3405 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.2s IncrementalHoareTripleChecker+Time [2025-03-04 05:51:44,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1678 Valid, 3405 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 05:51:44,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2375 states. [2025-03-04 05:51:44,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2375 to 2375. [2025-03-04 05:51:44,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2375 states, 1621 states have (on average 1.2455274521900062) internal successors, (2019), 1700 states have internal predecessors, (2019), 620 states have call successors, (620), 121 states have call predecessors, (620), 120 states have return successors, (618), 604 states have call predecessors, (618), 618 states have call successors, (618) [2025-03-04 05:51:44,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2375 states and 3257 transitions. [2025-03-04 05:51:44,537 INFO L78 Accepts]: Start accepts. Automaton has 2375 states and 3257 transitions. Word has length 126 [2025-03-04 05:51:44,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:51:44,537 INFO L471 AbstractCegarLoop]: Abstraction has 2375 states and 3257 transitions. [2025-03-04 05:51:44,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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:51:44,538 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 3257 transitions. [2025-03-04 05:51:44,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 05:51:44,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:51:44,540 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:51:44,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 05:51:44,540 INFO L396 AbstractCegarLoop]: === Iteration 15 === 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:51:44,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:51:44,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1713767173, now seen corresponding path program 1 times [2025-03-04 05:51:44,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:51:44,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530835669] [2025-03-04 05:51:44,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:51:44,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:51:46,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 05:51:46,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 05:51:46,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:51:46,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:51:47,016 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:51:47,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:51:47,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530835669] [2025-03-04 05:51:47,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530835669] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:51:47,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:51:47,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:51:47,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742804421] [2025-03-04 05:51:47,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:51:47,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:51:47,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:51:47,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:51:47,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:51:47,018 INFO L87 Difference]: Start difference. First operand 2375 states and 3257 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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:51:47,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:51:47,387 INFO L93 Difference]: Finished difference Result 2375 states and 3257 transitions. [2025-03-04 05:51:47,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:51:47,388 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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 132 [2025-03-04 05:51:47,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:51:47,400 INFO L225 Difference]: With dead ends: 2375 [2025-03-04 05:51:47,400 INFO L226 Difference]: Without dead ends: 2373 [2025-03-04 05:51:47,402 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:51:47,402 INFO L435 NwaCegarLoop]: 1701 mSDtfsCounter, 1675 mSDsluCounter, 1700 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1675 SdHoareTripleChecker+Valid, 3401 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.2s IncrementalHoareTripleChecker+Time [2025-03-04 05:51:47,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1675 Valid, 3401 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 05:51:47,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2025-03-04 05:51:47,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 2373. [2025-03-04 05:51:47,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2373 states, 1620 states have (on average 1.2450617283950618) internal successors, (2017), 1698 states have internal predecessors, (2017), 620 states have call successors, (620), 121 states have call predecessors, (620), 120 states have return successors, (618), 604 states have call predecessors, (618), 618 states have call successors, (618) [2025-03-04 05:51:47,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2373 states to 2373 states and 3255 transitions. [2025-03-04 05:51:47,520 INFO L78 Accepts]: Start accepts. Automaton has 2373 states and 3255 transitions. Word has length 132 [2025-03-04 05:51:47,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:51:47,521 INFO L471 AbstractCegarLoop]: Abstraction has 2373 states and 3255 transitions. [2025-03-04 05:51:47,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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:51:47,521 INFO L276 IsEmpty]: Start isEmpty. Operand 2373 states and 3255 transitions. [2025-03-04 05:51:47,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-04 05:51:47,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:51:47,523 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 05:51:47,523 INFO L396 AbstractCegarLoop]: === Iteration 16 === 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:51:47,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:51:47,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1003320622, now seen corresponding path program 1 times [2025-03-04 05:51:47,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:51:47,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671139516] [2025-03-04 05:51:47,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:51:47,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:51:49,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-04 05:51:49,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-04 05:51:49,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:51:49,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:51:49,984 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:51:49,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:51:49,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671139516] [2025-03-04 05:51:49,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671139516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:51:49,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:51:49,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:51:49,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470340519] [2025-03-04 05:51:49,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:51:49,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:51:49,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:51:49,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:51:49,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:51:49,986 INFO L87 Difference]: Start difference. First operand 2373 states and 3255 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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:51:50,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:51:50,370 INFO L93 Difference]: Finished difference Result 2373 states and 3255 transitions. [2025-03-04 05:51:50,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:51:50,370 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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 138 [2025-03-04 05:51:50,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:51:50,379 INFO L225 Difference]: With dead ends: 2373 [2025-03-04 05:51:50,379 INFO L226 Difference]: Without dead ends: 2371 [2025-03-04 05:51:50,380 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:51:50,380 INFO L435 NwaCegarLoop]: 1699 mSDtfsCounter, 1672 mSDsluCounter, 1698 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1672 SdHoareTripleChecker+Valid, 3397 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.2s IncrementalHoareTripleChecker+Time [2025-03-04 05:51:50,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1672 Valid, 3397 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 05:51:50,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2371 states. [2025-03-04 05:51:50,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2371 to 2371. [2025-03-04 05:51:50,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2371 states, 1619 states have (on average 1.2445954292773316) internal successors, (2015), 1696 states have internal predecessors, (2015), 620 states have call successors, (620), 121 states have call predecessors, (620), 120 states have return successors, (618), 604 states have call predecessors, (618), 618 states have call successors, (618) [2025-03-04 05:51:50,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2371 states to 2371 states and 3253 transitions. [2025-03-04 05:51:50,507 INFO L78 Accepts]: Start accepts. Automaton has 2371 states and 3253 transitions. Word has length 138 [2025-03-04 05:51:50,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:51:50,508 INFO L471 AbstractCegarLoop]: Abstraction has 2371 states and 3253 transitions. [2025-03-04 05:51:50,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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:51:50,508 INFO L276 IsEmpty]: Start isEmpty. Operand 2371 states and 3253 transitions. [2025-03-04 05:51:50,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-04 05:51:50,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:51:50,512 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:51:50,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 05:51:50,512 INFO L396 AbstractCegarLoop]: === Iteration 17 === 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:51:50,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:51:50,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1692857434, now seen corresponding path program 1 times [2025-03-04 05:51:50,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:51:50,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458748829] [2025-03-04 05:51:50,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:51:50,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:51:52,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-04 05:51:52,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-04 05:51:52,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:51:52,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:51:53,807 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2025-03-04 05:51:53,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:51:53,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458748829] [2025-03-04 05:51:53,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458748829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:51:53,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:51:53,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 05:51:53,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807888573] [2025-03-04 05:51:53,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:51:53,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 05:51:53,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:51:53,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 05:51:53,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:51:53,809 INFO L87 Difference]: Start difference. First operand 2371 states and 3253 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 05:51:54,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:51:54,590 INFO L93 Difference]: Finished difference Result 3548 states and 4832 transitions. [2025-03-04 05:51:54,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 05:51:54,591 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 183 [2025-03-04 05:51:54,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:51:54,604 INFO L225 Difference]: With dead ends: 3548 [2025-03-04 05:51:54,604 INFO L226 Difference]: Without dead ends: 3546 [2025-03-04 05:51:54,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 05:51:54,607 INFO L435 NwaCegarLoop]: 1955 mSDtfsCounter, 1660 mSDsluCounter, 4724 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1661 SdHoareTripleChecker+Valid, 6679 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 05:51:54,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1661 Valid, 6679 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 05:51:54,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3546 states. [2025-03-04 05:51:54,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3546 to 3501. [2025-03-04 05:51:54,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3501 states, 2379 states have (on average 1.2416981925178647) internal successors, (2954), 2494 states have internal predecessors, (2954), 908 states have call successors, (908), 203 states have call predecessors, (908), 202 states have return successors, (926), 884 states have call predecessors, (926), 906 states have call successors, (926) [2025-03-04 05:51:54,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3501 states to 3501 states and 4788 transitions. [2025-03-04 05:51:54,810 INFO L78 Accepts]: Start accepts. Automaton has 3501 states and 4788 transitions. Word has length 183 [2025-03-04 05:51:54,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:51:54,811 INFO L471 AbstractCegarLoop]: Abstraction has 3501 states and 4788 transitions. [2025-03-04 05:51:54,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 05:51:54,811 INFO L276 IsEmpty]: Start isEmpty. Operand 3501 states and 4788 transitions. [2025-03-04 05:51:54,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-04 05:51:54,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:51:54,813 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:51:54,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 05:51:54,814 INFO L396 AbstractCegarLoop]: === Iteration 18 === 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:51:54,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:51:54,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1813456018, now seen corresponding path program 1 times [2025-03-04 05:51:54,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:51:54,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121295573] [2025-03-04 05:51:54,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:51:54,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:51:56,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-04 05:51:56,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-04 05:51:56,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:51:56,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:51:57,491 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:51:57,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:51:57,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121295573] [2025-03-04 05:51:57,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121295573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:51:57,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:51:57,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:51:57,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75982490] [2025-03-04 05:51:57,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:51:57,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:51:57,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:51:57,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:51:57,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:51:57,492 INFO L87 Difference]: Start difference. First operand 3501 states and 4788 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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:51:58,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:51:58,021 INFO L93 Difference]: Finished difference Result 3501 states and 4788 transitions. [2025-03-04 05:51:58,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:51:58,021 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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 144 [2025-03-04 05:51:58,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:51:58,035 INFO L225 Difference]: With dead ends: 3501 [2025-03-04 05:51:58,035 INFO L226 Difference]: Without dead ends: 3499 [2025-03-04 05:51:58,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:51:58,038 INFO L435 NwaCegarLoop]: 1697 mSDtfsCounter, 1669 mSDsluCounter, 1696 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1669 SdHoareTripleChecker+Valid, 3393 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.3s IncrementalHoareTripleChecker+Time [2025-03-04 05:51:58,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1669 Valid, 3393 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 05:51:58,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3499 states. [2025-03-04 05:51:58,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3499 to 3499. [2025-03-04 05:51:58,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3499 states, 2378 states have (on average 1.2409587888982339) internal successors, (2951), 2492 states have internal predecessors, (2951), 908 states have call successors, (908), 203 states have call predecessors, (908), 202 states have return successors, (926), 884 states have call predecessors, (926), 906 states have call successors, (926) [2025-03-04 05:51:58,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3499 states to 3499 states and 4785 transitions. [2025-03-04 05:51:58,306 INFO L78 Accepts]: Start accepts. Automaton has 3499 states and 4785 transitions. Word has length 144 [2025-03-04 05:51:58,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:51:58,306 INFO L471 AbstractCegarLoop]: Abstraction has 3499 states and 4785 transitions. [2025-03-04 05:51:58,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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:51:58,306 INFO L276 IsEmpty]: Start isEmpty. Operand 3499 states and 4785 transitions. [2025-03-04 05:51:58,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 05:51:58,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:51:58,309 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:51:58,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 05:51:58,310 INFO L396 AbstractCegarLoop]: === Iteration 19 === 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:51:58,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:51:58,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1707957505, now seen corresponding path program 1 times [2025-03-04 05:51:58,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:51:58,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225693441] [2025-03-04 05:51:58,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:51:58,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms