./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--vme--bridges--vme_ca91cx42.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a4ce0bc2df24452096decdc7e961550a8934d52ee8eab37caec2ef22f016be61 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 08:26:37,516 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 08:26:37,578 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-06 08:26:37,582 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 08:26:37,582 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 08:26:37,607 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 08:26:37,609 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 08:26:37,609 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 08:26:37,609 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 08:26:37,610 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 08:26:37,610 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 08:26:37,610 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 08:26:37,610 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 08:26:37,611 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 08:26:37,611 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 08:26:37,611 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 08:26:37,611 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 08:26:37,611 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 08:26:37,612 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 08:26:37,612 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 08:26:37,612 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 08:26:37,612 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 08:26:37,612 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 08:26:37,612 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 08:26:37,613 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 08:26:37,613 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 08:26:37,613 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 08:26:37,613 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 08:26:37,613 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 08:26:37,613 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:26:37,613 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 08:26:37,613 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 08:26:37,613 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 08:26:37,613 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 08:26:37,613 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 08:26:37,613 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 08:26:37,614 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 08:26:37,614 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 08:26:37,614 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 08:26:37,614 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 08:26:37,614 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a4ce0bc2df24452096decdc7e961550a8934d52ee8eab37caec2ef22f016be61 [2025-02-06 08:26:37,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 08:26:37,830 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 08:26:37,831 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 08:26:37,832 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 08:26:37,832 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 08:26:37,832 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i [2025-02-06 08:26:39,062 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7337856c7/f21898123d3149c4ac3c2962be2733f4/FLAG301dc58ed [2025-02-06 08:26:39,600 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 08:26:39,600 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i [2025-02-06 08:26:39,628 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7337856c7/f21898123d3149c4ac3c2962be2733f4/FLAG301dc58ed [2025-02-06 08:26:40,154 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7337856c7/f21898123d3149c4ac3c2962be2733f4 [2025-02-06 08:26:40,159 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 08:26:40,160 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 08:26:40,165 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 08:26:40,166 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 08:26:40,169 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 08:26:40,170 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:26:40" (1/1) ... [2025-02-06 08:26:40,173 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18c68ad8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:26:40, skipping insertion in model container [2025-02-06 08:26:40,173 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:26:40" (1/1) ... [2025-02-06 08:26:40,275 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 08:26:42,738 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[309910,309923] [2025-02-06 08:26:42,741 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310055,310068] [2025-02-06 08:26:42,742 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310201,310214] [2025-02-06 08:26:42,742 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310366,310379] [2025-02-06 08:26:42,742 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310524,310537] [2025-02-06 08:26:42,743 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310682,310695] [2025-02-06 08:26:42,743 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310840,310853] [2025-02-06 08:26:42,743 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311000,311013] [2025-02-06 08:26:42,744 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311159,311172] [2025-02-06 08:26:42,745 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311298,311311] [2025-02-06 08:26:42,745 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311440,311453] [2025-02-06 08:26:42,746 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311589,311602] [2025-02-06 08:26:42,746 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311728,311741] [2025-02-06 08:26:42,747 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311883,311896] [2025-02-06 08:26:42,747 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312043,312056] [2025-02-06 08:26:42,747 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312194,312207] [2025-02-06 08:26:42,747 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312345,312358] [2025-02-06 08:26:42,747 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312497,312510] [2025-02-06 08:26:42,752 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312646,312659] [2025-02-06 08:26:42,752 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312794,312807] [2025-02-06 08:26:42,752 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312951,312964] [2025-02-06 08:26:42,752 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313100,313113] [2025-02-06 08:26:42,753 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313256,313269] [2025-02-06 08:26:42,753 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313409,313422] [2025-02-06 08:26:42,753 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313555,313568] [2025-02-06 08:26:42,753 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313698,313711] [2025-02-06 08:26:42,753 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313850,313863] [2025-02-06 08:26:42,753 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313996,314009] [2025-02-06 08:26:42,753 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314141,314154] [2025-02-06 08:26:42,754 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314295,314308] [2025-02-06 08:26:42,754 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314446,314459] [2025-02-06 08:26:42,754 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314601,314614] [2025-02-06 08:26:42,754 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314753,314766] [2025-02-06 08:26:42,754 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314908,314921] [2025-02-06 08:26:42,755 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315072,315085] [2025-02-06 08:26:42,755 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315228,315241] [2025-02-06 08:26:42,755 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315392,315405] [2025-02-06 08:26:42,755 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315534,315547] [2025-02-06 08:26:42,755 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315692,315705] [2025-02-06 08:26:42,756 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315859,315872] [2025-02-06 08:26:42,756 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316018,316031] [2025-02-06 08:26:42,756 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316177,316190] [2025-02-06 08:26:42,756 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316326,316339] [2025-02-06 08:26:42,756 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316473,316486] [2025-02-06 08:26:42,756 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316612,316625] [2025-02-06 08:26:42,756 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316775,316788] [2025-02-06 08:26:42,757 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316941,316954] [2025-02-06 08:26:42,757 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317105,317118] [2025-02-06 08:26:42,759 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317270,317283] [2025-02-06 08:26:42,760 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317435,317448] [2025-02-06 08:26:42,760 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317601,317614] [2025-02-06 08:26:42,762 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317766,317779] [2025-02-06 08:26:42,762 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317933,317946] [2025-02-06 08:26:42,762 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318093,318106] [2025-02-06 08:26:42,762 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318255,318268] [2025-02-06 08:26:42,762 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318414,318427] [2025-02-06 08:26:42,763 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318560,318573] [2025-02-06 08:26:42,763 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318703,318716] [2025-02-06 08:26:42,763 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318847,318860] [2025-02-06 08:26:42,763 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318990,319003] [2025-02-06 08:26:42,763 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319134,319147] [2025-02-06 08:26:42,763 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319275,319288] [2025-02-06 08:26:42,764 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319413,319426] [2025-02-06 08:26:42,764 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319571,319584] [2025-02-06 08:26:42,764 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319730,319743] [2025-02-06 08:26:42,764 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319886,319899] [2025-02-06 08:26:42,764 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320035,320048] [2025-02-06 08:26:42,766 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320187,320200] [2025-02-06 08:26:42,767 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320338,320351] [2025-02-06 08:26:42,767 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320487,320500] [2025-02-06 08:26:42,767 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320639,320652] [2025-02-06 08:26:42,768 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320787,320800] [2025-02-06 08:26:42,768 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320940,320953] [2025-02-06 08:26:42,769 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321091,321104] [2025-02-06 08:26:42,769 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321241,321254] [2025-02-06 08:26:42,770 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321388,321401] [2025-02-06 08:26:42,770 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321539,321552] [2025-02-06 08:26:42,771 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321690,321703] [2025-02-06 08:26:42,771 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321838,321851] [2025-02-06 08:26:42,771 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322004,322017] [2025-02-06 08:26:42,771 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322173,322186] [2025-02-06 08:26:42,771 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322340,322353] [2025-02-06 08:26:42,772 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322508,322521] [2025-02-06 08:26:42,773 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322658,322671] [2025-02-06 08:26:42,773 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322805,322818] [2025-02-06 08:26:42,773 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322966,322979] [2025-02-06 08:26:42,773 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[323136,323149] [2025-02-06 08:26:42,774 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[323298,323311] [2025-02-06 08:26:42,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:26:42,807 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 08:26:42,925 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"./arch/x86/include/asm/paravirt.h"), "i" (804), "i" (12UL)); [4183-4184] [2025-02-06 08:26:42,927 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("771:\n\tcall *%c2;\n772:\n.pushsection .parainstructions,\"a\"\n .balign 8 \n .quad 771b\n .byte %c1\n .byte 772b-771b\n .short %c3\n.popsection\n": "=a" (__eax): [paravirt_typenum] "i" (44UL), [paravirt_opptr] "i" (& pv_irq_ops.save_fl.func), [paravirt_clobber] "i" (1): "memory", "cc"); [4189-4191] [2025-02-06 08:26:43,125 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[309910,309923] [2025-02-06 08:26:43,126 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310055,310068] [2025-02-06 08:26:43,126 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310201,310214] [2025-02-06 08:26:43,126 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310366,310379] [2025-02-06 08:26:43,126 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310524,310537] [2025-02-06 08:26:43,127 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310682,310695] [2025-02-06 08:26:43,127 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310840,310853] [2025-02-06 08:26:43,127 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311000,311013] [2025-02-06 08:26:43,127 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311159,311172] [2025-02-06 08:26:43,127 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311298,311311] [2025-02-06 08:26:43,128 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311440,311453] [2025-02-06 08:26:43,128 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311589,311602] [2025-02-06 08:26:43,128 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311728,311741] [2025-02-06 08:26:43,128 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311883,311896] [2025-02-06 08:26:43,128 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312043,312056] [2025-02-06 08:26:43,129 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312194,312207] [2025-02-06 08:26:43,129 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312345,312358] [2025-02-06 08:26:43,129 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312497,312510] [2025-02-06 08:26:43,129 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312646,312659] [2025-02-06 08:26:43,129 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312794,312807] [2025-02-06 08:26:43,130 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312951,312964] [2025-02-06 08:26:43,130 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313100,313113] [2025-02-06 08:26:43,130 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313256,313269] [2025-02-06 08:26:43,130 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313409,313422] [2025-02-06 08:26:43,131 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313555,313568] [2025-02-06 08:26:43,131 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313698,313711] [2025-02-06 08:26:43,131 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313850,313863] [2025-02-06 08:26:43,131 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313996,314009] [2025-02-06 08:26:43,131 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314141,314154] [2025-02-06 08:26:43,132 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314295,314308] [2025-02-06 08:26:43,132 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314446,314459] [2025-02-06 08:26:43,132 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314601,314614] [2025-02-06 08:26:43,132 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314753,314766] [2025-02-06 08:26:43,132 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314908,314921] [2025-02-06 08:26:43,133 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315072,315085] [2025-02-06 08:26:43,133 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315228,315241] [2025-02-06 08:26:43,133 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315392,315405] [2025-02-06 08:26:43,133 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315534,315547] [2025-02-06 08:26:43,133 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315692,315705] [2025-02-06 08:26:43,133 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315859,315872] [2025-02-06 08:26:43,134 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316018,316031] [2025-02-06 08:26:43,134 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316177,316190] [2025-02-06 08:26:43,134 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316326,316339] [2025-02-06 08:26:43,134 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316473,316486] [2025-02-06 08:26:43,134 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316612,316625] [2025-02-06 08:26:43,135 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316775,316788] [2025-02-06 08:26:43,135 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316941,316954] [2025-02-06 08:26:43,135 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317105,317118] [2025-02-06 08:26:43,135 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317270,317283] [2025-02-06 08:26:43,135 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317435,317448] [2025-02-06 08:26:43,136 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317601,317614] [2025-02-06 08:26:43,136 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317766,317779] [2025-02-06 08:26:43,136 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317933,317946] [2025-02-06 08:26:43,136 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318093,318106] [2025-02-06 08:26:43,136 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318255,318268] [2025-02-06 08:26:43,136 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318414,318427] [2025-02-06 08:26:43,137 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318560,318573] [2025-02-06 08:26:43,137 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318703,318716] [2025-02-06 08:26:43,137 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318847,318860] [2025-02-06 08:26:43,137 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318990,319003] [2025-02-06 08:26:43,137 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319134,319147] [2025-02-06 08:26:43,137 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319275,319288] [2025-02-06 08:26:43,137 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319413,319426] [2025-02-06 08:26:43,137 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319571,319584] [2025-02-06 08:26:43,138 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319730,319743] [2025-02-06 08:26:43,138 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319886,319899] [2025-02-06 08:26:43,138 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320035,320048] [2025-02-06 08:26:43,138 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320187,320200] [2025-02-06 08:26:43,138 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320338,320351] [2025-02-06 08:26:43,138 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320487,320500] [2025-02-06 08:26:43,138 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320639,320652] [2025-02-06 08:26:43,139 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320787,320800] [2025-02-06 08:26:43,139 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320940,320953] [2025-02-06 08:26:43,139 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321091,321104] [2025-02-06 08:26:43,139 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321241,321254] [2025-02-06 08:26:43,139 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321388,321401] [2025-02-06 08:26:43,139 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321539,321552] [2025-02-06 08:26:43,141 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321690,321703] [2025-02-06 08:26:43,141 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321838,321851] [2025-02-06 08:26:43,142 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322004,322017] [2025-02-06 08:26:43,143 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322173,322186] [2025-02-06 08:26:43,143 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322340,322353] [2025-02-06 08:26:43,143 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322508,322521] [2025-02-06 08:26:43,144 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322658,322671] [2025-02-06 08:26:43,144 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322805,322818] [2025-02-06 08:26:43,144 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322966,322979] [2025-02-06 08:26:43,144 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[323136,323149] [2025-02-06 08:26:43,144 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[323298,323311] [2025-02-06 08:26:43,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:26:43,271 INFO L204 MainTranslator]: Completed translation [2025-02-06 08:26:43,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:26:43 WrapperNode [2025-02-06 08:26:43,272 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 08:26:43,273 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 08:26:43,274 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 08:26:43,274 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 08:26:43,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:26:43" (1/1) ... [2025-02-06 08:26:43,330 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:26:43" (1/1) ... [2025-02-06 08:26:43,423 INFO L138 Inliner]: procedures = 570, calls = 1770, calls flagged for inlining = 244, calls inlined = 125, statements flattened = 2609 [2025-02-06 08:26:43,424 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 08:26:43,425 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 08:26:43,425 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 08:26:43,425 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 08:26:43,432 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:26:43" (1/1) ... [2025-02-06 08:26:43,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:26:43" (1/1) ... [2025-02-06 08:26:43,454 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:26:43" (1/1) ... [2025-02-06 08:26:43,785 INFO L175 MemorySlicer]: Split 367 memory accesses to 20 slices as follows [2, 1, 8, 8, 8, 8, 9, 8, 8, 8, 8, 8, 6, 2, 2, 1, 5, 2, 264, 1]. 72 percent of accesses are in the largest equivalence class. The 107 initializations are split as follows [2, 0, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 4, 0, 0, 1, 5, 0, 14, 1]. The 114 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 112, 0]. [2025-02-06 08:26:43,786 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:26:43" (1/1) ... [2025-02-06 08:26:43,786 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:26:43" (1/1) ... [2025-02-06 08:26:43,836 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:26:43" (1/1) ... [2025-02-06 08:26:43,842 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:26:43" (1/1) ... [2025-02-06 08:26:43,860 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:26:43" (1/1) ... [2025-02-06 08:26:43,869 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:26:43" (1/1) ... [2025-02-06 08:26:43,887 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 08:26:43,888 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 08:26:43,888 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 08:26:43,888 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 08:26:43,889 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:26:43" (1/1) ... [2025-02-06 08:26:43,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:26:43,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:26:43,920 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 08:26:43,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 08:26:43,943 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2025-02-06 08:26:43,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2025-02-06 08:26:43,944 INFO L130 BoogieDeclarations]: Found specification of procedure pci_release_regions [2025-02-06 08:26:43,944 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_release_regions [2025-02-06 08:26:43,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-02-06 08:26:43,944 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-02-06 08:26:43,944 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-02-06 08:26:43,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-02-06 08:26:43,944 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_io_mem_remap [2025-02-06 08:26:43,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_io_mem_remap [2025-02-06 08:26:43,944 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-02-06 08:26:43,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-02-06 08:26:43,944 INFO L130 BoogieDeclarations]: Found specification of procedure __might_sleep [2025-02-06 08:26:43,944 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_sleep [2025-02-06 08:26:43,944 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2025-02-06 08:26:43,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2025-02-06 08:26:43,945 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2025-02-06 08:26:43,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2025-02-06 08:26:43,945 INFO L130 BoogieDeclarations]: Found specification of procedure ioread32 [2025-02-06 08:26:43,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ioread32 [2025-02-06 08:26:43,945 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2025-02-06 08:26:43,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2025-02-06 08:26:43,945 INFO L130 BoogieDeclarations]: Found specification of procedure iowrite32 [2025-02-06 08:26:43,945 INFO L138 BoogieDeclarations]: Found implementation of procedure iowrite32 [2025-02-06 08:26:43,945 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-02-06 08:26:43,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-02-06 08:26:43,945 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2025-02-06 08:26:43,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2025-02-06 08:26:43,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 08:26:43,945 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2025-02-06 08:26:43,945 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2025-02-06 08:26:43,945 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-02-06 08:26:43,945 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-02-06 08:26:43,945 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2025-02-06 08:26:43,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2025-02-06 08:26:43,946 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mtx_of_vme_dma_resource [2025-02-06 08:26:43,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mtx_of_vme_dma_resource [2025-02-06 08:26:43,946 INFO L130 BoogieDeclarations]: Found specification of procedure schedule [2025-02-06 08:26:43,946 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule [2025-02-06 08:26:43,946 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2025-02-06 08:26:43,946 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2025-02-06 08:26:43,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-06 08:26:43,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-06 08:26:43,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-06 08:26:43,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-06 08:26:43,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-06 08:26:43,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-06 08:26:43,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-06 08:26:43,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-02-06 08:26:43,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-02-06 08:26:43,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-02-06 08:26:43,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-02-06 08:26:43,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-02-06 08:26:43,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-02-06 08:26:43,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-02-06 08:26:43,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-02-06 08:26:43,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-02-06 08:26:43,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-02-06 08:26:43,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-02-06 08:26:43,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-02-06 08:26:43,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-02-06 08:26:43,947 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2025-02-06 08:26:43,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2025-02-06 08:26:43,947 INFO L130 BoogieDeclarations]: Found specification of procedure _dev_info [2025-02-06 08:26:43,947 INFO L138 BoogieDeclarations]: Found implementation of procedure _dev_info [2025-02-06 08:26:43,947 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2025-02-06 08:26:43,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2025-02-06 08:26:43,947 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-02-06 08:26:43,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-02-06 08:26:43,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 08:26:43,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 08:26:43,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 08:26:43,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 08:26:43,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 08:26:43,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 08:26:43,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 08:26:43,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-06 08:26:43,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-06 08:26:43,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-06 08:26:43,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-06 08:26:43,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-06 08:26:43,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-06 08:26:43,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-06 08:26:43,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-06 08:26:43,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-06 08:26:43,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-06 08:26:43,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-02-06 08:26:43,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-02-06 08:26:43,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-02-06 08:26:43,948 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2025-02-06 08:26:43,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2025-02-06 08:26:43,948 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2025-02-06 08:26:43,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2025-02-06 08:26:43,948 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2025-02-06 08:26:43,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2025-02-06 08:26:43,949 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2025-02-06 08:26:43,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2025-02-06 08:26:43,949 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2025-02-06 08:26:43,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2025-02-06 08:26:43,949 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait_event [2025-02-06 08:26:43,949 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait_event [2025-02-06 08:26:43,949 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2025-02-06 08:26:43,949 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2025-02-06 08:26:43,949 INFO L130 BoogieDeclarations]: Found specification of procedure pci_free_consistent [2025-02-06 08:26:43,949 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_free_consistent [2025-02-06 08:26:43,949 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2025-02-06 08:26:43,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2025-02-06 08:26:43,949 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2025-02-06 08:26:43,949 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_device [2025-02-06 08:26:43,949 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-02-06 08:26:43,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-02-06 08:26:43,949 INFO L130 BoogieDeclarations]: Found specification of procedure virt_to_phys [2025-02-06 08:26:43,949 INFO L138 BoogieDeclarations]: Found implementation of procedure virt_to_phys [2025-02-06 08:26:43,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 08:26:43,949 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2025-02-06 08:26:43,949 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2025-02-06 08:26:43,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 08:26:43,949 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-02-06 08:26:43,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-02-06 08:26:43,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 08:26:43,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 08:26:43,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 08:26:43,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 08:26:43,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-06 08:26:43,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-06 08:26:43,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-06 08:26:43,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-06 08:26:43,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-06 08:26:43,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-06 08:26:43,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-06 08:26:43,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-06 08:26:43,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-06 08:26:43,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-06 08:26:43,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-06 08:26:43,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-02-06 08:26:43,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-02-06 08:26:43,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-02-06 08:26:43,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-02-06 08:26:43,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-02-06 08:26:43,950 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-02-06 08:26:43,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-02-06 08:26:43,950 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2025-02-06 08:26:43,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2025-02-06 08:26:43,951 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mtx_of_vme_dma_resource [2025-02-06 08:26:43,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mtx_of_vme_dma_resource [2025-02-06 08:26:43,951 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2025-02-06 08:26:43,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2025-02-06 08:26:43,951 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2025-02-06 08:26:43,951 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2025-02-06 08:26:43,951 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2025-02-06 08:26:43,951 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2025-02-06 08:26:43,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 08:26:43,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 08:26:43,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-02-06 08:26:43,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-02-06 08:26:43,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-02-06 08:26:43,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-02-06 08:26:43,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-02-06 08:26:43,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-02-06 08:26:43,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-02-06 08:26:43,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-02-06 08:26:43,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-02-06 08:26:43,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-02-06 08:26:43,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-02-06 08:26:43,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-02-06 08:26:43,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-02-06 08:26:43,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-02-06 08:26:43,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-02-06 08:26:43,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-02-06 08:26:43,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-02-06 08:26:43,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-02-06 08:26:43,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-02-06 08:26:43,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-02-06 08:26:43,951 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-02-06 08:26:43,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-02-06 08:26:43,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 08:26:43,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 08:26:43,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-06 08:26:43,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-02-06 08:26:43,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-02-06 08:26:43,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-02-06 08:26:43,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-02-06 08:26:43,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-02-06 08:26:43,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-02-06 08:26:43,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2025-02-06 08:26:43,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2025-02-06 08:26:43,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#11 [2025-02-06 08:26:43,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#12 [2025-02-06 08:26:43,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#13 [2025-02-06 08:26:43,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#14 [2025-02-06 08:26:43,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#15 [2025-02-06 08:26:43,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#16 [2025-02-06 08:26:43,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#17 [2025-02-06 08:26:43,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#18 [2025-02-06 08:26:43,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#19 [2025-02-06 08:26:43,953 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 08:26:43,953 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 08:26:43,953 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-06 08:26:43,953 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-02-06 08:26:43,953 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-02-06 08:26:43,953 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-02-06 08:26:43,953 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-02-06 08:26:43,953 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-02-06 08:26:43,953 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-02-06 08:26:43,953 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2025-02-06 08:26:43,953 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2025-02-06 08:26:43,953 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#11 [2025-02-06 08:26:43,953 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#12 [2025-02-06 08:26:43,953 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#13 [2025-02-06 08:26:43,953 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#14 [2025-02-06 08:26:43,953 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#15 [2025-02-06 08:26:43,953 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#16 [2025-02-06 08:26:43,953 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#17 [2025-02-06 08:26:43,953 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#18 [2025-02-06 08:26:43,953 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#19 [2025-02-06 08:26:43,953 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_io_mem_unmap [2025-02-06 08:26:43,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_io_mem_unmap [2025-02-06 08:26:43,953 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2025-02-06 08:26:43,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2025-02-06 08:26:43,953 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2025-02-06 08:26:43,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2025-02-06 08:26:43,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 08:26:43,953 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2025-02-06 08:26:43,953 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2025-02-06 08:26:43,953 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2025-02-06 08:26:43,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2025-02-06 08:26:43,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 08:26:43,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 08:26:43,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 08:26:43,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 08:26:43,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-06 08:26:43,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-06 08:26:43,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-06 08:26:43,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-06 08:26:43,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-06 08:26:43,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-06 08:26:43,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-06 08:26:43,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-06 08:26:43,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-06 08:26:43,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-06 08:26:43,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-06 08:26:43,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-02-06 08:26:43,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-02-06 08:26:43,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-02-06 08:26:43,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-02-06 08:26:43,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-02-06 08:26:43,954 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_slot_get [2025-02-06 08:26:43,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_slot_get [2025-02-06 08:26:43,954 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2025-02-06 08:26:43,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2025-02-06 08:26:43,954 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-02-06 08:26:43,954 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-02-06 08:26:43,954 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-02-06 08:26:43,954 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-02-06 08:26:43,954 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2025-02-06 08:26:43,954 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2025-02-06 08:26:43,954 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2025-02-06 08:26:43,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2025-02-06 08:26:43,954 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2025-02-06 08:26:43,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2025-02-06 08:26:43,954 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_irq_exit [2025-02-06 08:26:43,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_irq_exit [2025-02-06 08:26:43,954 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-02-06 08:26:43,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-02-06 08:26:43,955 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-02-06 08:26:43,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-02-06 08:26:43,955 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-02-06 08:26:43,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-02-06 08:26:43,955 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2025-02-06 08:26:43,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2025-02-06 08:26:43,955 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_crcsr_exit [2025-02-06 08:26:43,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_crcsr_exit [2025-02-06 08:26:43,955 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-02-06 08:26:43,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-02-06 08:26:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-02-06 08:26:43,956 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-02-06 08:26:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-02-06 08:26:43,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-02-06 08:26:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 08:26:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 08:26:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 08:26:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 08:26:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 08:26:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 08:26:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 08:26:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 08:26:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-06 08:26:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-06 08:26:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-06 08:26:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-06 08:26:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-06 08:26:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-06 08:26:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-06 08:26:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-06 08:26:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-06 08:26:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-02-06 08:26:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-02-06 08:26:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-02-06 08:26:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_remove [2025-02-06 08:26:43,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_remove [2025-02-06 08:26:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2025-02-06 08:26:43,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2025-02-06 08:26:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-02-06 08:26:43,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-02-06 08:26:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2025-02-06 08:26:43,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2025-02-06 08:26:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2025-02-06 08:26:43,956 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2025-02-06 08:26:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2025-02-06 08:26:43,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2025-02-06 08:26:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-02-06 08:26:43,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-02-06 08:26:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_dma_busy [2025-02-06 08:26:43,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_dma_busy [2025-02-06 08:26:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 08:26:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 08:26:43,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 08:26:43,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 08:26:43,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 08:26:43,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 08:26:43,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 08:26:43,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 08:26:43,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-06 08:26:43,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-06 08:26:43,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-06 08:26:43,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-06 08:26:43,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-06 08:26:43,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-06 08:26:43,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-06 08:26:43,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-06 08:26:43,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-06 08:26:43,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-06 08:26:43,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-06 08:26:43,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-06 08:26:44,463 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 08:26:44,469 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 08:26:44,496 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-02-06 08:26:44,553 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L12667: havoc #t~nondet966; [2025-02-06 08:26:44,730 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4342: havoc #t~mem97.base, #t~mem97.offset; [2025-02-06 08:26:44,796 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L12717: havoc #t~nondet971; [2025-02-06 08:26:44,874 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4199: havoc arch_irqs_disabled_flags_#t~bitwise27#1; [2025-02-06 08:26:44,990 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4291: havoc dev_get_drvdata_#t~mem59#1.base, dev_get_drvdata_#t~mem59#1.offset; [2025-02-06 08:26:45,111 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L12629: havoc __phys_addr_#t~nondet964#1; [2025-02-06 08:26:45,232 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6100: call ULTIMATE.dealloc(ca91cx42_dma_list_exec_~#__wait~1#1.base, ca91cx42_dma_list_exec_~#__wait~1#1.offset);havoc ca91cx42_dma_list_exec_~#__wait~1#1.base, ca91cx42_dma_list_exec_~#__wait~1#1.offset; [2025-02-06 08:26:45,232 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4155: havoc list_empty_#t~mem16#1.base, list_empty_#t~mem16#1.offset; [2025-02-06 08:26:49,984 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7930-1: ldv___pci_register_driver_138_#res#1 := ldv___pci_register_driver_138_~ldv_func_res~1#1; [2025-02-06 08:26:49,984 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L12625: havoc __pci_register_driver_#t~nondet963#1; [2025-02-06 08:26:49,984 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L12725: havoc request_threaded_irq_#t~nondet973#1; [2025-02-06 08:26:49,984 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7638-1: ldv_request_irq_96_#res#1 := ldv_request_irq_96_~ldv_func_res~0#1; [2025-02-06 08:26:49,984 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7411-1: call ULTIMATE.dealloc(ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0#1.base, ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0#1.offset);havoc ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0#1.base, ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0#1.offset; [2025-02-06 08:26:49,984 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7411: call ULTIMATE.dealloc(ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0#1.base, ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0#1.offset);havoc ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0#1.base, ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0#1.offset; [2025-02-06 08:26:49,984 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7411-2: call ULTIMATE.dealloc(ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0#1.base, ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0#1.offset);havoc ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0#1.base, ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0#1.offset; [2025-02-06 08:26:49,984 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4807: call ULTIMATE.dealloc(ca91cx42_irq_init_~#__key~0#1.base, ca91cx42_irq_init_~#__key~0#1.offset);havoc ca91cx42_irq_init_~#__key~0#1.base, ca91cx42_irq_init_~#__key~0#1.offset; [2025-02-06 08:26:49,984 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L12703: havoc pci_enable_device_#t~nondet969#1; [2025-02-06 08:26:49,984 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7385: call ULTIMATE.dealloc(ldv_pci_instance_suspend_1_8_~#arg2#1.base, ldv_pci_instance_suspend_1_8_~#arg2#1.offset);havoc ldv_pci_instance_suspend_1_8_~#arg2#1.base, ldv_pci_instance_suspend_1_8_~#arg2#1.offset; [2025-02-06 08:26:49,984 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L12738: havoc vme_register_bridge_#t~nondet974#1; [2025-02-06 08:26:49,985 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7586-1: ldv_request_irq_#res#1 := ldv_request_irq_~arg0#1; [2025-02-06 08:26:49,985 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L12710: havoc pci_request_regions_#t~nondet970#1; [2025-02-06 08:26:49,985 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6569: call ULTIMATE.dealloc(ca91cx42_probe_~#__key~1#1.base, ca91cx42_probe_~#__key~1#1.offset);havoc ca91cx42_probe_~#__key~1#1.base, ca91cx42_probe_~#__key~1#1.offset;call ULTIMATE.dealloc(ca91cx42_probe_~#__key___0~0#1.base, ca91cx42_probe_~#__key___0~0#1.offset);havoc ca91cx42_probe_~#__key___0~0#1.base, ca91cx42_probe_~#__key___0~0#1.offset;call ULTIMATE.dealloc(ca91cx42_probe_~#__key___1~0#1.base, ca91cx42_probe_~#__key___1~0#1.offset);havoc ca91cx42_probe_~#__key___1~0#1.base, ca91cx42_probe_~#__key___1~0#1.offset;call ULTIMATE.dealloc(ca91cx42_probe_~#__key___2~0#1.base, ca91cx42_probe_~#__key___2~0#1.offset);havoc ca91cx42_probe_~#__key___2~0#1.base, ca91cx42_probe_~#__key___2~0#1.offset;call ULTIMATE.dealloc(ca91cx42_probe_~#__key___3~0#1.base, ca91cx42_probe_~#__key___3~0#1.offset);havoc ca91cx42_probe_~#__key___3~0#1.base, ca91cx42_probe_~#__key___3~0#1.offset;call ULTIMATE.dealloc(ca91cx42_probe_~#__key___4~0#1.base, ca91cx42_probe_~#__key___4~0#1.offset);havoc ca91cx42_probe_~#__key___4~0#1.base, ca91cx42_probe_~#__key___4~0#1.offset;call ULTIMATE.dealloc(ca91cx42_probe_~#__key___5~0#1.base, ca91cx42_probe_~#__key___5~0#1.offset);havoc ca91cx42_probe_~#__key___5~0#1.base, ca91cx42_probe_~#__key___5~0#1.offset;call ULTIMATE.dealloc(ca91cx42_probe_~#__key___6~0#1.base, ca91cx42_probe_~#__key___6~0#1.offset);havoc ca91cx42_probe_~#__key___6~0#1.base, ca91cx42_probe_~#__key___6~0#1.offset; [2025-02-06 08:26:49,985 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7396: call ULTIMATE.dealloc(ldv_pci_instance_suspend_late_1_7_~#arg2#1.base, ldv_pci_instance_suspend_late_1_7_~#arg2#1.offset);havoc ldv_pci_instance_suspend_late_1_7_~#arg2#1.base, ldv_pci_instance_suspend_late_1_7_~#arg2#1.offset; [2025-02-06 08:26:49,985 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7169-1: ldv___pci_register_driver_#res#1 := ldv___pci_register_driver_~arg0#1; [2025-02-06 08:26:50,342 INFO L? ?]: Removed 1235 outVars from TransFormulas that were not future-live. [2025-02-06 08:26:50,342 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 08:26:50,397 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 08:26:50,400 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 08:26:50,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:26:50 BoogieIcfgContainer [2025-02-06 08:26:50,401 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 08:26:50,402 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 08:26:50,403 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 08:26:50,406 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 08:26:50,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 08:26:40" (1/3) ... [2025-02-06 08:26:50,407 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ecad47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:26:50, skipping insertion in model container [2025-02-06 08:26:50,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:26:43" (2/3) ... [2025-02-06 08:26:50,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ecad47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:26:50, skipping insertion in model container [2025-02-06 08:26:50,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:26:50" (3/3) ... [2025-02-06 08:26:50,409 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i [2025-02-06 08:26:50,420 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 08:26:50,423 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i that has 95 procedures, 1169 locations, 1 initial locations, 21 loop locations, and 28 error locations. [2025-02-06 08:26:50,493 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 08:26:50,504 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;@36a7df17, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 08:26:50,505 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-02-06 08:26:50,513 INFO L276 IsEmpty]: Start isEmpty. Operand has 1092 states, 717 states have (on average 1.2733612273361228) internal successors, (913), 760 states have internal predecessors, (913), 272 states have call successors, (272), 75 states have call predecessors, (272), 74 states have return successors, (269), 266 states have call predecessors, (269), 269 states have call successors, (269) [2025-02-06 08:26:50,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-06 08:26:50,521 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:26:50,521 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-02-06 08:26:50,522 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 26 more)] === [2025-02-06 08:26:50,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:26:50,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1667640861, now seen corresponding path program 1 times [2025-02-06 08:26:50,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:26:50,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889799970] [2025-02-06 08:26:50,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:26:50,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:26:50,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 08:26:51,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 08:26:51,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:26:51,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:26:51,567 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:26:51,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:26:51,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889799970] [2025-02-06 08:26:51,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889799970] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:26:51,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:26:51,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:26:51,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251989762] [2025-02-06 08:26:51,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:26:51,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:26:51,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:26:51,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:26:51,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:26:51,594 INFO L87 Difference]: Start difference. First operand has 1092 states, 717 states have (on average 1.2733612273361228) internal successors, (913), 760 states have internal predecessors, (913), 272 states have call successors, (272), 75 states have call predecessors, (272), 74 states have return successors, (269), 266 states have call predecessors, (269), 269 states have call successors, (269) 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-02-06 08:26:52,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:26:52,031 INFO L93 Difference]: Finished difference Result 3204 states and 4406 transitions. [2025-02-06 08:26:52,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:26:52,034 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-02-06 08:26:52,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:26:52,067 INFO L225 Difference]: With dead ends: 3204 [2025-02-06 08:26:52,067 INFO L226 Difference]: Without dead ends: 2118 [2025-02-06 08:26:52,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:26:52,084 INFO L435 NwaCegarLoop]: 1695 mSDtfsCounter, 1369 mSDsluCounter, 3049 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1369 SdHoareTripleChecker+Valid, 4744 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:26:52,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1369 Valid, 4744 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:26:52,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2118 states. [2025-02-06 08:26:52,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2118 to 1924. [2025-02-06 08:26:52,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1924 states, 1284 states have (on average 1.2344236760124612) internal successors, (1585), 1344 states have internal predecessors, (1585), 487 states have call successors, (487), 128 states have call predecessors, (487), 125 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-02-06 08:26:52,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 2558 transitions. [2025-02-06 08:26:52,275 INFO L78 Accepts]: Start accepts. Automaton has 1924 states and 2558 transitions. Word has length 64 [2025-02-06 08:26:52,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:26:52,276 INFO L471 AbstractCegarLoop]: Abstraction has 1924 states and 2558 transitions. [2025-02-06 08:26:52,276 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-02-06 08:26:52,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 2558 transitions. [2025-02-06 08:26:52,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-06 08:26:52,278 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:26:52,278 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-02-06 08:26:52,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 08:26:52,279 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 26 more)] === [2025-02-06 08:26:52,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:26:52,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1587355676, now seen corresponding path program 1 times [2025-02-06 08:26:52,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:26:52,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954443216] [2025-02-06 08:26:52,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:26:52,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:26:52,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 08:26:52,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 08:26:52,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:26:52,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:26:52,987 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:26:52,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:26:52,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954443216] [2025-02-06 08:26:52,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954443216] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:26:52,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:26:52,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:26:52,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629224518] [2025-02-06 08:26:52,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:26:52,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:26:52,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:26:52,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:26:52,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:26:52,991 INFO L87 Difference]: Start difference. First operand 1924 states and 2558 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-02-06 08:26:53,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:26:53,132 INFO L93 Difference]: Finished difference Result 1924 states and 2558 transitions. [2025-02-06 08:26:53,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:26:53,132 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-02-06 08:26:53,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:26:53,145 INFO L225 Difference]: With dead ends: 1924 [2025-02-06 08:26:53,145 INFO L226 Difference]: Without dead ends: 1922 [2025-02-06 08:26:53,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:26:53,147 INFO L435 NwaCegarLoop]: 1373 mSDtfsCounter, 1374 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1374 SdHoareTripleChecker+Valid, 2745 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:26:53,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1374 Valid, 2745 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:26:53,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states. [2025-02-06 08:26:53,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1922. [2025-02-06 08:26:53,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1922 states, 1283 states have (on average 1.2338269680436478) internal successors, (1583), 1342 states have internal predecessors, (1583), 487 states have call successors, (487), 128 states have call predecessors, (487), 125 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-02-06 08:26:53,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 2556 transitions. [2025-02-06 08:26:53,279 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 2556 transitions. Word has length 70 [2025-02-06 08:26:53,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:26:53,281 INFO L471 AbstractCegarLoop]: Abstraction has 1922 states and 2556 transitions. [2025-02-06 08:26:53,281 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-02-06 08:26:53,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 2556 transitions. [2025-02-06 08:26:53,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-06 08:26:53,282 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:26:53,282 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-02-06 08:26:53,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 08:26:53,283 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 26 more)] === [2025-02-06 08:26:53,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:26:53,283 INFO L85 PathProgramCache]: Analyzing trace with hash 417504983, now seen corresponding path program 1 times [2025-02-06 08:26:53,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:26:53,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104066101] [2025-02-06 08:26:53,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:26:53,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:26:53,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-06 08:26:53,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-06 08:26:53,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:26:53,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:26:53,712 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:26:53,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:26:53,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104066101] [2025-02-06 08:26:53,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104066101] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:26:53,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:26:53,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:26:53,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159949760] [2025-02-06 08:26:53,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:26:53,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:26:53,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:26:53,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:26:53,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:26:53,714 INFO L87 Difference]: Start difference. First operand 1922 states and 2556 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-02-06 08:26:53,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:26:53,865 INFO L93 Difference]: Finished difference Result 1922 states and 2556 transitions. [2025-02-06 08:26:53,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:26:53,866 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-02-06 08:26:53,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:26:53,884 INFO L225 Difference]: With dead ends: 1922 [2025-02-06 08:26:53,884 INFO L226 Difference]: Without dead ends: 1920 [2025-02-06 08:26:53,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:26:53,889 INFO L435 NwaCegarLoop]: 1371 mSDtfsCounter, 1371 mSDsluCounter, 1370 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1371 SdHoareTripleChecker+Valid, 2741 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:26:53,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1371 Valid, 2741 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:26:53,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1920 states. [2025-02-06 08:26:53,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1920 to 1920. [2025-02-06 08:26:53,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1920 states, 1282 states have (on average 1.2332293291731669) internal successors, (1581), 1340 states have internal predecessors, (1581), 487 states have call successors, (487), 128 states have call predecessors, (487), 125 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-02-06 08:26:53,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1920 states to 1920 states and 2554 transitions. [2025-02-06 08:26:53,976 INFO L78 Accepts]: Start accepts. Automaton has 1920 states and 2554 transitions. Word has length 76 [2025-02-06 08:26:53,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:26:53,976 INFO L471 AbstractCegarLoop]: Abstraction has 1920 states and 2554 transitions. [2025-02-06 08:26:53,976 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-02-06 08:26:53,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1920 states and 2554 transitions. [2025-02-06 08:26:53,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-06 08:26:53,981 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:26:53,981 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-02-06 08:26:53,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 08:26:53,981 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 26 more)] === [2025-02-06 08:26:53,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:26:53,982 INFO L85 PathProgramCache]: Analyzing trace with hash -536021917, now seen corresponding path program 1 times [2025-02-06 08:26:53,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:26:53,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486795394] [2025-02-06 08:26:53,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:26:53,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:26:54,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-06 08:26:54,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-06 08:26:54,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:26:54,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:26:54,559 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:26:54,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:26:54,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486795394] [2025-02-06 08:26:54,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486795394] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:26:54,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:26:54,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:26:54,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417810279] [2025-02-06 08:26:54,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:26:54,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:26:54,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:26:54,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:26:54,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:26:54,561 INFO L87 Difference]: Start difference. First operand 1920 states and 2554 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-02-06 08:26:54,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:26:54,709 INFO L93 Difference]: Finished difference Result 1920 states and 2554 transitions. [2025-02-06 08:26:54,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:26:54,709 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-02-06 08:26:54,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:26:54,718 INFO L225 Difference]: With dead ends: 1920 [2025-02-06 08:26:54,718 INFO L226 Difference]: Without dead ends: 1918 [2025-02-06 08:26:54,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:26:54,720 INFO L435 NwaCegarLoop]: 1369 mSDtfsCounter, 1368 mSDsluCounter, 1368 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1368 SdHoareTripleChecker+Valid, 2737 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:26:54,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1368 Valid, 2737 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:26:54,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1918 states. [2025-02-06 08:26:54,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1918 to 1918. [2025-02-06 08:26:54,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1918 states, 1281 states have (on average 1.2326307572209212) internal successors, (1579), 1338 states have internal predecessors, (1579), 487 states have call successors, (487), 128 states have call predecessors, (487), 125 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-02-06 08:26:54,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1918 states to 1918 states and 2552 transitions. [2025-02-06 08:26:54,804 INFO L78 Accepts]: Start accepts. Automaton has 1918 states and 2552 transitions. Word has length 82 [2025-02-06 08:26:54,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:26:54,804 INFO L471 AbstractCegarLoop]: Abstraction has 1918 states and 2552 transitions. [2025-02-06 08:26:54,804 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-02-06 08:26:54,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1918 states and 2552 transitions. [2025-02-06 08:26:54,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-06 08:26:54,805 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:26:54,805 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-02-06 08:26:54,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 08:26:54,806 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 26 more)] === [2025-02-06 08:26:54,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:26:54,806 INFO L85 PathProgramCache]: Analyzing trace with hash -815204445, now seen corresponding path program 1 times [2025-02-06 08:26:54,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:26:54,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682171828] [2025-02-06 08:26:54,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:26:54,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:26:55,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-06 08:26:55,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-06 08:26:55,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:26:55,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:26:55,282 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:26:55,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:26:55,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682171828] [2025-02-06 08:26:55,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682171828] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:26:55,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:26:55,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:26:55,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302724367] [2025-02-06 08:26:55,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:26:55,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:26:55,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:26:55,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:26:55,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:26:55,284 INFO L87 Difference]: Start difference. First operand 1918 states and 2552 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-02-06 08:26:55,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:26:55,435 INFO L93 Difference]: Finished difference Result 1918 states and 2552 transitions. [2025-02-06 08:26:55,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:26:55,436 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-02-06 08:26:55,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:26:55,445 INFO L225 Difference]: With dead ends: 1918 [2025-02-06 08:26:55,445 INFO L226 Difference]: Without dead ends: 1916 [2025-02-06 08:26:55,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:26:55,446 INFO L435 NwaCegarLoop]: 1367 mSDtfsCounter, 1365 mSDsluCounter, 1366 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1365 SdHoareTripleChecker+Valid, 2733 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:26:55,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1365 Valid, 2733 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:26:55,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1916 states. [2025-02-06 08:26:55,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1916 to 1916. [2025-02-06 08:26:55,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1916 states, 1280 states have (on average 1.23203125) internal successors, (1577), 1336 states have internal predecessors, (1577), 487 states have call successors, (487), 128 states have call predecessors, (487), 125 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-02-06 08:26:55,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1916 states and 2550 transitions. [2025-02-06 08:26:55,545 INFO L78 Accepts]: Start accepts. Automaton has 1916 states and 2550 transitions. Word has length 88 [2025-02-06 08:26:55,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:26:55,545 INFO L471 AbstractCegarLoop]: Abstraction has 1916 states and 2550 transitions. [2025-02-06 08:26:55,545 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-02-06 08:26:55,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 2550 transitions. [2025-02-06 08:26:55,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 08:26:55,546 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:26:55,547 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:26:55,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 08:26:55,548 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_check_alloc_flagsErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-06 08:26:55,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:26:55,548 INFO L85 PathProgramCache]: Analyzing trace with hash 478164675, now seen corresponding path program 1 times [2025-02-06 08:26:55,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:26:55,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528244226] [2025-02-06 08:26:55,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:26:55,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:26:55,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 08:26:55,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 08:26:55,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:26:55,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:26:56,536 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-06 08:26:56,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:26:56,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528244226] [2025-02-06 08:26:56,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528244226] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:26:56,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:26:56,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 08:26:56,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325368231] [2025-02-06 08:26:56,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:26:56,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:26:56,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:26:56,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:26:56,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:26:56,539 INFO L87 Difference]: Start difference. First operand 1916 states and 2550 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-06 08:27:00,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 08:27:01,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:01,808 INFO L93 Difference]: Finished difference Result 3835 states and 5103 transitions. [2025-02-06 08:27:01,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 08:27:01,809 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 116 [2025-02-06 08:27:01,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:01,818 INFO L225 Difference]: With dead ends: 3835 [2025-02-06 08:27:01,818 INFO L226 Difference]: Without dead ends: 1940 [2025-02-06 08:27:01,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:27:01,823 INFO L435 NwaCegarLoop]: 1367 mSDtfsCounter, 1337 mSDsluCounter, 3566 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1350 SdHoareTripleChecker+Valid, 4933 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:01,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1350 Valid, 4933 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 676 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2025-02-06 08:27:01,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1940 states. [2025-02-06 08:27:01,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1940 to 1940. [2025-02-06 08:27:01,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1940 states, 1296 states have (on average 1.2276234567901234) internal successors, (1591), 1352 states have internal predecessors, (1591), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-02-06 08:27:01,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1940 states to 1940 states and 2564 transitions. [2025-02-06 08:27:01,898 INFO L78 Accepts]: Start accepts. Automaton has 1940 states and 2564 transitions. Word has length 116 [2025-02-06 08:27:01,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:01,899 INFO L471 AbstractCegarLoop]: Abstraction has 1940 states and 2564 transitions. [2025-02-06 08:27:01,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-06 08:27:01,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1940 states and 2564 transitions. [2025-02-06 08:27:01,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 08:27:01,901 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:01,901 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:27:01,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 08:27:01,901 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_check_alloc_flagsErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-06 08:27:01,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:01,902 INFO L85 PathProgramCache]: Analyzing trace with hash 478194466, now seen corresponding path program 1 times [2025-02-06 08:27:01,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:01,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318514344] [2025-02-06 08:27:01,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:01,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:02,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 08:27:02,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 08:27:02,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:02,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:02,393 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-06 08:27:02,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:02,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318514344] [2025-02-06 08:27:02,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318514344] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:02,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:02,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:27:02,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898867012] [2025-02-06 08:27:02,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:02,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:27:02,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:02,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:27:02,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:02,395 INFO L87 Difference]: Start difference. First operand 1940 states and 2564 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 08:27:02,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:02,644 INFO L93 Difference]: Finished difference Result 1940 states and 2564 transitions. [2025-02-06 08:27:02,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:27:02,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 116 [2025-02-06 08:27:02,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:02,653 INFO L225 Difference]: With dead ends: 1940 [2025-02-06 08:27:02,653 INFO L226 Difference]: Without dead ends: 1938 [2025-02-06 08:27:02,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:02,655 INFO L435 NwaCegarLoop]: 1364 mSDtfsCounter, 0 mSDsluCounter, 2724 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4088 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:02,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4088 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:27:02,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1938 states. [2025-02-06 08:27:02,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1938 to 1938. [2025-02-06 08:27:02,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1938 states, 1295 states have (on average 1.2262548262548263) internal successors, (1588), 1350 states have internal predecessors, (1588), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-02-06 08:27:02,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1938 states to 1938 states and 2561 transitions. [2025-02-06 08:27:02,735 INFO L78 Accepts]: Start accepts. Automaton has 1938 states and 2561 transitions. Word has length 116 [2025-02-06 08:27:02,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:02,735 INFO L471 AbstractCegarLoop]: Abstraction has 1938 states and 2561 transitions. [2025-02-06 08:27:02,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 08:27:02,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1938 states and 2561 transitions. [2025-02-06 08:27:02,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-06 08:27:02,737 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:02,737 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-02-06 08:27:02,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 08:27:02,738 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-06 08:27:02,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:02,738 INFO L85 PathProgramCache]: Analyzing trace with hash -2132427411, now seen corresponding path program 1 times [2025-02-06 08:27:02,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:02,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21352004] [2025-02-06 08:27:02,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:02,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:02,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 08:27:02,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 08:27:02,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:02,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:03,089 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:27:03,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:03,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21352004] [2025-02-06 08:27:03,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21352004] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:03,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:03,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:27:03,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615446210] [2025-02-06 08:27:03,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:03,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:27:03,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:03,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:27:03,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:03,091 INFO L87 Difference]: Start difference. First operand 1938 states and 2561 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-02-06 08:27:03,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:03,274 INFO L93 Difference]: Finished difference Result 1938 states and 2561 transitions. [2025-02-06 08:27:03,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:27:03,274 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-02-06 08:27:03,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:03,282 INFO L225 Difference]: With dead ends: 1938 [2025-02-06 08:27:03,282 INFO L226 Difference]: Without dead ends: 1936 [2025-02-06 08:27:03,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:27:03,283 INFO L435 NwaCegarLoop]: 1362 mSDtfsCounter, 1359 mSDsluCounter, 1361 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1359 SdHoareTripleChecker+Valid, 2723 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:03,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1359 Valid, 2723 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:27:03,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1936 states. [2025-02-06 08:27:03,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1936 to 1936. [2025-02-06 08:27:03,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1936 states, 1294 states have (on average 1.2256568778979908) internal successors, (1586), 1348 states have internal predecessors, (1586), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-02-06 08:27:03,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1936 states and 2559 transitions. [2025-02-06 08:27:03,363 INFO L78 Accepts]: Start accepts. Automaton has 1936 states and 2559 transitions. Word has length 94 [2025-02-06 08:27:03,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:03,365 INFO L471 AbstractCegarLoop]: Abstraction has 1936 states and 2559 transitions. [2025-02-06 08:27:03,365 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-02-06 08:27:03,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 2559 transitions. [2025-02-06 08:27:03,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-06 08:27:03,366 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:03,367 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:27:03,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 08:27:03,368 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-06 08:27:03,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:03,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1243942075, now seen corresponding path program 1 times [2025-02-06 08:27:03,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:03,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984997291] [2025-02-06 08:27:03,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:03,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:03,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-06 08:27:03,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-06 08:27:03,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:03,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:03,706 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-06 08:27:03,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:03,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984997291] [2025-02-06 08:27:03,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984997291] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:03,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:03,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:27:03,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798310945] [2025-02-06 08:27:03,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:03,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:27:03,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:03,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:27:03,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:27:03,709 INFO L87 Difference]: Start difference. First operand 1936 states and 2559 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-06 08:27:03,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:03,914 INFO L93 Difference]: Finished difference Result 3845 states and 5098 transitions. [2025-02-06 08:27:03,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:27:03,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 120 [2025-02-06 08:27:03,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:03,927 INFO L225 Difference]: With dead ends: 3845 [2025-02-06 08:27:03,927 INFO L226 Difference]: Without dead ends: 1930 [2025-02-06 08:27:03,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:27:03,935 INFO L435 NwaCegarLoop]: 1358 mSDtfsCounter, 1350 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1350 SdHoareTripleChecker+Valid, 1358 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:03,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1350 Valid, 1358 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:27:03,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2025-02-06 08:27:04,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1930. [2025-02-06 08:27:04,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1930 states, 1289 states have (on average 1.2234290147401086) internal successors, (1577), 1342 states have internal predecessors, (1577), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-02-06 08:27:04,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 2550 transitions. [2025-02-06 08:27:04,096 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 2550 transitions. Word has length 120 [2025-02-06 08:27:04,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:04,096 INFO L471 AbstractCegarLoop]: Abstraction has 1930 states and 2550 transitions. [2025-02-06 08:27:04,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-06 08:27:04,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 2550 transitions. [2025-02-06 08:27:04,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-06 08:27:04,099 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:04,099 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-02-06 08:27:04,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 08:27:04,099 INFO L396 AbstractCegarLoop]: === Iteration 10 === 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 26 more)] === [2025-02-06 08:27:04,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:04,100 INFO L85 PathProgramCache]: Analyzing trace with hash -2132797160, now seen corresponding path program 1 times [2025-02-06 08:27:04,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:04,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277778101] [2025-02-06 08:27:04,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:04,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:04,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 08:27:04,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 08:27:04,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:04,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:04,568 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:27:04,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:04,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277778101] [2025-02-06 08:27:04,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277778101] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:04,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:04,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:27:04,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822016083] [2025-02-06 08:27:04,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:04,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:27:04,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:04,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:27:04,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:04,571 INFO L87 Difference]: Start difference. First operand 1930 states and 2550 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-02-06 08:27:04,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:04,716 INFO L93 Difference]: Finished difference Result 1930 states and 2550 transitions. [2025-02-06 08:27:04,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:27:04,717 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-02-06 08:27:04,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:04,726 INFO L225 Difference]: With dead ends: 1930 [2025-02-06 08:27:04,727 INFO L226 Difference]: Without dead ends: 1928 [2025-02-06 08:27:04,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:27:04,728 INFO L435 NwaCegarLoop]: 1355 mSDtfsCounter, 1351 mSDsluCounter, 1354 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1351 SdHoareTripleChecker+Valid, 2709 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:04,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1351 Valid, 2709 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:27:04,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2025-02-06 08:27:04,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1928. [2025-02-06 08:27:04,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1928 states, 1288 states have (on average 1.2228260869565217) internal successors, (1575), 1340 states have internal predecessors, (1575), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-02-06 08:27:04,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2548 transitions. [2025-02-06 08:27:04,867 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2548 transitions. Word has length 100 [2025-02-06 08:27:04,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:04,867 INFO L471 AbstractCegarLoop]: Abstraction has 1928 states and 2548 transitions. [2025-02-06 08:27:04,867 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-02-06 08:27:04,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2548 transitions. [2025-02-06 08:27:04,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-06 08:27:04,875 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:04,875 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-02-06 08:27:04,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 08:27:04,875 INFO L396 AbstractCegarLoop]: === Iteration 11 === 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 26 more)] === [2025-02-06 08:27:04,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:04,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1675762637, now seen corresponding path program 1 times [2025-02-06 08:27:04,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:04,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126204291] [2025-02-06 08:27:04,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:04,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:05,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 08:27:05,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 08:27:05,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:05,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:05,552 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:27:05,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:05,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126204291] [2025-02-06 08:27:05,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126204291] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:05,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:05,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:27:05,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049506107] [2025-02-06 08:27:05,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:05,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:27:05,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:05,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:27:05,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:05,554 INFO L87 Difference]: Start difference. First operand 1928 states and 2548 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-02-06 08:27:05,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:05,680 INFO L93 Difference]: Finished difference Result 1928 states and 2548 transitions. [2025-02-06 08:27:05,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:27:05,681 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-02-06 08:27:05,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:05,691 INFO L225 Difference]: With dead ends: 1928 [2025-02-06 08:27:05,691 INFO L226 Difference]: Without dead ends: 1926 [2025-02-06 08:27:05,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:27:05,692 INFO L435 NwaCegarLoop]: 1353 mSDtfsCounter, 1348 mSDsluCounter, 1352 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1348 SdHoareTripleChecker+Valid, 2705 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:05,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1348 Valid, 2705 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:27:05,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2025-02-06 08:27:05,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1926. [2025-02-06 08:27:05,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1926 states, 1287 states have (on average 1.2222222222222223) internal successors, (1573), 1338 states have internal predecessors, (1573), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-02-06 08:27:05,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 2546 transitions. [2025-02-06 08:27:05,809 INFO L78 Accepts]: Start accepts. Automaton has 1926 states and 2546 transitions. Word has length 106 [2025-02-06 08:27:05,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:05,810 INFO L471 AbstractCegarLoop]: Abstraction has 1926 states and 2546 transitions. [2025-02-06 08:27:05,810 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-02-06 08:27:05,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 2546 transitions. [2025-02-06 08:27:05,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-06 08:27:05,811 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:05,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] [2025-02-06 08:27:05,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 08:27:05,811 INFO L396 AbstractCegarLoop]: === Iteration 12 === 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 26 more)] === [2025-02-06 08:27:05,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:05,812 INFO L85 PathProgramCache]: Analyzing trace with hash 204878638, now seen corresponding path program 1 times [2025-02-06 08:27:05,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:05,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115792437] [2025-02-06 08:27:05,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:05,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:06,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 08:27:06,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 08:27:06,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:06,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:06,160 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:27:06,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:06,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115792437] [2025-02-06 08:27:06,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115792437] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:06,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:06,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:27:06,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692839379] [2025-02-06 08:27:06,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:06,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:27:06,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:06,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:27:06,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:06,163 INFO L87 Difference]: Start difference. First operand 1926 states and 2546 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-02-06 08:27:06,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:06,329 INFO L93 Difference]: Finished difference Result 1926 states and 2546 transitions. [2025-02-06 08:27:06,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:27:06,330 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-02-06 08:27:06,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:06,338 INFO L225 Difference]: With dead ends: 1926 [2025-02-06 08:27:06,339 INFO L226 Difference]: Without dead ends: 1924 [2025-02-06 08:27:06,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:27:06,340 INFO L435 NwaCegarLoop]: 1351 mSDtfsCounter, 1344 mSDsluCounter, 1350 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1344 SdHoareTripleChecker+Valid, 2701 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:06,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1344 Valid, 2701 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:27:06,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1924 states. [2025-02-06 08:27:06,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1924 to 1924. [2025-02-06 08:27:06,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1924 states, 1286 states have (on average 1.2216174183514774) internal successors, (1571), 1336 states have internal predecessors, (1571), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-02-06 08:27:06,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 2544 transitions. [2025-02-06 08:27:06,510 INFO L78 Accepts]: Start accepts. Automaton has 1924 states and 2544 transitions. Word has length 108 [2025-02-06 08:27:06,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:06,511 INFO L471 AbstractCegarLoop]: Abstraction has 1924 states and 2544 transitions. [2025-02-06 08:27:06,511 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-02-06 08:27:06,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 2544 transitions. [2025-02-06 08:27:06,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-06 08:27:06,512 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:06,512 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-02-06 08:27:06,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 08:27:06,513 INFO L396 AbstractCegarLoop]: === Iteration 13 === 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 26 more)] === [2025-02-06 08:27:06,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:06,513 INFO L85 PathProgramCache]: Analyzing trace with hash 930384464, now seen corresponding path program 1 times [2025-02-06 08:27:06,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:06,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805847154] [2025-02-06 08:27:06,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:06,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:06,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 08:27:06,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 08:27:06,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:06,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:06,933 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:27:06,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:06,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805847154] [2025-02-06 08:27:06,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805847154] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:06,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:06,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:27:06,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556918635] [2025-02-06 08:27:06,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:06,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:27:06,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:06,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:27:06,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:06,935 INFO L87 Difference]: Start difference. First operand 1924 states and 2544 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-02-06 08:27:07,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:07,093 INFO L93 Difference]: Finished difference Result 1924 states and 2544 transitions. [2025-02-06 08:27:07,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:27:07,093 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-02-06 08:27:07,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:07,100 INFO L225 Difference]: With dead ends: 1924 [2025-02-06 08:27:07,100 INFO L226 Difference]: Without dead ends: 1922 [2025-02-06 08:27:07,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:27:07,101 INFO L435 NwaCegarLoop]: 1349 mSDtfsCounter, 1343 mSDsluCounter, 1348 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1343 SdHoareTripleChecker+Valid, 2697 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:07,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1343 Valid, 2697 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:27:07,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states. [2025-02-06 08:27:07,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1922. [2025-02-06 08:27:07,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1922 states, 1285 states have (on average 1.221011673151751) internal successors, (1569), 1334 states have internal predecessors, (1569), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-02-06 08:27:07,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 2542 transitions. [2025-02-06 08:27:07,184 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 2542 transitions. Word has length 114 [2025-02-06 08:27:07,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:07,184 INFO L471 AbstractCegarLoop]: Abstraction has 1922 states and 2542 transitions. [2025-02-06 08:27:07,184 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-02-06 08:27:07,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 2542 transitions. [2025-02-06 08:27:07,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-06 08:27:07,185 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:07,185 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-02-06 08:27:07,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 08:27:07,185 INFO L396 AbstractCegarLoop]: === Iteration 14 === 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 26 more)] === [2025-02-06 08:27:07,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:07,186 INFO L85 PathProgramCache]: Analyzing trace with hash 343842681, now seen corresponding path program 1 times [2025-02-06 08:27:07,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:07,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257358720] [2025-02-06 08:27:07,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:07,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:07,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-06 08:27:07,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-06 08:27:07,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:07,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:07,617 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:27:07,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:07,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257358720] [2025-02-06 08:27:07,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257358720] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:07,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:07,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:27:07,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439756913] [2025-02-06 08:27:07,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:07,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:27:07,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:07,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:27:07,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:07,619 INFO L87 Difference]: Start difference. First operand 1922 states and 2542 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-02-06 08:27:07,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:07,758 INFO L93 Difference]: Finished difference Result 1922 states and 2542 transitions. [2025-02-06 08:27:07,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:27:07,759 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-02-06 08:27:07,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:07,766 INFO L225 Difference]: With dead ends: 1922 [2025-02-06 08:27:07,766 INFO L226 Difference]: Without dead ends: 1920 [2025-02-06 08:27:07,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:27:07,767 INFO L435 NwaCegarLoop]: 1347 mSDtfsCounter, 1340 mSDsluCounter, 1346 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1340 SdHoareTripleChecker+Valid, 2693 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:07,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1340 Valid, 2693 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:27:07,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1920 states. [2025-02-06 08:27:07,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1920 to 1920. [2025-02-06 08:27:07,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1920 states, 1284 states have (on average 1.220404984423676) internal successors, (1567), 1332 states have internal predecessors, (1567), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-02-06 08:27:07,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1920 states to 1920 states and 2540 transitions. [2025-02-06 08:27:07,883 INFO L78 Accepts]: Start accepts. Automaton has 1920 states and 2540 transitions. Word has length 120 [2025-02-06 08:27:07,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:07,884 INFO L471 AbstractCegarLoop]: Abstraction has 1920 states and 2540 transitions. [2025-02-06 08:27:07,884 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-02-06 08:27:07,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1920 states and 2540 transitions. [2025-02-06 08:27:07,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-06 08:27:07,885 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:07,885 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-02-06 08:27:07,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 08:27:07,886 INFO L396 AbstractCegarLoop]: === Iteration 15 === 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 26 more)] === [2025-02-06 08:27:07,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:07,886 INFO L85 PathProgramCache]: Analyzing trace with hash 53490328, now seen corresponding path program 1 times [2025-02-06 08:27:07,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:07,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849188841] [2025-02-06 08:27:07,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:07,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:08,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-06 08:27:08,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-06 08:27:08,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:08,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:08,369 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:27:08,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:08,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849188841] [2025-02-06 08:27:08,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849188841] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:08,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:08,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:27:08,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303225497] [2025-02-06 08:27:08,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:08,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:27:08,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:08,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:27:08,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:08,371 INFO L87 Difference]: Start difference. First operand 1920 states and 2540 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-02-06 08:27:08,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:08,511 INFO L93 Difference]: Finished difference Result 1920 states and 2540 transitions. [2025-02-06 08:27:08,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:27:08,512 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-02-06 08:27:08,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:08,522 INFO L225 Difference]: With dead ends: 1920 [2025-02-06 08:27:08,525 INFO L226 Difference]: Without dead ends: 1918 [2025-02-06 08:27:08,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:27:08,526 INFO L435 NwaCegarLoop]: 1345 mSDtfsCounter, 1337 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1337 SdHoareTripleChecker+Valid, 2689 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:08,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1337 Valid, 2689 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:27:08,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1918 states. [2025-02-06 08:27:08,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1918 to 1918. [2025-02-06 08:27:08,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1918 states, 1283 states have (on average 1.2197973499610288) internal successors, (1565), 1330 states have internal predecessors, (1565), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-02-06 08:27:08,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1918 states to 1918 states and 2538 transitions. [2025-02-06 08:27:08,621 INFO L78 Accepts]: Start accepts. Automaton has 1918 states and 2538 transitions. Word has length 126 [2025-02-06 08:27:08,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:08,621 INFO L471 AbstractCegarLoop]: Abstraction has 1918 states and 2538 transitions. [2025-02-06 08:27:08,621 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-02-06 08:27:08,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1918 states and 2538 transitions. [2025-02-06 08:27:08,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-06 08:27:08,622 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:08,622 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-02-06 08:27:08,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 08:27:08,623 INFO L396 AbstractCegarLoop]: === Iteration 16 === 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 26 more)] === [2025-02-06 08:27:08,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:08,623 INFO L85 PathProgramCache]: Analyzing trace with hash 996411755, now seen corresponding path program 1 times [2025-02-06 08:27:08,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:08,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087043926] [2025-02-06 08:27:08,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:08,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:08,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 08:27:08,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 08:27:08,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:08,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:08,964 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:27:08,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:08,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087043926] [2025-02-06 08:27:08,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087043926] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:08,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:08,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:27:08,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191193133] [2025-02-06 08:27:08,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:08,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:27:08,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:08,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:27:08,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:08,967 INFO L87 Difference]: Start difference. First operand 1918 states and 2538 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-02-06 08:27:09,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:09,109 INFO L93 Difference]: Finished difference Result 1918 states and 2538 transitions. [2025-02-06 08:27:09,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:27:09,109 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-02-06 08:27:09,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:09,120 INFO L225 Difference]: With dead ends: 1918 [2025-02-06 08:27:09,120 INFO L226 Difference]: Without dead ends: 1916 [2025-02-06 08:27:09,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:27:09,121 INFO L435 NwaCegarLoop]: 1343 mSDtfsCounter, 1334 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1334 SdHoareTripleChecker+Valid, 2685 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:09,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1334 Valid, 2685 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:27:09,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1916 states. [2025-02-06 08:27:09,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1916 to 1916. [2025-02-06 08:27:09,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1916 states, 1282 states have (on average 1.219188767550702) internal successors, (1563), 1328 states have internal predecessors, (1563), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-02-06 08:27:09,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1916 states and 2536 transitions. [2025-02-06 08:27:09,248 INFO L78 Accepts]: Start accepts. Automaton has 1916 states and 2536 transitions. Word has length 132 [2025-02-06 08:27:09,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:09,248 INFO L471 AbstractCegarLoop]: Abstraction has 1916 states and 2536 transitions. [2025-02-06 08:27:09,248 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-02-06 08:27:09,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 2536 transitions. [2025-02-06 08:27:09,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-06 08:27:09,249 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:09,250 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:27:09,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 08:27:09,250 INFO L396 AbstractCegarLoop]: === Iteration 17 === 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 26 more)] === [2025-02-06 08:27:09,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:09,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1899052602, now seen corresponding path program 1 times [2025-02-06 08:27:09,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:09,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911438502] [2025-02-06 08:27:09,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:09,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:09,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-06 08:27:09,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-06 08:27:09,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:09,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:09,551 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-02-06 08:27:09,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:09,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911438502] [2025-02-06 08:27:09,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911438502] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:09,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:09,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:27:09,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582618262] [2025-02-06 08:27:09,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:09,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:27:09,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:09,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:27:09,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:27:09,554 INFO L87 Difference]: Start difference. First operand 1916 states and 2536 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 08:27:09,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:09,778 INFO L93 Difference]: Finished difference Result 3805 states and 5034 transitions. [2025-02-06 08:27:09,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:27:09,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (19), 1 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 154 [2025-02-06 08:27:09,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:09,788 INFO L225 Difference]: With dead ends: 3805 [2025-02-06 08:27:09,788 INFO L226 Difference]: Without dead ends: 1910 [2025-02-06 08:27:09,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:27:09,794 INFO L435 NwaCegarLoop]: 1339 mSDtfsCounter, 1352 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1352 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:09,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1352 Valid, 1339 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:27:09,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1910 states. [2025-02-06 08:27:09,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1910 to 1910. [2025-02-06 08:27:09,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1910 states, 1277 states have (on average 1.2169146436961629) internal successors, (1554), 1322 states have internal predecessors, (1554), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-02-06 08:27:09,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 2527 transitions. [2025-02-06 08:27:09,964 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 2527 transitions. Word has length 154 [2025-02-06 08:27:09,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:09,964 INFO L471 AbstractCegarLoop]: Abstraction has 1910 states and 2527 transitions. [2025-02-06 08:27:09,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 08:27:09,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 2527 transitions. [2025-02-06 08:27:09,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-06 08:27:09,966 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:09,966 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-02-06 08:27:09,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 08:27:09,967 INFO L396 AbstractCegarLoop]: === Iteration 18 === 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 26 more)] === [2025-02-06 08:27:09,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:09,967 INFO L85 PathProgramCache]: Analyzing trace with hash 207833989, now seen corresponding path program 1 times [2025-02-06 08:27:09,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:09,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735624933] [2025-02-06 08:27:09,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:09,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:10,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-06 08:27:10,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-06 08:27:10,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:10,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:10,441 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:27:10,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:10,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735624933] [2025-02-06 08:27:10,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735624933] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:10,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:10,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:27:10,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340132463] [2025-02-06 08:27:10,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:10,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:27:10,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:10,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:27:10,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:10,444 INFO L87 Difference]: Start difference. First operand 1910 states and 2527 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-02-06 08:27:10,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:10,658 INFO L93 Difference]: Finished difference Result 1910 states and 2527 transitions. [2025-02-06 08:27:10,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:27:10,658 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-02-06 08:27:10,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:10,665 INFO L225 Difference]: With dead ends: 1910 [2025-02-06 08:27:10,665 INFO L226 Difference]: Without dead ends: 1908 [2025-02-06 08:27:10,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:27:10,666 INFO L435 NwaCegarLoop]: 1336 mSDtfsCounter, 1326 mSDsluCounter, 1335 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1326 SdHoareTripleChecker+Valid, 2671 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:10,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1326 Valid, 2671 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:27:10,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1908 states. [2025-02-06 08:27:10,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1908 to 1908. [2025-02-06 08:27:10,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1908 states, 1276 states have (on average 1.2163009404388714) internal successors, (1552), 1320 states have internal predecessors, (1552), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-02-06 08:27:10,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1908 states to 1908 states and 2525 transitions. [2025-02-06 08:27:10,774 INFO L78 Accepts]: Start accepts. Automaton has 1908 states and 2525 transitions. Word has length 138 [2025-02-06 08:27:10,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:10,774 INFO L471 AbstractCegarLoop]: Abstraction has 1908 states and 2525 transitions. [2025-02-06 08:27:10,774 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-02-06 08:27:10,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1908 states and 2525 transitions. [2025-02-06 08:27:10,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 08:27:10,776 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:10,777 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:27:10,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 08:27:10,777 INFO L396 AbstractCegarLoop]: === Iteration 19 === 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 26 more)] === [2025-02-06 08:27:10,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:10,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1790619803, now seen corresponding path program 1 times [2025-02-06 08:27:10,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:10,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136623990] [2025-02-06 08:27:10,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:10,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:10,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 08:27:11,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 08:27:11,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:11,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:11,145 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2025-02-06 08:27:11,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:11,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136623990] [2025-02-06 08:27:11,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136623990] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:27:11,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855320484] [2025-02-06 08:27:11,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:11,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:27:11,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:27:11,151 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:27:11,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 08:27:11,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 08:27:12,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 08:27:12,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:12,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:12,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 1984 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 08:27:12,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:27:12,281 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-06 08:27:12,281 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:27:12,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855320484] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:12,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:27:12,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-06 08:27:12,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357834866] [2025-02-06 08:27:12,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:12,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:27:12,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:12,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:27:12,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:27:12,282 INFO L87 Difference]: Start difference. First operand 1908 states and 2525 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 08:27:12,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:12,472 INFO L93 Difference]: Finished difference Result 3789 states and 5012 transitions. [2025-02-06 08:27:12,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:27:12,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 160 [2025-02-06 08:27:12,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:12,483 INFO L225 Difference]: With dead ends: 3789 [2025-02-06 08:27:12,483 INFO L226 Difference]: Without dead ends: 1902 [2025-02-06 08:27:12,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:27:12,489 INFO L435 NwaCegarLoop]: 1332 mSDtfsCounter, 1300 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1300 SdHoareTripleChecker+Valid, 1332 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:12,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1300 Valid, 1332 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:27:12,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2025-02-06 08:27:12,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1902. [2025-02-06 08:27:12,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1902 states, 1271 states have (on average 1.2140047206923683) internal successors, (1543), 1314 states have internal predecessors, (1543), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-02-06 08:27:12,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1902 states and 2516 transitions. [2025-02-06 08:27:12,604 INFO L78 Accepts]: Start accepts. Automaton has 1902 states and 2516 transitions. Word has length 160 [2025-02-06 08:27:12,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:12,604 INFO L471 AbstractCegarLoop]: Abstraction has 1902 states and 2516 transitions. [2025-02-06 08:27:12,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 08:27:12,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 2516 transitions. [2025-02-06 08:27:12,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-06 08:27:12,606 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:12,606 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-02-06 08:27:12,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 08:27:12,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:27:12,811 INFO L396 AbstractCegarLoop]: === Iteration 20 === 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 26 more)] === [2025-02-06 08:27:12,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:12,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1180983305, now seen corresponding path program 1 times [2025-02-06 08:27:12,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:12,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132794840] [2025-02-06 08:27:12,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:12,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:13,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 08:27:13,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 08:27:13,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:13,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:13,203 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:27:13,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:13,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132794840] [2025-02-06 08:27:13,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132794840] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:13,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:13,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:27:13,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263906509] [2025-02-06 08:27:13,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:13,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:27:13,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:13,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:27:13,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:13,205 INFO L87 Difference]: Start difference. First operand 1902 states and 2516 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-02-06 08:27:13,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:13,365 INFO L93 Difference]: Finished difference Result 1902 states and 2516 transitions. [2025-02-06 08:27:13,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:27:13,366 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-02-06 08:27:13,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:13,371 INFO L225 Difference]: With dead ends: 1902 [2025-02-06 08:27:13,371 INFO L226 Difference]: Without dead ends: 1900 [2025-02-06 08:27:13,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:27:13,374 INFO L435 NwaCegarLoop]: 1329 mSDtfsCounter, 1318 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1318 SdHoareTripleChecker+Valid, 2657 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:13,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1318 Valid, 2657 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:27:13,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1900 states. [2025-02-06 08:27:13,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1900 to 1900. [2025-02-06 08:27:13,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1900 states, 1270 states have (on average 1.2133858267716535) internal successors, (1541), 1312 states have internal predecessors, (1541), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-02-06 08:27:13,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1900 states to 1900 states and 2514 transitions. [2025-02-06 08:27:13,485 INFO L78 Accepts]: Start accepts. Automaton has 1900 states and 2514 transitions. Word has length 144 [2025-02-06 08:27:13,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:13,485 INFO L471 AbstractCegarLoop]: Abstraction has 1900 states and 2514 transitions. [2025-02-06 08:27:13,486 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-02-06 08:27:13,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 2514 transitions. [2025-02-06 08:27:13,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-06 08:27:13,487 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:13,488 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-02-06 08:27:13,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 08:27:13,488 INFO L396 AbstractCegarLoop]: === Iteration 21 === 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 26 more)] === [2025-02-06 08:27:13,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:13,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1831045724, now seen corresponding path program 1 times [2025-02-06 08:27:13,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:13,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454205489] [2025-02-06 08:27:13,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:13,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:13,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 08:27:13,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 08:27:13,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:13,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:14,052 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:27:14,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:14,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454205489] [2025-02-06 08:27:14,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454205489] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:14,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:14,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:27:14,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519387142] [2025-02-06 08:27:14,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:14,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:27:14,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:14,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:27:14,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:14,055 INFO L87 Difference]: Start difference. First operand 1900 states and 2514 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 08:27:14,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:14,372 INFO L93 Difference]: Finished difference Result 1900 states and 2514 transitions. [2025-02-06 08:27:14,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:27:14,372 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 150 [2025-02-06 08:27:14,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:14,379 INFO L225 Difference]: With dead ends: 1900 [2025-02-06 08:27:14,379 INFO L226 Difference]: Without dead ends: 1898 [2025-02-06 08:27:14,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:27:14,381 INFO L435 NwaCegarLoop]: 1327 mSDtfsCounter, 1315 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1315 SdHoareTripleChecker+Valid, 2653 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:14,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1315 Valid, 2653 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:27:14,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2025-02-06 08:27:14,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1898. [2025-02-06 08:27:14,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1898 states, 1269 states have (on average 1.2127659574468086) internal successors, (1539), 1310 states have internal predecessors, (1539), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-02-06 08:27:14,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 2512 transitions. [2025-02-06 08:27:14,549 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 2512 transitions. Word has length 150 [2025-02-06 08:27:14,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:14,549 INFO L471 AbstractCegarLoop]: Abstraction has 1898 states and 2512 transitions. [2025-02-06 08:27:14,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 08:27:14,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2512 transitions. [2025-02-06 08:27:14,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 08:27:14,550 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:14,551 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, 1, 1, 1, 1, 1, 1] [2025-02-06 08:27:14,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 08:27:14,551 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-06 08:27:14,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:14,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1920474254, now seen corresponding path program 1 times [2025-02-06 08:27:14,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:14,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244047928] [2025-02-06 08:27:14,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:14,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:14,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 08:27:14,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 08:27:14,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:14,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:14,883 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:27:14,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:14,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244047928] [2025-02-06 08:27:14,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244047928] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:14,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:14,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:27:14,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448817115] [2025-02-06 08:27:14,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:14,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:27:14,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:14,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:27:14,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:14,885 INFO L87 Difference]: Start difference. First operand 1898 states and 2512 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-06 08:27:15,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:15,083 INFO L93 Difference]: Finished difference Result 1898 states and 2512 transitions. [2025-02-06 08:27:15,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:27:15,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 156 [2025-02-06 08:27:15,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:15,091 INFO L225 Difference]: With dead ends: 1898 [2025-02-06 08:27:15,091 INFO L226 Difference]: Without dead ends: 1896 [2025-02-06 08:27:15,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:27:15,094 INFO L435 NwaCegarLoop]: 1325 mSDtfsCounter, 1312 mSDsluCounter, 1324 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1312 SdHoareTripleChecker+Valid, 2649 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:15,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1312 Valid, 2649 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:27:15,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2025-02-06 08:27:15,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1896. [2025-02-06 08:27:15,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1896 states, 1268 states have (on average 1.2121451104100947) internal successors, (1537), 1308 states have internal predecessors, (1537), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-02-06 08:27:15,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2510 transitions. [2025-02-06 08:27:15,217 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2510 transitions. Word has length 156 [2025-02-06 08:27:15,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:15,217 INFO L471 AbstractCegarLoop]: Abstraction has 1896 states and 2510 transitions. [2025-02-06 08:27:15,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-06 08:27:15,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2510 transitions. [2025-02-06 08:27:15,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-06 08:27:15,219 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:15,219 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:27:15,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 08:27:15,220 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_linux_net_sock_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 26 more)] === [2025-02-06 08:27:15,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:15,220 INFO L85 PathProgramCache]: Analyzing trace with hash -182018461, now seen corresponding path program 1 times [2025-02-06 08:27:15,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:15,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348228132] [2025-02-06 08:27:15,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:15,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:15,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-06 08:27:15,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-06 08:27:15,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:15,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:15,570 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:27:15,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:15,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348228132] [2025-02-06 08:27:15,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348228132] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:15,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:15,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:27:15,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593709142] [2025-02-06 08:27:15,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:15,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:27:15,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:15,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:27:15,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:15,572 INFO L87 Difference]: Start difference. First operand 1896 states and 2510 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-02-06 08:27:15,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:15,764 INFO L93 Difference]: Finished difference Result 1896 states and 2510 transitions. [2025-02-06 08:27:15,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:27:15,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 162 [2025-02-06 08:27:15,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:15,771 INFO L225 Difference]: With dead ends: 1896 [2025-02-06 08:27:15,771 INFO L226 Difference]: Without dead ends: 1894 [2025-02-06 08:27:15,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:27:15,772 INFO L435 NwaCegarLoop]: 1323 mSDtfsCounter, 1309 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1309 SdHoareTripleChecker+Valid, 2645 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:15,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1309 Valid, 2645 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:27:15,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states. [2025-02-06 08:27:15,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 1894. [2025-02-06 08:27:15,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1894 states, 1267 states have (on average 1.2115232833464877) internal successors, (1535), 1306 states have internal predecessors, (1535), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-02-06 08:27:15,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 2508 transitions. [2025-02-06 08:27:15,936 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 2508 transitions. Word has length 162 [2025-02-06 08:27:15,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:15,937 INFO L471 AbstractCegarLoop]: Abstraction has 1894 states and 2508 transitions. [2025-02-06 08:27:15,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-02-06 08:27:15,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 2508 transitions. [2025-02-06 08:27:15,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-06 08:27:15,939 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:15,939 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:27:15,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 08:27:15,939 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_linux_usb_coherent_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 26 more)] === [2025-02-06 08:27:15,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:15,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1078011449, now seen corresponding path program 1 times [2025-02-06 08:27:15,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:15,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312586525] [2025-02-06 08:27:15,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:15,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:16,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-06 08:27:16,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-06 08:27:16,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:16,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:16,264 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:27:16,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:16,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312586525] [2025-02-06 08:27:16,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312586525] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:16,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:16,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:27:16,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343382832] [2025-02-06 08:27:16,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:16,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:27:16,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:16,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:27:16,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:16,266 INFO L87 Difference]: Start difference. First operand 1894 states and 2508 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 08:27:16,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:16,460 INFO L93 Difference]: Finished difference Result 1894 states and 2508 transitions. [2025-02-06 08:27:16,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:27:16,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 168 [2025-02-06 08:27:16,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:16,467 INFO L225 Difference]: With dead ends: 1894 [2025-02-06 08:27:16,467 INFO L226 Difference]: Without dead ends: 1892 [2025-02-06 08:27:16,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:27:16,469 INFO L435 NwaCegarLoop]: 1321 mSDtfsCounter, 1306 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1306 SdHoareTripleChecker+Valid, 2641 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:16,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1306 Valid, 2641 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:27:16,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2025-02-06 08:27:16,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1892. [2025-02-06 08:27:16,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1892 states, 1266 states have (on average 1.2109004739336493) internal successors, (1533), 1304 states have internal predecessors, (1533), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-02-06 08:27:16,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1892 states and 2506 transitions. [2025-02-06 08:27:16,597 INFO L78 Accepts]: Start accepts. Automaton has 1892 states and 2506 transitions. Word has length 168 [2025-02-06 08:27:16,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:16,598 INFO L471 AbstractCegarLoop]: Abstraction has 1892 states and 2506 transitions. [2025-02-06 08:27:16,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 08:27:16,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2506 transitions. [2025-02-06 08:27:16,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-02-06 08:27:16,600 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:16,600 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:27:16,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 08:27:16,601 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_linux_usb_gadget_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 26 more)] === [2025-02-06 08:27:16,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:16,601 INFO L85 PathProgramCache]: Analyzing trace with hash 2018245669, now seen corresponding path program 1 times [2025-02-06 08:27:16,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:16,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962750398] [2025-02-06 08:27:16,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:16,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:16,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-06 08:27:16,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-06 08:27:16,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:16,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:16,968 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:27:16,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:16,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962750398] [2025-02-06 08:27:16,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962750398] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:16,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:16,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:27:16,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621839900] [2025-02-06 08:27:16,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:16,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:27:16,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:16,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:27:16,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:16,970 INFO L87 Difference]: Start difference. First operand 1892 states and 2506 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-06 08:27:17,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:17,173 INFO L93 Difference]: Finished difference Result 1892 states and 2506 transitions. [2025-02-06 08:27:17,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:27:17,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 174 [2025-02-06 08:27:17,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:17,180 INFO L225 Difference]: With dead ends: 1892 [2025-02-06 08:27:17,180 INFO L226 Difference]: Without dead ends: 1890 [2025-02-06 08:27:17,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:27:17,181 INFO L435 NwaCegarLoop]: 1319 mSDtfsCounter, 1303 mSDsluCounter, 1318 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1303 SdHoareTripleChecker+Valid, 2637 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:17,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1303 Valid, 2637 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:27:17,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1890 states. [2025-02-06 08:27:17,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1890 to 1890. [2025-02-06 08:27:17,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1890 states, 1265 states have (on average 1.2102766798418971) internal successors, (1531), 1302 states have internal predecessors, (1531), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-02-06 08:27:17,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 2504 transitions. [2025-02-06 08:27:17,316 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 2504 transitions. Word has length 174 [2025-02-06 08:27:17,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:17,318 INFO L471 AbstractCegarLoop]: Abstraction has 1890 states and 2504 transitions. [2025-02-06 08:27:17,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-06 08:27:17,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 2504 transitions. [2025-02-06 08:27:17,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-02-06 08:27:17,320 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:17,320 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:27:17,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 08:27:17,320 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-06 08:27:17,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:17,321 INFO L85 PathProgramCache]: Analyzing trace with hash 357130641, now seen corresponding path program 1 times [2025-02-06 08:27:17,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:17,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019719383] [2025-02-06 08:27:17,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:17,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:17,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-02-06 08:27:17,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-02-06 08:27:17,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:17,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:18,143 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2025-02-06 08:27:18,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:18,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019719383] [2025-02-06 08:27:18,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019719383] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:18,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:18,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 08:27:18,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806722929] [2025-02-06 08:27:18,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:18,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 08:27:18,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:18,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 08:27:18,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:27:18,145 INFO L87 Difference]: Start difference. First operand 1890 states and 2504 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 4 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-06 08:27:22,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 08:27:26,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 08:27:30,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:30,479 INFO L93 Difference]: Finished difference Result 3055 states and 3996 transitions. [2025-02-06 08:27:30,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 08:27:30,479 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 4 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 222 [2025-02-06 08:27:30,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:30,489 INFO L225 Difference]: With dead ends: 3055 [2025-02-06 08:27:30,490 INFO L226 Difference]: Without dead ends: 3053 [2025-02-06 08:27:30,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:27:30,491 INFO L435 NwaCegarLoop]: 1947 mSDtfsCounter, 2995 mSDsluCounter, 4077 mSDsCounter, 0 mSdLazyCounter, 4132 mSolverCounterSat, 665 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3245 SdHoareTripleChecker+Valid, 6024 SdHoareTripleChecker+Invalid, 4799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 665 IncrementalHoareTripleChecker+Valid, 4132 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:30,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3245 Valid, 6024 Invalid, 4799 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [665 Valid, 4132 Invalid, 2 Unknown, 0 Unchecked, 11.9s Time] [2025-02-06 08:27:30,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3053 states. [2025-02-06 08:27:30,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3053 to 2748. [2025-02-06 08:27:30,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2748 states, 1843 states have (on average 1.2154096581660336) internal successors, (2240), 1898 states have internal predecessors, (2240), 708 states have call successors, (708), 194 states have call predecessors, (708), 192 states have return successors, (708), 684 states have call predecessors, (708), 706 states have call successors, (708) [2025-02-06 08:27:30,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2748 states to 2748 states and 3656 transitions. [2025-02-06 08:27:30,766 INFO L78 Accepts]: Start accepts. Automaton has 2748 states and 3656 transitions. Word has length 222 [2025-02-06 08:27:30,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:30,766 INFO L471 AbstractCegarLoop]: Abstraction has 2748 states and 3656 transitions. [2025-02-06 08:27:30,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 4 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-06 08:27:30,767 INFO L276 IsEmpty]: Start isEmpty. Operand 2748 states and 3656 transitions. [2025-02-06 08:27:30,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-02-06 08:27:30,768 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:30,768 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:27:30,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 08:27:30,768 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-06 08:27:30,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:30,769 INFO L85 PathProgramCache]: Analyzing trace with hash 575985359, now seen corresponding path program 1 times [2025-02-06 08:27:30,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:30,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152833963] [2025-02-06 08:27:30,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:30,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:30,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-02-06 08:27:31,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-02-06 08:27:31,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:31,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:31,616 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-02-06 08:27:31,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:31,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152833963] [2025-02-06 08:27:31,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152833963] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:27:31,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489948858] [2025-02-06 08:27:31,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:31,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:27:31,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:27:31,620 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:27:31,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 08:27:32,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-02-06 08:27:32,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-02-06 08:27:32,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:32,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:32,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 2273 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-06 08:27:32,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:27:32,930 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 104 proven. 3 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-02-06 08:27:32,930 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:27:33,459 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2025-02-06 08:27:33,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489948858] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:27:33,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:27:33,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 22 [2025-02-06 08:27:33,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475813152] [2025-02-06 08:27:33,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:27:33,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 08:27:33,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:33,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 08:27:33,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=414, Unknown=0, NotChecked=0, Total=462 [2025-02-06 08:27:33,462 INFO L87 Difference]: Start difference. First operand 2748 states and 3656 transitions. Second operand has 22 states, 21 states have (on average 8.047619047619047) internal successors, (169), 18 states have internal predecessors, (169), 6 states have call successors, (57), 2 states have call predecessors, (57), 7 states have return successors, (60), 9 states have call predecessors, (60), 6 states have call successors, (60) [2025-02-06 08:27:34,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:34,878 INFO L93 Difference]: Finished difference Result 5512 states and 7332 transitions. [2025-02-06 08:27:34,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 08:27:34,879 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 8.047619047619047) internal successors, (169), 18 states have internal predecessors, (169), 6 states have call successors, (57), 2 states have call predecessors, (57), 7 states have return successors, (60), 9 states have call predecessors, (60), 6 states have call successors, (60) Word has length 222 [2025-02-06 08:27:34,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:34,889 INFO L225 Difference]: With dead ends: 5512 [2025-02-06 08:27:34,889 INFO L226 Difference]: Without dead ends: 2781 [2025-02-06 08:27:34,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 433 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2025-02-06 08:27:34,895 INFO L435 NwaCegarLoop]: 1293 mSDtfsCounter, 780 mSDsluCounter, 20106 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 21399 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:34,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 21399 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 08:27:34,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2781 states. [2025-02-06 08:27:35,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2781 to 2781. [2025-02-06 08:27:35,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2781 states, 1867 states have (on average 1.2121049812533475) internal successors, (2263), 1921 states have internal predecessors, (2263), 711 states have call successors, (711), 194 states have call predecessors, (711), 198 states have return successors, (723), 693 states have call predecessors, (723), 709 states have call successors, (723) [2025-02-06 08:27:35,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2781 states to 2781 states and 3697 transitions. [2025-02-06 08:27:35,115 INFO L78 Accepts]: Start accepts. Automaton has 2781 states and 3697 transitions. Word has length 222 [2025-02-06 08:27:35,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:35,115 INFO L471 AbstractCegarLoop]: Abstraction has 2781 states and 3697 transitions. [2025-02-06 08:27:35,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 8.047619047619047) internal successors, (169), 18 states have internal predecessors, (169), 6 states have call successors, (57), 2 states have call predecessors, (57), 7 states have return successors, (60), 9 states have call predecessors, (60), 6 states have call successors, (60) [2025-02-06 08:27:35,115 INFO L276 IsEmpty]: Start isEmpty. Operand 2781 states and 3697 transitions. [2025-02-06 08:27:35,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-06 08:27:35,117 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:35,117 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:27:35,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 08:27:35,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-02-06 08:27:35,321 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_linux_usb_urb_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 26 more)] === [2025-02-06 08:27:35,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:35,322 INFO L85 PathProgramCache]: Analyzing trace with hash -619308751, now seen corresponding path program 1 times [2025-02-06 08:27:35,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:35,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939373437] [2025-02-06 08:27:35,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:35,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:35,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-06 08:27:35,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-06 08:27:35,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:35,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:35,727 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:27:35,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:35,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939373437] [2025-02-06 08:27:35,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939373437] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:35,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:35,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:27:35,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718199815] [2025-02-06 08:27:35,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:35,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:27:35,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:35,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:27:35,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:35,729 INFO L87 Difference]: Start difference. First operand 2781 states and 3697 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-06 08:27:35,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:35,991 INFO L93 Difference]: Finished difference Result 2781 states and 3697 transitions. [2025-02-06 08:27:35,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:27:35,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 180 [2025-02-06 08:27:35,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:35,999 INFO L225 Difference]: With dead ends: 2781 [2025-02-06 08:27:35,999 INFO L226 Difference]: Without dead ends: 2606 [2025-02-06 08:27:36,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:27:36,001 INFO L435 NwaCegarLoop]: 1317 mSDtfsCounter, 1299 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1299 SdHoareTripleChecker+Valid, 2634 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:36,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1299 Valid, 2634 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:27:36,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2606 states. [2025-02-06 08:27:36,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2606 to 2606. [2025-02-06 08:27:36,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2606 states, 1762 states have (on average 1.2224744608399547) internal successors, (2154), 1813 states have internal predecessors, (2154), 662 states have call successors, (662), 174 states have call predecessors, (662), 178 states have return successors, (674), 646 states have call predecessors, (674), 660 states have call successors, (674) [2025-02-06 08:27:36,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2606 states to 2606 states and 3490 transitions. [2025-02-06 08:27:36,208 INFO L78 Accepts]: Start accepts. Automaton has 2606 states and 3490 transitions. Word has length 180 [2025-02-06 08:27:36,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:36,209 INFO L471 AbstractCegarLoop]: Abstraction has 2606 states and 3490 transitions. [2025-02-06 08:27:36,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-06 08:27:36,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2606 states and 3490 transitions. [2025-02-06 08:27:36,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-02-06 08:27:36,210 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:36,210 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:27:36,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 08:27:36,210 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-06 08:27:36,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:36,211 INFO L85 PathProgramCache]: Analyzing trace with hash -142744378, now seen corresponding path program 1 times [2025-02-06 08:27:36,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:36,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173269303] [2025-02-06 08:27:36,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:36,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:36,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-02-06 08:27:36,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-02-06 08:27:36,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:36,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:37,310 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2025-02-06 08:27:37,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:37,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173269303] [2025-02-06 08:27:37,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173269303] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:37,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:37,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 08:27:37,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902132379] [2025-02-06 08:27:37,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:37,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 08:27:37,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:37,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 08:27:37,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 08:27:37,312 INFO L87 Difference]: Start difference. First operand 2606 states and 3490 transitions. Second operand has 10 states, 10 states have (on average 10.0) internal successors, (100), 8 states have internal predecessors, (100), 3 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (31), 5 states have call predecessors, (31), 3 states have call successors, (31) [2025-02-06 08:27:38,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:38,079 INFO L93 Difference]: Finished difference Result 5199 states and 6963 transitions. [2025-02-06 08:27:38,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 08:27:38,080 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 8 states have internal predecessors, (100), 3 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (31), 5 states have call predecessors, (31), 3 states have call successors, (31) Word has length 247 [2025-02-06 08:27:38,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:38,092 INFO L225 Difference]: With dead ends: 5199 [2025-02-06 08:27:38,092 INFO L226 Difference]: Without dead ends: 2612 [2025-02-06 08:27:38,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 08:27:38,102 INFO L435 NwaCegarLoop]: 1157 mSDtfsCounter, 0 mSDsluCounter, 9237 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10394 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:38,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10394 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 08:27:38,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2612 states. [2025-02-06 08:27:38,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2612 to 2612. [2025-02-06 08:27:38,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2612 states, 1768 states have (on average 1.2217194570135748) internal successors, (2160), 1816 states have internal predecessors, (2160), 662 states have call successors, (662), 174 states have call predecessors, (662), 178 states have return successors, (674), 649 states have call predecessors, (674), 660 states have call successors, (674) [2025-02-06 08:27:38,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2612 states to 2612 states and 3496 transitions. [2025-02-06 08:27:38,325 INFO L78 Accepts]: Start accepts. Automaton has 2612 states and 3496 transitions. Word has length 247 [2025-02-06 08:27:38,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:38,326 INFO L471 AbstractCegarLoop]: Abstraction has 2612 states and 3496 transitions. [2025-02-06 08:27:38,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 8 states have internal predecessors, (100), 3 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (31), 5 states have call predecessors, (31), 3 states have call successors, (31) [2025-02-06 08:27:38,326 INFO L276 IsEmpty]: Start isEmpty. Operand 2612 states and 3496 transitions. [2025-02-06 08:27:38,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-02-06 08:27:38,327 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:38,327 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:27:38,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-06 08:27:38,328 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-06 08:27:38,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:38,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1251457504, now seen corresponding path program 1 times [2025-02-06 08:27:38,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:38,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899881328] [2025-02-06 08:27:38,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:38,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:38,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-02-06 08:27:38,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-02-06 08:27:38,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:38,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:39,887 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-02-06 08:27:39,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:39,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899881328] [2025-02-06 08:27:39,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899881328] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:39,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:39,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 08:27:39,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220195935] [2025-02-06 08:27:39,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:39,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 08:27:39,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:39,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 08:27:39,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:27:39,889 INFO L87 Difference]: Start difference. First operand 2612 states and 3496 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 7 states have internal predecessors, (93), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (29), 4 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-06 08:27:40,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:40,427 INFO L93 Difference]: Finished difference Result 5232 states and 7005 transitions. [2025-02-06 08:27:40,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 08:27:40,428 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 7 states have internal predecessors, (93), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (29), 4 states have call predecessors, (29), 2 states have call successors, (29) Word has length 268 [2025-02-06 08:27:40,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:40,459 INFO L225 Difference]: With dead ends: 5232 [2025-02-06 08:27:40,459 INFO L226 Difference]: Without dead ends: 2639 [2025-02-06 08:27:40,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:27:40,479 INFO L435 NwaCegarLoop]: 1155 mSDtfsCounter, 0 mSDsluCounter, 8075 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9230 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:40,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9230 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:27:40,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2639 states. [2025-02-06 08:27:40,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2639 to 2639. [2025-02-06 08:27:40,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2639 states, 1789 states have (on average 1.2191168250419229) internal successors, (2181), 1837 states have internal predecessors, (2181), 662 states have call successors, (662), 174 states have call predecessors, (662), 184 states have return successors, (683), 655 states have call predecessors, (683), 660 states have call successors, (683) [2025-02-06 08:27:40,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 3526 transitions. [2025-02-06 08:27:40,999 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 3526 transitions. Word has length 268 [2025-02-06 08:27:40,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:40,999 INFO L471 AbstractCegarLoop]: Abstraction has 2639 states and 3526 transitions. [2025-02-06 08:27:40,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 7 states have internal predecessors, (93), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (29), 4 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-06 08:27:41,000 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 3526 transitions. [2025-02-06 08:27:41,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-02-06 08:27:41,003 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:41,003 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:27:41,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-06 08:27:41,007 INFO L396 AbstractCegarLoop]: === Iteration 31 === 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 26 more)] === [2025-02-06 08:27:41,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:41,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1412661762, now seen corresponding path program 1 times [2025-02-06 08:27:41,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:41,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709476900] [2025-02-06 08:27:41,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:41,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:41,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-02-06 08:27:41,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-02-06 08:27:41,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:41,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:41,713 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2025-02-06 08:27:41,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:41,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709476900] [2025-02-06 08:27:41,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709476900] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:41,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:41,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:27:41,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307908894] [2025-02-06 08:27:41,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:41,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 08:27:41,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:41,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 08:27:41,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:27:41,715 INFO L87 Difference]: Start difference. First operand 2639 states and 3526 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (33), 3 states have call predecessors, (33), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-02-06 08:27:42,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:42,025 INFO L93 Difference]: Finished difference Result 2657 states and 3538 transitions. [2025-02-06 08:27:42,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:27:42,026 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (33), 3 states have call predecessors, (33), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 244 [2025-02-06 08:27:42,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:42,044 INFO L225 Difference]: With dead ends: 2657 [2025-02-06 08:27:42,044 INFO L226 Difference]: Without dead ends: 2655 [2025-02-06 08:27:42,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:27:42,046 INFO L435 NwaCegarLoop]: 1157 mSDtfsCounter, 1087 mSDsluCounter, 2346 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1088 SdHoareTripleChecker+Valid, 3503 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:42,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1088 Valid, 3503 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:27:42,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2655 states. [2025-02-06 08:27:42,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2655 to 2655. [2025-02-06 08:27:42,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2655 states, 1800 states have (on average 1.2161111111111111) internal successors, (2189), 1847 states have internal predecessors, (2189), 662 states have call successors, (662), 180 states have call predecessors, (662), 190 states have return successors, (683), 655 states have call predecessors, (683), 660 states have call successors, (683) [2025-02-06 08:27:42,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2655 states to 2655 states and 3534 transitions. [2025-02-06 08:27:42,527 INFO L78 Accepts]: Start accepts. Automaton has 2655 states and 3534 transitions. Word has length 244 [2025-02-06 08:27:42,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:42,531 INFO L471 AbstractCegarLoop]: Abstraction has 2655 states and 3534 transitions. [2025-02-06 08:27:42,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (33), 3 states have call predecessors, (33), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-02-06 08:27:42,532 INFO L276 IsEmpty]: Start isEmpty. Operand 2655 states and 3534 transitions. [2025-02-06 08:27:42,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2025-02-06 08:27:42,533 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:42,533 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:27:42,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-06 08:27:42,534 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-06 08:27:42,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:42,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1267818099, now seen corresponding path program 1 times [2025-02-06 08:27:42,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:42,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535864573] [2025-02-06 08:27:42,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:42,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:42,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 284 statements into 1 equivalence classes. [2025-02-06 08:27:42,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 284 of 284 statements. [2025-02-06 08:27:42,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:42,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:45,007 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2025-02-06 08:27:45,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:45,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535864573] [2025-02-06 08:27:45,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535864573] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:45,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:45,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 08:27:45,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026488628] [2025-02-06 08:27:45,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:45,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 08:27:45,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:45,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 08:27:45,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 08:27:45,009 INFO L87 Difference]: Start difference. First operand 2655 states and 3534 transitions. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 8 states have internal predecessors, (95), 3 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (32), 5 states have call predecessors, (32), 3 states have call successors, (32) [2025-02-06 08:27:45,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:45,482 INFO L93 Difference]: Finished difference Result 4942 states and 6532 transitions. [2025-02-06 08:27:45,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 08:27:45,483 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 8 states have internal predecessors, (95), 3 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (32), 5 states have call predecessors, (32), 3 states have call successors, (32) Word has length 284 [2025-02-06 08:27:45,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:45,492 INFO L225 Difference]: With dead ends: 4942 [2025-02-06 08:27:45,492 INFO L226 Difference]: Without dead ends: 2306 [2025-02-06 08:27:45,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 08:27:45,500 INFO L435 NwaCegarLoop]: 1151 mSDtfsCounter, 0 mSDsluCounter, 9193 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10344 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:45,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10344 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:27:45,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2025-02-06 08:27:45,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 2291. [2025-02-06 08:27:45,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2291 states, 1539 states have (on average 1.1975308641975309) internal successors, (1843), 1578 states have internal predecessors, (1843), 573 states have call successors, (573), 168 states have call predecessors, (573), 176 states have return successors, (590), 568 states have call predecessors, (590), 571 states have call successors, (590) [2025-02-06 08:27:45,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 3006 transitions. [2025-02-06 08:27:45,703 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 3006 transitions. Word has length 284 [2025-02-06 08:27:45,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:45,704 INFO L471 AbstractCegarLoop]: Abstraction has 2291 states and 3006 transitions. [2025-02-06 08:27:45,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 8 states have internal predecessors, (95), 3 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (32), 5 states have call predecessors, (32), 3 states have call successors, (32) [2025-02-06 08:27:45,704 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 3006 transitions. [2025-02-06 08:27:45,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-02-06 08:27:45,706 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:45,706 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:27:45,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-06 08:27:45,706 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-06 08:27:45,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:45,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1931274538, now seen corresponding path program 1 times [2025-02-06 08:27:45,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:45,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272191775] [2025-02-06 08:27:45,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:45,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:45,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-02-06 08:27:46,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-02-06 08:27:46,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:46,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat