./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--usb--host--u132-hcd.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 59b1cfb91cc72e499bff6d8fc699fc231e5a5cccbbf2aefe05d1bfd2696fc05b --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 17:09:20,717 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 17:09:20,718 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 17:09:20,743 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 17:09:20,743 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 17:09:20,744 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 17:09:20,745 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 17:09:20,753 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 17:09:20,754 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 17:09:20,758 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 17:09:20,759 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 17:09:20,761 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 17:09:20,761 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 17:09:20,763 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 17:09:20,765 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 17:09:20,768 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 17:09:20,768 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 17:09:20,769 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 17:09:20,770 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 17:09:20,771 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 17:09:20,774 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 17:09:20,776 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 17:09:20,776 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 17:09:20,777 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 17:09:20,778 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 17:09:20,782 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 17:09:20,782 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 17:09:20,782 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 17:09:20,783 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 17:09:20,784 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 17:09:20,784 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 17:09:20,785 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 17:09:20,786 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 17:09:20,786 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 17:09:20,787 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 17:09:20,787 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 17:09:20,788 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 17:09:20,788 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 17:09:20,788 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 17:09:20,788 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 17:09:20,789 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 17:09:20,790 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 17:09:20,791 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 17:09:20,816 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 17:09:20,816 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 17:09:20,817 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 17:09:20,817 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 17:09:20,817 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 17:09:20,817 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 17:09:20,818 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 17:09:20,818 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 17:09:20,818 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 17:09:20,818 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 17:09:20,818 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 17:09:20,818 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 17:09:20,818 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 17:09:20,818 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 17:09:20,818 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 17:09:20,818 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 17:09:20,819 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 17:09:20,819 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 17:09:20,819 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 17:09:20,819 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 17:09:20,819 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 17:09:20,819 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 17:09:20,819 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 17:09:20,819 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 17:09:20,819 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 17:09:20,819 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 17:09:20,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 17:09:20,820 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 17:09:20,820 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 17:09:20,820 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 17:09:20,825 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 59b1cfb91cc72e499bff6d8fc699fc231e5a5cccbbf2aefe05d1bfd2696fc05b [2022-07-12 17:09:20,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 17:09:21,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 17:09:21,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 17:09:21,007 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 17:09:21,007 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 17:09:21,008 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i [2022-07-12 17:09:21,056 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffbee655f/b8a2958cba6e49aa9d384e00d1611c2d/FLAG7844dd6b0 [2022-07-12 17:09:21,652 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 17:09:21,653 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i [2022-07-12 17:09:21,698 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffbee655f/b8a2958cba6e49aa9d384e00d1611c2d/FLAG7844dd6b0 [2022-07-12 17:09:21,854 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffbee655f/b8a2958cba6e49aa9d384e00d1611c2d [2022-07-12 17:09:21,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 17:09:21,856 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 17:09:21,857 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 17:09:21,857 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 17:09:21,860 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 17:09:21,861 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 05:09:21" (1/1) ... [2022-07-12 17:09:21,862 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34eee55a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:09:21, skipping insertion in model container [2022-07-12 17:09:21,862 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 05:09:21" (1/1) ... [2022-07-12 17:09:21,867 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 17:09:21,979 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 17:09:24,372 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[434581,434594] [2022-07-12 17:09:24,374 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[434726,434739] [2022-07-12 17:09:24,374 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[434872,434885] [2022-07-12 17:09:24,375 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435037,435050] [2022-07-12 17:09:24,375 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435195,435208] [2022-07-12 17:09:24,376 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435353,435366] [2022-07-12 17:09:24,376 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435511,435524] [2022-07-12 17:09:24,377 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435671,435684] [2022-07-12 17:09:24,377 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435830,435843] [2022-07-12 17:09:24,378 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435969,435982] [2022-07-12 17:09:24,378 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436111,436124] [2022-07-12 17:09:24,382 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436260,436273] [2022-07-12 17:09:24,382 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436399,436412] [2022-07-12 17:09:24,382 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436554,436567] [2022-07-12 17:09:24,383 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436714,436727] [2022-07-12 17:09:24,383 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436865,436878] [2022-07-12 17:09:24,384 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437016,437029] [2022-07-12 17:09:24,385 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437168,437181] [2022-07-12 17:09:24,386 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437317,437330] [2022-07-12 17:09:24,387 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437465,437478] [2022-07-12 17:09:24,387 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437622,437635] [2022-07-12 17:09:24,387 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437771,437784] [2022-07-12 17:09:24,388 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437927,437940] [2022-07-12 17:09:24,388 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438080,438093] [2022-07-12 17:09:24,390 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438226,438239] [2022-07-12 17:09:24,390 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438369,438382] [2022-07-12 17:09:24,390 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438521,438534] [2022-07-12 17:09:24,391 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438667,438680] [2022-07-12 17:09:24,391 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438812,438825] [2022-07-12 17:09:24,392 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438966,438979] [2022-07-12 17:09:24,392 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439117,439130] [2022-07-12 17:09:24,393 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439272,439285] [2022-07-12 17:09:24,393 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439424,439437] [2022-07-12 17:09:24,394 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439579,439592] [2022-07-12 17:09:24,394 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439743,439756] [2022-07-12 17:09:24,395 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439899,439912] [2022-07-12 17:09:24,395 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440063,440076] [2022-07-12 17:09:24,395 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440205,440218] [2022-07-12 17:09:24,396 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440363,440376] [2022-07-12 17:09:24,396 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440530,440543] [2022-07-12 17:09:24,397 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440689,440702] [2022-07-12 17:09:24,397 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440848,440861] [2022-07-12 17:09:24,400 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440997,441010] [2022-07-12 17:09:24,401 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441144,441157] [2022-07-12 17:09:24,401 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441283,441296] [2022-07-12 17:09:24,402 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441446,441459] [2022-07-12 17:09:24,402 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441612,441625] [2022-07-12 17:09:24,403 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441776,441789] [2022-07-12 17:09:24,403 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441941,441954] [2022-07-12 17:09:24,403 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442106,442119] [2022-07-12 17:09:24,404 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442272,442285] [2022-07-12 17:09:24,404 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442437,442450] [2022-07-12 17:09:24,404 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442604,442617] [2022-07-12 17:09:24,405 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442764,442777] [2022-07-12 17:09:24,405 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442926,442939] [2022-07-12 17:09:24,405 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443085,443098] [2022-07-12 17:09:24,405 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443231,443244] [2022-07-12 17:09:24,406 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443374,443387] [2022-07-12 17:09:24,406 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443518,443531] [2022-07-12 17:09:24,406 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443661,443674] [2022-07-12 17:09:24,406 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443805,443818] [2022-07-12 17:09:24,407 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443946,443959] [2022-07-12 17:09:24,407 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444084,444097] [2022-07-12 17:09:24,408 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444242,444255] [2022-07-12 17:09:24,408 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444401,444414] [2022-07-12 17:09:24,408 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444557,444570] [2022-07-12 17:09:24,409 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444706,444719] [2022-07-12 17:09:24,409 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444858,444871] [2022-07-12 17:09:24,410 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445009,445022] [2022-07-12 17:09:24,410 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445158,445171] [2022-07-12 17:09:24,410 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445310,445323] [2022-07-12 17:09:24,411 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445458,445471] [2022-07-12 17:09:24,411 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445611,445624] [2022-07-12 17:09:24,411 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445762,445775] [2022-07-12 17:09:24,411 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445912,445925] [2022-07-12 17:09:24,412 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446059,446072] [2022-07-12 17:09:24,412 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446210,446223] [2022-07-12 17:09:24,412 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446361,446374] [2022-07-12 17:09:24,412 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446509,446522] [2022-07-12 17:09:24,413 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446675,446688] [2022-07-12 17:09:24,413 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446844,446857] [2022-07-12 17:09:24,413 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447011,447024] [2022-07-12 17:09:24,413 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447179,447192] [2022-07-12 17:09:24,414 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447329,447342] [2022-07-12 17:09:24,414 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447476,447489] [2022-07-12 17:09:24,414 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447637,447650] [2022-07-12 17:09:24,415 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447807,447820] [2022-07-12 17:09:24,415 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447969,447982] [2022-07-12 17:09:24,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 17:09:24,447 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 17:09:24,611 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: de.uni_freiburg.informatik.ultimate.boogie.typechecker.TypeCheckException: Type check failed for C: roothub_a___0 = roothub_a___0 & 4294964991U [7338] at de.uni_freiburg.informatik.ultimate.boogie.TypeErrorReporter.report(TypeErrorReporter.java:52) at de.uni_freiburg.informatik.ultimate.boogie.typechecker.TypeCheckHelper.typeCheckBinaryExpression(TypeCheckHelper.java:207) at de.uni_freiburg.informatik.ultimate.boogie.ExpressionFactory.constructBinaryExpression(ExpressionFactory.java:597) at de.uni_freiburg.informatik.ultimate.boogie.ExpressionFactory.newBinaryExpression(ExpressionFactory.java:132) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.BitabsTranslation.abstractAssign(BitabsTranslation.java:483) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.abstractAssginWithBitwiseOp(IntegerTranslation.java:973) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:737) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainDispatcher.dispatch(MainDispatcher.java:372) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1397) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainDispatcher.dispatch(MainDispatcher.java:326) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1081) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainDispatcher.dispatch(MainDispatcher.java:334) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1081) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainDispatcher.dispatch(MainDispatcher.java:334) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:371) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1470) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainDispatcher.dispatch(MainDispatcher.java:289) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3276) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2361) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:601) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainDispatcher.dispatch(MainDispatcher.java:270) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.performMainRun(MainTranslator.java:244) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:206) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:115) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-12 17:09:24,621 INFO L158 Benchmark]: Toolchain (without parser) took 2760.92ms. Allocated memory was 117.4MB in the beginning and 209.7MB in the end (delta: 92.3MB). Free memory was 71.6MB in the beginning and 92.3MB in the end (delta: -20.7MB). Peak memory consumption was 72.2MB. Max. memory is 16.1GB. [2022-07-12 17:09:24,621 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 117.4MB. Free memory is still 73.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 17:09:24,622 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2759.73ms. Allocated memory was 117.4MB in the beginning and 209.7MB in the end (delta: 92.3MB). Free memory was 71.4MB in the beginning and 92.3MB in the end (delta: -21.0MB). Peak memory consumption was 72.2MB. Max. memory is 16.1GB. [2022-07-12 17:09:24,623 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 117.4MB. Free memory is still 73.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2759.73ms. Allocated memory was 117.4MB in the beginning and 209.7MB in the end (delta: 92.3MB). Free memory was 71.4MB in the beginning and 92.3MB in the end (delta: -21.0MB). Peak memory consumption was 72.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: TypeCheckException: Type check failed for C: roothub_a___0 = roothub_a___0 & 4294964991U [7338] de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: TypeCheckException: Type check failed for C: roothub_a___0 = roothub_a___0 & 4294964991U [7338]: de.uni_freiburg.informatik.ultimate.boogie.TypeErrorReporter.report(TypeErrorReporter.java:52) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 59b1cfb91cc72e499bff6d8fc699fc231e5a5cccbbf2aefe05d1bfd2696fc05b --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 17:09:26,046 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 17:09:26,048 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 17:09:26,070 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 17:09:26,072 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 17:09:26,073 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 17:09:26,078 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 17:09:26,080 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 17:09:26,082 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 17:09:26,085 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 17:09:26,085 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 17:09:26,087 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 17:09:26,087 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 17:09:26,088 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 17:09:26,090 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 17:09:26,093 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 17:09:26,093 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 17:09:26,094 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 17:09:26,095 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 17:09:26,098 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 17:09:26,103 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 17:09:26,104 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 17:09:26,105 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 17:09:26,106 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 17:09:26,106 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 17:09:26,109 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 17:09:26,111 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 17:09:26,112 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 17:09:26,112 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 17:09:26,112 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 17:09:26,113 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 17:09:26,113 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 17:09:26,114 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 17:09:26,115 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 17:09:26,115 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 17:09:26,116 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 17:09:26,116 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 17:09:26,117 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 17:09:26,117 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 17:09:26,117 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 17:09:26,118 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 17:09:26,118 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 17:09:26,121 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-07-12 17:09:26,138 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 17:09:26,138 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 17:09:26,138 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 17:09:26,139 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 17:09:26,139 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 17:09:26,139 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 17:09:26,140 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 17:09:26,140 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 17:09:26,140 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 17:09:26,141 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 17:09:26,141 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 17:09:26,141 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 17:09:26,141 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 17:09:26,141 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 17:09:26,147 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 17:09:26,147 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 17:09:26,147 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 17:09:26,147 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 17:09:26,148 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 17:09:26,148 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 17:09:26,148 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 17:09:26,148 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 17:09:26,148 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 17:09:26,149 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 17:09:26,149 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 17:09:26,149 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 17:09:26,149 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 17:09:26,149 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 17:09:26,149 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 17:09:26,149 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 17:09:26,150 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 17:09:26,150 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 17:09:26,150 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 17:09:26,150 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 59b1cfb91cc72e499bff6d8fc699fc231e5a5cccbbf2aefe05d1bfd2696fc05b [2022-07-12 17:09:26,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 17:09:26,426 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 17:09:26,427 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 17:09:26,428 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 17:09:26,428 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 17:09:26,429 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i [2022-07-12 17:09:26,470 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ee19468d/123ed1ed34fa4b7f9076307dbc8d87b2/FLAG29cdbd3c1 [2022-07-12 17:09:27,115 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 17:09:27,116 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i [2022-07-12 17:09:27,165 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ee19468d/123ed1ed34fa4b7f9076307dbc8d87b2/FLAG29cdbd3c1 [2022-07-12 17:09:27,220 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ee19468d/123ed1ed34fa4b7f9076307dbc8d87b2 [2022-07-12 17:09:27,222 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 17:09:27,223 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 17:09:27,225 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 17:09:27,225 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 17:09:27,227 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 17:09:27,227 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 05:09:27" (1/1) ... [2022-07-12 17:09:27,228 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@92c839f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:09:27, skipping insertion in model container [2022-07-12 17:09:27,228 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 05:09:27" (1/1) ... [2022-07-12 17:09:27,233 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 17:09:27,370 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 17:09:29,771 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[434581,434594] [2022-07-12 17:09:29,773 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[434726,434739] [2022-07-12 17:09:29,773 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[434872,434885] [2022-07-12 17:09:29,773 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435037,435050] [2022-07-12 17:09:29,774 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435195,435208] [2022-07-12 17:09:29,774 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435353,435366] [2022-07-12 17:09:29,774 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435511,435524] [2022-07-12 17:09:29,775 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435671,435684] [2022-07-12 17:09:29,775 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435830,435843] [2022-07-12 17:09:29,775 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435969,435982] [2022-07-12 17:09:29,775 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436111,436124] [2022-07-12 17:09:29,776 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436260,436273] [2022-07-12 17:09:29,776 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436399,436412] [2022-07-12 17:09:29,776 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436554,436567] [2022-07-12 17:09:29,777 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436714,436727] [2022-07-12 17:09:29,777 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436865,436878] [2022-07-12 17:09:29,777 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437016,437029] [2022-07-12 17:09:29,778 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437168,437181] [2022-07-12 17:09:29,778 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437317,437330] [2022-07-12 17:09:29,778 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437465,437478] [2022-07-12 17:09:29,779 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437622,437635] [2022-07-12 17:09:29,779 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437771,437784] [2022-07-12 17:09:29,779 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437927,437940] [2022-07-12 17:09:29,779 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438080,438093] [2022-07-12 17:09:29,780 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438226,438239] [2022-07-12 17:09:29,780 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438369,438382] [2022-07-12 17:09:29,780 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438521,438534] [2022-07-12 17:09:29,781 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438667,438680] [2022-07-12 17:09:29,781 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438812,438825] [2022-07-12 17:09:29,781 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438966,438979] [2022-07-12 17:09:29,781 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439117,439130] [2022-07-12 17:09:29,782 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439272,439285] [2022-07-12 17:09:29,782 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439424,439437] [2022-07-12 17:09:29,782 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439579,439592] [2022-07-12 17:09:29,783 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439743,439756] [2022-07-12 17:09:29,783 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439899,439912] [2022-07-12 17:09:29,783 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440063,440076] [2022-07-12 17:09:29,783 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440205,440218] [2022-07-12 17:09:29,784 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440363,440376] [2022-07-12 17:09:29,784 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440530,440543] [2022-07-12 17:09:29,784 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440689,440702] [2022-07-12 17:09:29,785 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440848,440861] [2022-07-12 17:09:29,786 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440997,441010] [2022-07-12 17:09:29,786 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441144,441157] [2022-07-12 17:09:29,786 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441283,441296] [2022-07-12 17:09:29,787 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441446,441459] [2022-07-12 17:09:29,787 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441612,441625] [2022-07-12 17:09:29,788 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441776,441789] [2022-07-12 17:09:29,788 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441941,441954] [2022-07-12 17:09:29,789 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442106,442119] [2022-07-12 17:09:29,789 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442272,442285] [2022-07-12 17:09:29,789 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442437,442450] [2022-07-12 17:09:29,789 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442604,442617] [2022-07-12 17:09:29,790 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442764,442777] [2022-07-12 17:09:29,790 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442926,442939] [2022-07-12 17:09:29,790 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443085,443098] [2022-07-12 17:09:29,791 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443231,443244] [2022-07-12 17:09:29,791 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443374,443387] [2022-07-12 17:09:29,791 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443518,443531] [2022-07-12 17:09:29,791 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443661,443674] [2022-07-12 17:09:29,792 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443805,443818] [2022-07-12 17:09:29,792 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443946,443959] [2022-07-12 17:09:29,792 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444084,444097] [2022-07-12 17:09:29,793 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444242,444255] [2022-07-12 17:09:29,793 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444401,444414] [2022-07-12 17:09:29,793 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444557,444570] [2022-07-12 17:09:29,794 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444706,444719] [2022-07-12 17:09:29,794 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444858,444871] [2022-07-12 17:09:29,795 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445009,445022] [2022-07-12 17:09:29,795 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445158,445171] [2022-07-12 17:09:29,795 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445310,445323] [2022-07-12 17:09:29,796 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445458,445471] [2022-07-12 17:09:29,796 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445611,445624] [2022-07-12 17:09:29,796 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445762,445775] [2022-07-12 17:09:29,797 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445912,445925] [2022-07-12 17:09:29,797 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446059,446072] [2022-07-12 17:09:29,797 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446210,446223] [2022-07-12 17:09:29,798 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446361,446374] [2022-07-12 17:09:29,798 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446509,446522] [2022-07-12 17:09:29,798 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446675,446688] [2022-07-12 17:09:29,798 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446844,446857] [2022-07-12 17:09:29,799 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447011,447024] [2022-07-12 17:09:29,800 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447179,447192] [2022-07-12 17:09:29,800 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447329,447342] [2022-07-12 17:09:29,800 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447476,447489] [2022-07-12 17:09:29,801 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447637,447650] [2022-07-12 17:09:29,801 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447807,447820] [2022-07-12 17:09:29,801 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447969,447982] [2022-07-12 17:09:29,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 17:09:29,853 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-12 17:09:29,897 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 17:09:30,129 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[434581,434594] [2022-07-12 17:09:30,129 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[434726,434739] [2022-07-12 17:09:30,130 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[434872,434885] [2022-07-12 17:09:30,130 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435037,435050] [2022-07-12 17:09:30,130 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435195,435208] [2022-07-12 17:09:30,130 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435353,435366] [2022-07-12 17:09:30,131 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435511,435524] [2022-07-12 17:09:30,131 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435671,435684] [2022-07-12 17:09:30,131 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435830,435843] [2022-07-12 17:09:30,131 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435969,435982] [2022-07-12 17:09:30,132 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436111,436124] [2022-07-12 17:09:30,132 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436260,436273] [2022-07-12 17:09:30,132 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436399,436412] [2022-07-12 17:09:30,132 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436554,436567] [2022-07-12 17:09:30,133 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436714,436727] [2022-07-12 17:09:30,133 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436865,436878] [2022-07-12 17:09:30,133 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437016,437029] [2022-07-12 17:09:30,133 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437168,437181] [2022-07-12 17:09:30,134 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437317,437330] [2022-07-12 17:09:30,134 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437465,437478] [2022-07-12 17:09:30,134 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437622,437635] [2022-07-12 17:09:30,134 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437771,437784] [2022-07-12 17:09:30,135 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437927,437940] [2022-07-12 17:09:30,135 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438080,438093] [2022-07-12 17:09:30,135 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438226,438239] [2022-07-12 17:09:30,135 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438369,438382] [2022-07-12 17:09:30,136 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438521,438534] [2022-07-12 17:09:30,136 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438667,438680] [2022-07-12 17:09:30,136 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438812,438825] [2022-07-12 17:09:30,136 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438966,438979] [2022-07-12 17:09:30,137 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439117,439130] [2022-07-12 17:09:30,137 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439272,439285] [2022-07-12 17:09:30,137 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439424,439437] [2022-07-12 17:09:30,137 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439579,439592] [2022-07-12 17:09:30,138 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439743,439756] [2022-07-12 17:09:30,138 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439899,439912] [2022-07-12 17:09:30,138 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440063,440076] [2022-07-12 17:09:30,138 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440205,440218] [2022-07-12 17:09:30,139 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440363,440376] [2022-07-12 17:09:30,139 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440530,440543] [2022-07-12 17:09:30,139 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440689,440702] [2022-07-12 17:09:30,139 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440848,440861] [2022-07-12 17:09:30,140 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440997,441010] [2022-07-12 17:09:30,140 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441144,441157] [2022-07-12 17:09:30,140 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441283,441296] [2022-07-12 17:09:30,141 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441446,441459] [2022-07-12 17:09:30,141 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441612,441625] [2022-07-12 17:09:30,141 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441776,441789] [2022-07-12 17:09:30,141 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441941,441954] [2022-07-12 17:09:30,142 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442106,442119] [2022-07-12 17:09:30,142 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442272,442285] [2022-07-12 17:09:30,142 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442437,442450] [2022-07-12 17:09:30,142 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442604,442617] [2022-07-12 17:09:30,143 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442764,442777] [2022-07-12 17:09:30,143 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442926,442939] [2022-07-12 17:09:30,143 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443085,443098] [2022-07-12 17:09:30,143 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443231,443244] [2022-07-12 17:09:30,144 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443374,443387] [2022-07-12 17:09:30,144 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443518,443531] [2022-07-12 17:09:30,144 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443661,443674] [2022-07-12 17:09:30,144 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443805,443818] [2022-07-12 17:09:30,145 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443946,443959] [2022-07-12 17:09:30,145 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444084,444097] [2022-07-12 17:09:30,145 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444242,444255] [2022-07-12 17:09:30,145 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444401,444414] [2022-07-12 17:09:30,146 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444557,444570] [2022-07-12 17:09:30,146 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444706,444719] [2022-07-12 17:09:30,146 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444858,444871] [2022-07-12 17:09:30,146 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445009,445022] [2022-07-12 17:09:30,147 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445158,445171] [2022-07-12 17:09:30,147 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445310,445323] [2022-07-12 17:09:30,147 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445458,445471] [2022-07-12 17:09:30,147 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445611,445624] [2022-07-12 17:09:30,148 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445762,445775] [2022-07-12 17:09:30,148 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445912,445925] [2022-07-12 17:09:30,148 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446059,446072] [2022-07-12 17:09:30,148 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446210,446223] [2022-07-12 17:09:30,149 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446361,446374] [2022-07-12 17:09:30,149 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446509,446522] [2022-07-12 17:09:30,149 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446675,446688] [2022-07-12 17:09:30,149 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446844,446857] [2022-07-12 17:09:30,149 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447011,447024] [2022-07-12 17:09:30,150 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447179,447192] [2022-07-12 17:09:30,150 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447329,447342] [2022-07-12 17:09:30,150 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447476,447489] [2022-07-12 17:09:30,150 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447637,447650] [2022-07-12 17:09:30,151 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447807,447820] [2022-07-12 17:09:30,151 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447969,447982] [2022-07-12 17:09:30,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 17:09:30,170 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 17:09:30,523 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[434581,434594] [2022-07-12 17:09:30,524 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[434726,434739] [2022-07-12 17:09:30,525 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[434872,434885] [2022-07-12 17:09:30,525 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435037,435050] [2022-07-12 17:09:30,526 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435195,435208] [2022-07-12 17:09:30,526 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435353,435366] [2022-07-12 17:09:30,526 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435511,435524] [2022-07-12 17:09:30,526 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435671,435684] [2022-07-12 17:09:30,526 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435830,435843] [2022-07-12 17:09:30,527 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435969,435982] [2022-07-12 17:09:30,527 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436111,436124] [2022-07-12 17:09:30,528 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436260,436273] [2022-07-12 17:09:30,528 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436399,436412] [2022-07-12 17:09:30,528 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436554,436567] [2022-07-12 17:09:30,528 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436714,436727] [2022-07-12 17:09:30,529 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436865,436878] [2022-07-12 17:09:30,529 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437016,437029] [2022-07-12 17:09:30,529 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437168,437181] [2022-07-12 17:09:30,529 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437317,437330] [2022-07-12 17:09:30,530 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437465,437478] [2022-07-12 17:09:30,530 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437622,437635] [2022-07-12 17:09:30,530 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437771,437784] [2022-07-12 17:09:30,530 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437927,437940] [2022-07-12 17:09:30,531 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438080,438093] [2022-07-12 17:09:30,531 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438226,438239] [2022-07-12 17:09:30,531 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438369,438382] [2022-07-12 17:09:30,532 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438521,438534] [2022-07-12 17:09:30,533 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438667,438680] [2022-07-12 17:09:30,533 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438812,438825] [2022-07-12 17:09:30,533 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438966,438979] [2022-07-12 17:09:30,533 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439117,439130] [2022-07-12 17:09:30,533 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439272,439285] [2022-07-12 17:09:30,534 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439424,439437] [2022-07-12 17:09:30,534 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439579,439592] [2022-07-12 17:09:30,534 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439743,439756] [2022-07-12 17:09:30,534 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439899,439912] [2022-07-12 17:09:30,535 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440063,440076] [2022-07-12 17:09:30,535 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440205,440218] [2022-07-12 17:09:30,535 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440363,440376] [2022-07-12 17:09:30,536 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440530,440543] [2022-07-12 17:09:30,536 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440689,440702] [2022-07-12 17:09:30,536 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440848,440861] [2022-07-12 17:09:30,537 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440997,441010] [2022-07-12 17:09:30,537 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441144,441157] [2022-07-12 17:09:30,538 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441283,441296] [2022-07-12 17:09:30,538 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441446,441459] [2022-07-12 17:09:30,538 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441612,441625] [2022-07-12 17:09:30,538 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441776,441789] [2022-07-12 17:09:30,538 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441941,441954] [2022-07-12 17:09:30,539 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442106,442119] [2022-07-12 17:09:30,539 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442272,442285] [2022-07-12 17:09:30,539 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442437,442450] [2022-07-12 17:09:30,539 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442604,442617] [2022-07-12 17:09:30,540 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442764,442777] [2022-07-12 17:09:30,540 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442926,442939] [2022-07-12 17:09:30,540 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443085,443098] [2022-07-12 17:09:30,540 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443231,443244] [2022-07-12 17:09:30,541 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443374,443387] [2022-07-12 17:09:30,541 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443518,443531] [2022-07-12 17:09:30,541 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443661,443674] [2022-07-12 17:09:30,541 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443805,443818] [2022-07-12 17:09:30,541 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443946,443959] [2022-07-12 17:09:30,542 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444084,444097] [2022-07-12 17:09:30,542 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444242,444255] [2022-07-12 17:09:30,542 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444401,444414] [2022-07-12 17:09:30,542 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444557,444570] [2022-07-12 17:09:30,543 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444706,444719] [2022-07-12 17:09:30,543 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444858,444871] [2022-07-12 17:09:30,543 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445009,445022] [2022-07-12 17:09:30,543 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445158,445171] [2022-07-12 17:09:30,543 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445310,445323] [2022-07-12 17:09:30,544 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445458,445471] [2022-07-12 17:09:30,544 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445611,445624] [2022-07-12 17:09:30,544 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445762,445775] [2022-07-12 17:09:30,544 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445912,445925] [2022-07-12 17:09:30,545 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446059,446072] [2022-07-12 17:09:30,545 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446210,446223] [2022-07-12 17:09:30,545 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446361,446374] [2022-07-12 17:09:30,545 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446509,446522] [2022-07-12 17:09:30,548 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446675,446688] [2022-07-12 17:09:30,552 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446844,446857] [2022-07-12 17:09:30,553 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447011,447024] [2022-07-12 17:09:30,553 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447179,447192] [2022-07-12 17:09:30,553 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447329,447342] [2022-07-12 17:09:30,554 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447476,447489] [2022-07-12 17:09:30,554 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447637,447650] [2022-07-12 17:09:30,554 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447807,447820] [2022-07-12 17:09:30,554 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447969,447982] [2022-07-12 17:09:30,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 17:09:30,723 INFO L208 MainTranslator]: Completed translation [2022-07-12 17:09:30,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:09:30 WrapperNode [2022-07-12 17:09:30,724 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 17:09:30,725 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 17:09:30,725 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 17:09:30,725 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 17:09:30,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:09:30" (1/1) ... [2022-07-12 17:09:30,794 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:09:30" (1/1) ... [2022-07-12 17:09:30,941 INFO L137 Inliner]: procedures = 757, calls = 3425, calls flagged for inlining = 401, calls inlined = 237, statements flattened = 6639 [2022-07-12 17:09:30,941 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 17:09:30,942 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 17:09:30,942 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 17:09:30,943 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 17:09:30,949 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:09:30" (1/1) ... [2022-07-12 17:09:30,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:09:30" (1/1) ... [2022-07-12 17:09:30,990 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:09:30" (1/1) ... [2022-07-12 17:09:30,991 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:09:30" (1/1) ... [2022-07-12 17:09:31,130 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:09:30" (1/1) ... [2022-07-12 17:09:31,150 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:09:30" (1/1) ... [2022-07-12 17:09:31,174 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:09:30" (1/1) ... [2022-07-12 17:09:31,200 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 17:09:31,202 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 17:09:31,202 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 17:09:31,202 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 17:09:31,202 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:09:30" (1/1) ... [2022-07-12 17:09:31,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 17:09:31,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:09:31,225 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 17:09:31,254 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-12 17:09:31,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-12 17:09:31,254 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 17:09:31,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 17:09:31,255 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-12 17:09:31,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-12 17:09:31,255 INFO L130 BoogieDeclarations]: Found specification of procedure cancel_delayed_work [2022-07-12 17:09:31,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 17:09:31,255 INFO L138 BoogieDeclarations]: Found implementation of procedure cancel_delayed_work [2022-07-12 17:09:31,263 INFO L130 BoogieDeclarations]: Found specification of procedure u132_disable [2022-07-12 17:09:31,263 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_disable [2022-07-12 17:09:31,263 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-12 17:09:31,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-12 17:09:31,264 INFO L130 BoogieDeclarations]: Found specification of procedure u132_remove [2022-07-12 17:09:31,264 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_remove [2022-07-12 17:09:31,264 INFO L130 BoogieDeclarations]: Found specification of procedure u132_udev_init_kref [2022-07-12 17:09:31,264 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_udev_init_kref [2022-07-12 17:09:31,264 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-12 17:09:31,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-12 17:09:31,264 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-12 17:09:31,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-12 17:09:31,264 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-12 17:09:31,265 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-12 17:09:31,265 INFO L130 BoogieDeclarations]: Found specification of procedure u132_udev_put_kref [2022-07-12 17:09:31,265 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_udev_put_kref [2022-07-12 17:09:31,265 INFO L130 BoogieDeclarations]: Found specification of procedure usb_ftdi_elan_read_pcimem [2022-07-12 17:09:31,265 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_ftdi_elan_read_pcimem [2022-07-12 17:09:31,265 INFO L130 BoogieDeclarations]: Found specification of procedure u132_ring_requeue_work [2022-07-12 17:09:31,266 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_ring_requeue_work [2022-07-12 17:09:31,266 INFO L130 BoogieDeclarations]: Found specification of procedure u132_bus_suspend [2022-07-12 17:09:31,266 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_bus_suspend [2022-07-12 17:09:31,266 INFO L130 BoogieDeclarations]: Found specification of procedure u132_get_frame [2022-07-12 17:09:31,266 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_get_frame [2022-07-12 17:09:31,266 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-12 17:09:31,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-12 17:09:31,266 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-12 17:09:31,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-12 17:09:31,267 INFO L130 BoogieDeclarations]: Found specification of procedure edset_output [2022-07-12 17:09:31,267 INFO L138 BoogieDeclarations]: Found implementation of procedure edset_output [2022-07-12 17:09:31,267 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-12 17:09:31,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-12 17:09:31,267 INFO L130 BoogieDeclarations]: Found specification of procedure read_roothub_info [2022-07-12 17:09:31,267 INFO L138 BoogieDeclarations]: Found implementation of procedure read_roothub_info [2022-07-12 17:09:31,267 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_scheduler_lock_of_u132 [2022-07-12 17:09:31,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_scheduler_lock_of_u132 [2022-07-12 17:09:31,267 INFO L130 BoogieDeclarations]: Found specification of procedure edset_single [2022-07-12 17:09:31,268 INFO L138 BoogieDeclarations]: Found implementation of procedure edset_single [2022-07-12 17:09:31,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 17:09:31,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 17:09:31,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-07-12 17:09:31,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2022-07-12 17:09:31,268 INFO L130 BoogieDeclarations]: Found specification of procedure edset_setup [2022-07-12 17:09:31,268 INFO L138 BoogieDeclarations]: Found implementation of procedure edset_setup [2022-07-12 17:09:31,268 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2022-07-12 17:09:31,268 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2022-07-12 17:09:31,268 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-12 17:09:31,269 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-12 17:09:31,269 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-12 17:09:31,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-12 17:09:31,269 INFO L130 BoogieDeclarations]: Found specification of procedure u132_resume [2022-07-12 17:09:31,269 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_resume [2022-07-12 17:09:31,269 INFO L130 BoogieDeclarations]: Found specification of procedure ftdi_elan_gone_away [2022-07-12 17:09:31,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ftdi_elan_gone_away [2022-07-12 17:09:31,269 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-12 17:09:31,269 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-12 17:09:31,270 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-12 17:09:31,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-12 17:09:31,270 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-12 17:09:31,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-12 17:09:31,270 INFO L130 BoogieDeclarations]: Found specification of procedure u132_endp_cancel_work [2022-07-12 17:09:31,270 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_endp_cancel_work [2022-07-12 17:09:31,270 INFO L130 BoogieDeclarations]: Found specification of procedure kref_get [2022-07-12 17:09:31,270 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_get [2022-07-12 17:09:31,270 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-12 17:09:31,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-12 17:09:31,271 INFO L130 BoogieDeclarations]: Found specification of procedure usb_hcd_unlink_urb_from_ep [2022-07-12 17:09:31,271 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_hcd_unlink_urb_from_ep [2022-07-12 17:09:31,271 INFO L130 BoogieDeclarations]: Found specification of procedure u132_hcd_ring_work_scheduler [2022-07-12 17:09:31,271 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_hcd_ring_work_scheduler [2022-07-12 17:09:31,271 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-12 17:09:31,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-12 17:09:31,271 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2022-07-12 17:09:31,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2022-07-12 17:09:31,271 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-12 17:09:31,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-12 17:09:31,272 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-12 17:09:31,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-12 17:09:31,272 INFO L130 BoogieDeclarations]: Found specification of procedure u132_u132_put_kref [2022-07-12 17:09:31,272 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_u132_put_kref [2022-07-12 17:09:31,272 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2022-07-12 17:09:31,272 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2022-07-12 17:09:31,272 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-12 17:09:31,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-12 17:09:31,273 INFO L130 BoogieDeclarations]: Found specification of procedure u132_hcd_endp_work_scheduler [2022-07-12 17:09:31,273 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_hcd_endp_work_scheduler [2022-07-12 17:09:31,273 INFO L130 BoogieDeclarations]: Found specification of procedure kref_put [2022-07-12 17:09:31,273 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_put [2022-07-12 17:09:31,273 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-12 17:09:31,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-12 17:09:31,273 INFO L130 BoogieDeclarations]: Found specification of procedure u132_hcd_monitor_work [2022-07-12 17:09:31,273 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_hcd_monitor_work [2022-07-12 17:09:31,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 17:09:31,274 INFO L130 BoogieDeclarations]: Found specification of procedure u132_monitor_requeue_work [2022-07-12 17:09:31,274 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_monitor_requeue_work [2022-07-12 17:09:31,274 INFO L130 BoogieDeclarations]: Found specification of procedure u132_hcd_stop [2022-07-12 17:09:31,274 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_hcd_stop [2022-07-12 17:09:31,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 17:09:31,275 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-12 17:09:31,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-12 17:09:31,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 17:09:31,276 INFO L130 BoogieDeclarations]: Found specification of procedure u132_hcd_giveback_urb [2022-07-12 17:09:31,276 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_hcd_giveback_urb [2022-07-12 17:09:31,276 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 17:09:31,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 17:09:31,277 INFO L130 BoogieDeclarations]: Found specification of procedure usb_ftdi_elan_write_pcimem [2022-07-12 17:09:31,277 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_ftdi_elan_write_pcimem [2022-07-12 17:09:31,277 INFO L130 BoogieDeclarations]: Found specification of procedure u132_endp_queue_work [2022-07-12 17:09:31,277 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_endp_queue_work [2022-07-12 17:09:31,278 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_u132_module_lock [2022-07-12 17:09:31,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_u132_module_lock [2022-07-12 17:09:31,278 INFO L130 BoogieDeclarations]: Found specification of procedure u132_ring_queue_work [2022-07-12 17:09:31,278 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_ring_queue_work [2022-07-12 17:09:31,278 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2022-07-12 17:09:31,278 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2022-07-12 17:09:31,279 INFO L130 BoogieDeclarations]: Found specification of procedure __init_work [2022-07-12 17:09:31,279 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_work [2022-07-12 17:09:31,279 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-12 17:09:31,279 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-12 17:09:31,279 INFO L130 BoogieDeclarations]: Found specification of procedure u132_hcd_start [2022-07-12 17:09:31,279 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_hcd_start [2022-07-12 17:09:31,279 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-12 17:09:31,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-12 17:09:31,279 INFO L130 BoogieDeclarations]: Found specification of procedure usb_ftdi_elan_edset_input [2022-07-12 17:09:31,279 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_ftdi_elan_edset_input [2022-07-12 17:09:31,280 INFO L130 BoogieDeclarations]: Found specification of procedure u132_to_hcd [2022-07-12 17:09:31,280 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_to_hcd [2022-07-12 17:09:31,280 INFO L130 BoogieDeclarations]: Found specification of procedure u132_probe [2022-07-12 17:09:31,280 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_probe [2022-07-12 17:09:31,280 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_sw_lock_of_u132 [2022-07-12 17:09:31,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_sw_lock_of_u132 [2022-07-12 17:09:31,280 INFO L130 BoogieDeclarations]: Found specification of procedure queue_delayed_work [2022-07-12 17:09:31,280 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_delayed_work [2022-07-12 17:09:31,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 17:09:31,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 17:09:31,281 INFO L130 BoogieDeclarations]: Found specification of procedure u132_endp_init_kref [2022-07-12 17:09:31,281 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_endp_init_kref [2022-07-12 17:09:31,281 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_sw_lock_of_u132 [2022-07-12 17:09:31,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_sw_lock_of_u132 [2022-07-12 17:09:31,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-12 17:09:31,281 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2022-07-12 17:09:31,281 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2022-07-12 17:09:31,281 INFO L130 BoogieDeclarations]: Found specification of procedure kref_sub [2022-07-12 17:09:31,281 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_sub [2022-07-12 17:09:31,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-07-12 17:09:31,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-12 17:09:31,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2022-07-12 17:09:31,282 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 17:09:31,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 17:09:31,282 INFO L130 BoogieDeclarations]: Found specification of procedure u132_udev_get_kref [2022-07-12 17:09:31,282 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_udev_get_kref [2022-07-12 17:09:31,282 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-12 17:09:31,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-12 17:09:31,282 INFO L130 BoogieDeclarations]: Found specification of procedure hcd_to_u132 [2022-07-12 17:09:31,283 INFO L138 BoogieDeclarations]: Found implementation of procedure hcd_to_u132 [2022-07-12 17:09:31,283 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-12 17:09:31,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-12 17:09:31,283 INFO L130 BoogieDeclarations]: Found specification of procedure usb_hcd_giveback_urb [2022-07-12 17:09:31,283 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_hcd_giveback_urb [2022-07-12 17:09:31,283 INFO L130 BoogieDeclarations]: Found specification of procedure u132_bus_resume [2022-07-12 17:09:31,283 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_bus_resume [2022-07-12 17:09:31,283 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_slock_of_u132_spin [2022-07-12 17:09:31,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_slock_of_u132_spin [2022-07-12 17:09:31,284 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-12 17:09:31,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-12 17:09:31,284 INFO L130 BoogieDeclarations]: Found specification of procedure u132_endp_delete [2022-07-12 17:09:31,284 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_endp_delete [2022-07-12 17:09:31,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 17:09:31,284 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_platdata [2022-07-12 17:09:31,284 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_platdata [2022-07-12 17:09:31,284 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-07-12 17:09:31,284 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-07-12 17:09:31,284 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-12 17:09:31,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-12 17:09:31,285 INFO L130 BoogieDeclarations]: Found specification of procedure u132_endp_put_kref [2022-07-12 17:09:31,285 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_endp_put_kref [2022-07-12 17:09:31,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 17:09:31,285 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_100 [2022-07-12 17:09:31,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_100 [2022-07-12 17:09:31,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-07-12 17:09:31,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-07-12 17:09:31,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2022-07-12 17:09:31,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-12 17:09:31,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 17:09:31,286 INFO L130 BoogieDeclarations]: Found specification of procedure u132_ring_put_kref [2022-07-12 17:09:31,286 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_ring_put_kref [2022-07-12 17:09:31,286 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2022-07-12 17:09:31,286 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2022-07-12 17:09:31,286 INFO L130 BoogieDeclarations]: Found specification of procedure u132_endp_urb_dequeue [2022-07-12 17:09:31,286 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_endp_urb_dequeue [2022-07-12 17:09:31,286 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-12 17:09:31,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-12 17:09:31,287 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-12 17:09:31,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-12 17:09:31,287 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_init_map [2022-07-12 17:09:31,287 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_init_map [2022-07-12 17:09:31,287 INFO L130 BoogieDeclarations]: Found specification of procedure u132_hcd_reset [2022-07-12 17:09:31,287 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_hcd_reset [2022-07-12 17:09:31,287 INFO L130 BoogieDeclarations]: Found specification of procedure list_empty [2022-07-12 17:09:31,287 INFO L138 BoogieDeclarations]: Found implementation of procedure list_empty [2022-07-12 17:09:31,287 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-12 17:09:31,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-12 17:09:31,288 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-12 17:09:31,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-12 17:09:31,288 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-12 17:09:31,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-12 17:09:31,288 INFO L130 BoogieDeclarations]: Found specification of procedure port_power [2022-07-12 17:09:31,288 INFO L138 BoogieDeclarations]: Found implementation of procedure port_power [2022-07-12 17:09:31,288 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-12 17:09:31,288 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-12 17:09:31,288 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~C_INT [2022-07-12 17:09:31,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~C_INT [2022-07-12 17:09:31,289 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-12 17:09:31,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-12 17:09:31,289 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-12 17:09:31,289 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-12 17:09:31,289 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-12 17:09:31,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-12 17:09:31,289 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-12 17:09:31,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-12 17:09:31,289 INFO L130 BoogieDeclarations]: Found specification of procedure usb_hcd_link_urb_to_ep [2022-07-12 17:09:31,290 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_hcd_link_urb_to_ep [2022-07-12 17:09:31,290 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-12 17:09:31,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-12 17:09:31,290 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-12 17:09:31,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-12 17:09:31,292 INFO L130 BoogieDeclarations]: Found specification of procedure kref_init [2022-07-12 17:09:31,292 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_init [2022-07-12 17:09:31,292 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_scheduler_lock_of_u132 [2022-07-12 17:09:31,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_scheduler_lock_of_u132 [2022-07-12 17:09:31,292 INFO L130 BoogieDeclarations]: Found specification of procedure u132_ring_cancel_work [2022-07-12 17:09:31,292 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_ring_cancel_work [2022-07-12 17:09:31,292 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-12 17:09:31,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-12 17:09:31,293 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-12 17:09:31,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-12 17:09:31,293 INFO L130 BoogieDeclarations]: Found specification of procedure init_timer_key [2022-07-12 17:09:31,293 INFO L138 BoogieDeclarations]: Found implementation of procedure init_timer_key [2022-07-12 17:09:31,294 INFO L130 BoogieDeclarations]: Found specification of procedure msecs_to_jiffies [2022-07-12 17:09:31,294 INFO L138 BoogieDeclarations]: Found implementation of procedure msecs_to_jiffies [2022-07-12 17:09:31,294 INFO L130 BoogieDeclarations]: Found specification of procedure delayed_work_timer_fn [2022-07-12 17:09:31,294 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_u132_module_lock [2022-07-12 17:09:31,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_u132_module_lock [2022-07-12 17:09:31,945 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 17:09:31,947 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 17:09:32,137 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 17:10:12,131 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 17:10:12,143 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 17:10:12,144 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 17:10:12,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 05:10:12 BoogieIcfgContainer [2022-07-12 17:10:12,147 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 17:10:12,148 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 17:10:12,148 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 17:10:12,150 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 17:10:12,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 05:09:27" (1/3) ... [2022-07-12 17:10:12,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f33173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 05:10:12, skipping insertion in model container [2022-07-12 17:10:12,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:09:30" (2/3) ... [2022-07-12 17:10:12,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f33173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 05:10:12, skipping insertion in model container [2022-07-12 17:10:12,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 05:10:12" (3/3) ... [2022-07-12 17:10:12,151 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i [2022-07-12 17:10:12,160 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 17:10:12,161 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2022-07-12 17:10:12,261 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 17:10:12,265 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@44958b84, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4a293cb4 [2022-07-12 17:10:12,265 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2022-07-12 17:10:12,275 INFO L276 IsEmpty]: Start isEmpty. Operand has 2139 states, 1430 states have (on average 1.3258741258741258) internal successors, (1896), 1522 states have internal predecessors, (1896), 565 states have call successors, (565), 115 states have call predecessors, (565), 114 states have return successors, (559), 527 states have call predecessors, (559), 559 states have call successors, (559) [2022-07-12 17:10:12,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-12 17:10:12,282 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:10:12,282 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 17:10:12,282 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:10:12,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:10:12,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1788017132, now seen corresponding path program 1 times [2022-07-12 17:10:12,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:10:12,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [790883034] [2022-07-12 17:10:12,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:10:12,296 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:10:12,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:10:12,298 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:10:12,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-12 17:10:13,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:13,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 876 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 17:10:13,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:10:13,416 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 17:10:13,416 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:10:13,416 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:10:13,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [790883034] [2022-07-12 17:10:13,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [790883034] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:10:13,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:10:13,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 17:10:13,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329501202] [2022-07-12 17:10:13,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:10:13,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 17:10:13,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:10:13,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 17:10:13,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 17:10:13,440 INFO L87 Difference]: Start difference. First operand has 2139 states, 1430 states have (on average 1.3258741258741258) internal successors, (1896), 1522 states have internal predecessors, (1896), 565 states have call successors, (565), 115 states have call predecessors, (565), 114 states have return successors, (559), 527 states have call predecessors, (559), 559 states have call successors, (559) Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2022-07-12 17:10:13,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:10:13,649 INFO L93 Difference]: Finished difference Result 4241 states and 6214 transitions. [2022-07-12 17:10:13,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 17:10:13,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 61 [2022-07-12 17:10:13,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:10:13,675 INFO L225 Difference]: With dead ends: 4241 [2022-07-12 17:10:13,676 INFO L226 Difference]: Without dead ends: 2119 [2022-07-12 17:10:13,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 17:10:13,693 INFO L413 NwaCegarLoop]: 2982 mSDtfsCounter, 2933 mSDsluCounter, 2980 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2935 SdHoareTripleChecker+Valid, 5962 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:10:13,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2935 Valid, 5962 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 17:10:13,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2022-07-12 17:10:13,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 2119. [2022-07-12 17:10:13,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2119 states, 1419 states have (on average 1.302325581395349) internal successors, (1848), 1506 states have internal predecessors, (1848), 559 states have call successors, (559), 114 states have call predecessors, (559), 113 states have return successors, (557), 525 states have call predecessors, (557), 557 states have call successors, (557) [2022-07-12 17:10:13,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2119 states to 2119 states and 2964 transitions. [2022-07-12 17:10:13,802 INFO L78 Accepts]: Start accepts. Automaton has 2119 states and 2964 transitions. Word has length 61 [2022-07-12 17:10:13,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:10:13,803 INFO L495 AbstractCegarLoop]: Abstraction has 2119 states and 2964 transitions. [2022-07-12 17:10:13,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2022-07-12 17:10:13,803 INFO L276 IsEmpty]: Start isEmpty. Operand 2119 states and 2964 transitions. [2022-07-12 17:10:13,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-12 17:10:13,805 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:10:13,805 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 17:10:13,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-12 17:10:14,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:10:14,025 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:10:14,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:10:14,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1487276142, now seen corresponding path program 1 times [2022-07-12 17:10:14,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:10:14,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [257869733] [2022-07-12 17:10:14,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:10:14,028 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:10:14,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:10:14,029 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:10:14,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-12 17:10:14,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:14,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 17:10:14,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:10:14,998 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 17:10:14,998 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:10:14,999 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:10:14,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [257869733] [2022-07-12 17:10:14,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [257869733] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:10:14,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:10:14,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 17:10:14,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074728161] [2022-07-12 17:10:14,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:10:15,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 17:10:15,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:10:15,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 17:10:15,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 17:10:15,001 INFO L87 Difference]: Start difference. First operand 2119 states and 2964 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-12 17:10:15,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:10:15,075 INFO L93 Difference]: Finished difference Result 2119 states and 2964 transitions. [2022-07-12 17:10:15,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 17:10:15,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 67 [2022-07-12 17:10:15,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:10:15,086 INFO L225 Difference]: With dead ends: 2119 [2022-07-12 17:10:15,086 INFO L226 Difference]: Without dead ends: 2117 [2022-07-12 17:10:15,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 17:10:15,088 INFO L413 NwaCegarLoop]: 2960 mSDtfsCounter, 2905 mSDsluCounter, 2958 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2907 SdHoareTripleChecker+Valid, 5918 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:10:15,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2907 Valid, 5918 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 17:10:15,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2117 states. [2022-07-12 17:10:15,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2117 to 2117. [2022-07-12 17:10:15,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2117 states, 1418 states have (on average 1.301833568406206) internal successors, (1846), 1504 states have internal predecessors, (1846), 559 states have call successors, (559), 114 states have call predecessors, (559), 113 states have return successors, (557), 525 states have call predecessors, (557), 557 states have call successors, (557) [2022-07-12 17:10:15,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 2962 transitions. [2022-07-12 17:10:15,161 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 2962 transitions. Word has length 67 [2022-07-12 17:10:15,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:10:15,162 INFO L495 AbstractCegarLoop]: Abstraction has 2117 states and 2962 transitions. [2022-07-12 17:10:15,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-12 17:10:15,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 2962 transitions. [2022-07-12 17:10:15,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-12 17:10:15,167 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:10:15,167 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:10:15,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-12 17:10:15,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:10:15,382 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:10:15,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:10:15,383 INFO L85 PathProgramCache]: Analyzing trace with hash -2020854893, now seen corresponding path program 1 times [2022-07-12 17:10:15,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:10:15,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [843839119] [2022-07-12 17:10:15,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:10:15,384 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:10:15,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:10:15,385 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:10:15,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-12 17:10:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:16,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 905 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-12 17:10:16,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:10:16,479 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 17:10:16,480 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:10:16,480 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:10:16,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [843839119] [2022-07-12 17:10:16,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [843839119] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:10:16,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:10:16,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-12 17:10:16,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211187474] [2022-07-12 17:10:16,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:10:16,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 17:10:16,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:10:16,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 17:10:16,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2022-07-12 17:10:16,482 INFO L87 Difference]: Start difference. First operand 2117 states and 2962 transitions. Second operand has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 6 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-07-12 17:10:18,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:10:18,155 INFO L93 Difference]: Finished difference Result 3824 states and 5338 transitions. [2022-07-12 17:10:18,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 17:10:18,156 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 6 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) Word has length 69 [2022-07-12 17:10:18,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:10:18,166 INFO L225 Difference]: With dead ends: 3824 [2022-07-12 17:10:18,166 INFO L226 Difference]: Without dead ends: 2153 [2022-07-12 17:10:18,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2022-07-12 17:10:18,171 INFO L413 NwaCegarLoop]: 2957 mSDtfsCounter, 44 mSDsluCounter, 35264 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 38221 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-12 17:10:18,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 38221 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-12 17:10:18,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2153 states. [2022-07-12 17:10:18,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2153 to 2129. [2022-07-12 17:10:18,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2129 states, 1426 states have (on average 1.3001402524544179) internal successors, (1854), 1512 states have internal predecessors, (1854), 563 states have call successors, (563), 114 states have call predecessors, (563), 113 states have return successors, (561), 529 states have call predecessors, (561), 561 states have call successors, (561) [2022-07-12 17:10:18,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2129 states to 2129 states and 2978 transitions. [2022-07-12 17:10:18,235 INFO L78 Accepts]: Start accepts. Automaton has 2129 states and 2978 transitions. Word has length 69 [2022-07-12 17:10:18,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:10:18,236 INFO L495 AbstractCegarLoop]: Abstraction has 2129 states and 2978 transitions. [2022-07-12 17:10:18,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 6 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-07-12 17:10:18,236 INFO L276 IsEmpty]: Start isEmpty. Operand 2129 states and 2978 transitions. [2022-07-12 17:10:18,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-12 17:10:18,237 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:10:18,238 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 17:10:18,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-12 17:10:18,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:10:18,452 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:10:18,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:10:18,452 INFO L85 PathProgramCache]: Analyzing trace with hash 30076442, now seen corresponding path program 1 times [2022-07-12 17:10:18,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:10:18,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1414712676] [2022-07-12 17:10:18,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:10:18,453 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:10:18,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:10:18,455 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:10:18,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-12 17:10:19,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:19,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 17:10:19,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:10:19,536 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 17:10:19,536 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:10:19,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:10:19,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1414712676] [2022-07-12 17:10:19,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1414712676] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:10:19,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:10:19,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 17:10:19,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391682513] [2022-07-12 17:10:19,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:10:19,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 17:10:19,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:10:19,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 17:10:19,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 17:10:19,538 INFO L87 Difference]: Start difference. First operand 2129 states and 2978 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-12 17:10:19,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:10:19,622 INFO L93 Difference]: Finished difference Result 2129 states and 2978 transitions. [2022-07-12 17:10:19,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 17:10:19,623 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 73 [2022-07-12 17:10:19,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:10:19,633 INFO L225 Difference]: With dead ends: 2129 [2022-07-12 17:10:19,633 INFO L226 Difference]: Without dead ends: 2127 [2022-07-12 17:10:19,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 17:10:19,636 INFO L413 NwaCegarLoop]: 2958 mSDtfsCounter, 2897 mSDsluCounter, 2956 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2899 SdHoareTripleChecker+Valid, 5914 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:10:19,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2899 Valid, 5914 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 17:10:19,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2127 states. [2022-07-12 17:10:19,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2127 to 2127. [2022-07-12 17:10:19,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2127 states, 1425 states have (on average 1.2996491228070175) internal successors, (1852), 1510 states have internal predecessors, (1852), 563 states have call successors, (563), 114 states have call predecessors, (563), 113 states have return successors, (561), 529 states have call predecessors, (561), 561 states have call successors, (561) [2022-07-12 17:10:19,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 2127 states and 2976 transitions. [2022-07-12 17:10:19,696 INFO L78 Accepts]: Start accepts. Automaton has 2127 states and 2976 transitions. Word has length 73 [2022-07-12 17:10:19,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:10:19,697 INFO L495 AbstractCegarLoop]: Abstraction has 2127 states and 2976 transitions. [2022-07-12 17:10:19,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-12 17:10:19,697 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 2976 transitions. [2022-07-12 17:10:19,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-12 17:10:19,698 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:10:19,698 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 17:10:19,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-12 17:10:19,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:10:19,918 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:10:19,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:10:19,918 INFO L85 PathProgramCache]: Analyzing trace with hash 899638919, now seen corresponding path program 1 times [2022-07-12 17:10:19,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:10:19,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [923519779] [2022-07-12 17:10:19,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:10:19,919 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:10:19,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:10:19,920 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:10:19,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-12 17:10:20,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:20,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 903 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 17:10:20,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:10:20,992 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 17:10:20,992 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:10:20,992 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:10:20,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [923519779] [2022-07-12 17:10:20,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [923519779] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:10:20,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:10:20,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 17:10:20,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857619901] [2022-07-12 17:10:20,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:10:20,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 17:10:20,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:10:20,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 17:10:20,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 17:10:20,994 INFO L87 Difference]: Start difference. First operand 2127 states and 2976 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2022-07-12 17:10:21,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:10:21,062 INFO L93 Difference]: Finished difference Result 2127 states and 2976 transitions. [2022-07-12 17:10:21,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 17:10:21,062 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 79 [2022-07-12 17:10:21,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:10:21,070 INFO L225 Difference]: With dead ends: 2127 [2022-07-12 17:10:21,071 INFO L226 Difference]: Without dead ends: 2125 [2022-07-12 17:10:21,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 17:10:21,072 INFO L413 NwaCegarLoop]: 2956 mSDtfsCounter, 2889 mSDsluCounter, 2954 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2891 SdHoareTripleChecker+Valid, 5910 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:10:21,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2891 Valid, 5910 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 17:10:21,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2022-07-12 17:10:21,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 2125. [2022-07-12 17:10:21,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2125 states, 1424 states have (on average 1.2991573033707866) internal successors, (1850), 1508 states have internal predecessors, (1850), 563 states have call successors, (563), 114 states have call predecessors, (563), 113 states have return successors, (561), 529 states have call predecessors, (561), 561 states have call successors, (561) [2022-07-12 17:10:21,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 2125 states and 2974 transitions. [2022-07-12 17:10:21,142 INFO L78 Accepts]: Start accepts. Automaton has 2125 states and 2974 transitions. Word has length 79 [2022-07-12 17:10:21,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:10:21,142 INFO L495 AbstractCegarLoop]: Abstraction has 2125 states and 2974 transitions. [2022-07-12 17:10:21,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2022-07-12 17:10:21,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 2974 transitions. [2022-07-12 17:10:21,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-12 17:10:21,143 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:10:21,143 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:10:21,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-07-12 17:10:21,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:10:21,359 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:10:21,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:10:21,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1031673593, now seen corresponding path program 1 times [2022-07-12 17:10:21,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:10:21,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2135389255] [2022-07-12 17:10:21,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:10:21,360 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:10:21,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:10:21,362 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:10:21,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-12 17:10:22,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:22,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 959 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-12 17:10:22,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:10:22,727 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 17:10:22,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 17:10:23,293 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-12 17:10:23,294 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:10:23,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2135389255] [2022-07-12 17:10:23,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2135389255] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 17:10:23,294 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 17:10:23,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 20 [2022-07-12 17:10:23,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568828033] [2022-07-12 17:10:23,294 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 17:10:23,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-12 17:10:23,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:10:23,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-12 17:10:23,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2022-07-12 17:10:23,295 INFO L87 Difference]: Start difference. First operand 2125 states and 2974 transitions. Second operand has 20 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 18 states have internal predecessors, (55), 7 states have call successors, (16), 2 states have call predecessors, (16), 5 states have return successors, (15), 8 states have call predecessors, (15), 7 states have call successors, (15) [2022-07-12 17:10:26,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:10:26,557 INFO L93 Difference]: Finished difference Result 3852 states and 5390 transitions. [2022-07-12 17:10:26,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-12 17:10:26,558 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 18 states have internal predecessors, (55), 7 states have call successors, (16), 2 states have call predecessors, (16), 5 states have return successors, (15), 8 states have call predecessors, (15), 7 states have call successors, (15) Word has length 84 [2022-07-12 17:10:26,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:10:26,568 INFO L225 Difference]: With dead ends: 3852 [2022-07-12 17:10:26,568 INFO L226 Difference]: Without dead ends: 2185 [2022-07-12 17:10:26,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=235, Invalid=1097, Unknown=0, NotChecked=0, Total=1332 [2022-07-12 17:10:26,575 INFO L413 NwaCegarLoop]: 3000 mSDtfsCounter, 77 mSDsluCounter, 50451 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 407 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 53451 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 407 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:10:26,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 53451 Invalid, 1193 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [407 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-12 17:10:26,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2185 states. [2022-07-12 17:10:26,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2185 to 2127. [2022-07-12 17:10:26,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2127 states, 1426 states have (on average 1.2987377279102383) internal successors, (1852), 1510 states have internal predecessors, (1852), 563 states have call successors, (563), 114 states have call predecessors, (563), 113 states have return successors, (561), 529 states have call predecessors, (561), 561 states have call successors, (561) [2022-07-12 17:10:26,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 2127 states and 2976 transitions. [2022-07-12 17:10:26,640 INFO L78 Accepts]: Start accepts. Automaton has 2127 states and 2976 transitions. Word has length 84 [2022-07-12 17:10:26,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:10:26,640 INFO L495 AbstractCegarLoop]: Abstraction has 2127 states and 2976 transitions. [2022-07-12 17:10:26,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 18 states have internal predecessors, (55), 7 states have call successors, (16), 2 states have call predecessors, (16), 5 states have return successors, (15), 8 states have call predecessors, (15), 7 states have call successors, (15) [2022-07-12 17:10:26,641 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 2976 transitions. [2022-07-12 17:10:26,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-12 17:10:26,641 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:10:26,642 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 17:10:26,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-12 17:10:26,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:10:26,859 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:10:26,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:10:26,859 INFO L85 PathProgramCache]: Analyzing trace with hash 939608448, now seen corresponding path program 1 times [2022-07-12 17:10:26,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:10:26,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2125047751] [2022-07-12 17:10:26,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:10:26,860 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:10:26,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:10:26,861 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:10:26,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-12 17:10:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:27,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 912 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 17:10:27,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:10:27,917 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 17:10:27,917 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:10:27,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:10:27,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2125047751] [2022-07-12 17:10:27,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2125047751] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:10:27,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:10:27,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 17:10:27,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841960096] [2022-07-12 17:10:27,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:10:27,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 17:10:27,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:10:27,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 17:10:27,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 17:10:27,919 INFO L87 Difference]: Start difference. First operand 2127 states and 2976 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-12 17:10:27,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:10:27,983 INFO L93 Difference]: Finished difference Result 2127 states and 2976 transitions. [2022-07-12 17:10:27,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 17:10:27,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 85 [2022-07-12 17:10:27,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:10:27,992 INFO L225 Difference]: With dead ends: 2127 [2022-07-12 17:10:27,992 INFO L226 Difference]: Without dead ends: 2125 [2022-07-12 17:10:27,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 17:10:27,993 INFO L413 NwaCegarLoop]: 2954 mSDtfsCounter, 2881 mSDsluCounter, 2952 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2883 SdHoareTripleChecker+Valid, 5906 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:10:27,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2883 Valid, 5906 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 17:10:27,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2022-07-12 17:10:28,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 2125. [2022-07-12 17:10:28,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2125 states, 1425 states have (on average 1.2982456140350878) internal successors, (1850), 1508 states have internal predecessors, (1850), 563 states have call successors, (563), 114 states have call predecessors, (563), 113 states have return successors, (561), 529 states have call predecessors, (561), 561 states have call successors, (561) [2022-07-12 17:10:28,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 2125 states and 2974 transitions. [2022-07-12 17:10:28,051 INFO L78 Accepts]: Start accepts. Automaton has 2125 states and 2974 transitions. Word has length 85 [2022-07-12 17:10:28,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:10:28,051 INFO L495 AbstractCegarLoop]: Abstraction has 2125 states and 2974 transitions. [2022-07-12 17:10:28,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-12 17:10:28,052 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 2974 transitions. [2022-07-12 17:10:28,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-12 17:10:28,052 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:10:28,053 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 17:10:28,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-12 17:10:28,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:10:28,268 INFO L420 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_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:10:28,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:10:28,269 INFO L85 PathProgramCache]: Analyzing trace with hash 646919525, now seen corresponding path program 1 times [2022-07-12 17:10:28,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:10:28,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1263569103] [2022-07-12 17:10:28,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:10:28,270 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:10:28,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:10:28,271 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:10:28,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-12 17:10:28,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:28,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 17:10:28,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:10:29,271 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 17:10:29,271 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:10:29,272 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:10:29,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1263569103] [2022-07-12 17:10:29,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1263569103] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:10:29,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:10:29,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 17:10:29,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815475636] [2022-07-12 17:10:29,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:10:29,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 17:10:29,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:10:29,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 17:10:29,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 17:10:29,273 INFO L87 Difference]: Start difference. First operand 2125 states and 2974 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-07-12 17:10:29,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:10:29,367 INFO L93 Difference]: Finished difference Result 2125 states and 2974 transitions. [2022-07-12 17:10:29,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 17:10:29,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 91 [2022-07-12 17:10:29,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:10:29,376 INFO L225 Difference]: With dead ends: 2125 [2022-07-12 17:10:29,376 INFO L226 Difference]: Without dead ends: 2123 [2022-07-12 17:10:29,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 17:10:29,377 INFO L413 NwaCegarLoop]: 2952 mSDtfsCounter, 2873 mSDsluCounter, 2950 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2875 SdHoareTripleChecker+Valid, 5902 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:10:29,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2875 Valid, 5902 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 17:10:29,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2022-07-12 17:10:29,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 2123. [2022-07-12 17:10:29,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2123 states, 1424 states have (on average 1.297752808988764) internal successors, (1848), 1506 states have internal predecessors, (1848), 563 states have call successors, (563), 114 states have call predecessors, (563), 113 states have return successors, (561), 529 states have call predecessors, (561), 561 states have call successors, (561) [2022-07-12 17:10:29,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2123 states to 2123 states and 2972 transitions. [2022-07-12 17:10:29,438 INFO L78 Accepts]: Start accepts. Automaton has 2123 states and 2972 transitions. Word has length 91 [2022-07-12 17:10:29,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:10:29,438 INFO L495 AbstractCegarLoop]: Abstraction has 2123 states and 2972 transitions. [2022-07-12 17:10:29,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-07-12 17:10:29,439 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 2972 transitions. [2022-07-12 17:10:29,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-12 17:10:29,440 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:10:29,440 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 17:10:29,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-12 17:10:29,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:10:29,656 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:10:29,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:10:29,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1307078380, now seen corresponding path program 1 times [2022-07-12 17:10:29,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:10:29,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1034099390] [2022-07-12 17:10:29,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:10:29,657 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:10:29,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:10:29,658 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:10:29,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-12 17:10:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:30,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 930 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 17:10:30,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:10:30,707 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 17:10:30,707 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:10:30,707 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:10:30,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1034099390] [2022-07-12 17:10:30,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1034099390] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:10:30,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:10:30,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 17:10:30,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033337965] [2022-07-12 17:10:30,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:10:30,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 17:10:30,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:10:30,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 17:10:30,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 17:10:30,709 INFO L87 Difference]: Start difference. First operand 2123 states and 2972 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-12 17:10:30,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:10:30,780 INFO L93 Difference]: Finished difference Result 2123 states and 2972 transitions. [2022-07-12 17:10:30,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 17:10:30,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 97 [2022-07-12 17:10:30,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:10:30,788 INFO L225 Difference]: With dead ends: 2123 [2022-07-12 17:10:30,788 INFO L226 Difference]: Without dead ends: 2121 [2022-07-12 17:10:30,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 17:10:30,790 INFO L413 NwaCegarLoop]: 2950 mSDtfsCounter, 2865 mSDsluCounter, 2948 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2867 SdHoareTripleChecker+Valid, 5898 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:10:30,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2867 Valid, 5898 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 17:10:30,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2121 states. [2022-07-12 17:10:30,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2121 to 2121. [2022-07-12 17:10:30,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2121 states, 1423 states have (on average 1.297259311314125) internal successors, (1846), 1504 states have internal predecessors, (1846), 563 states have call successors, (563), 114 states have call predecessors, (563), 113 states have return successors, (561), 529 states have call predecessors, (561), 561 states have call successors, (561) [2022-07-12 17:10:30,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 2970 transitions. [2022-07-12 17:10:30,867 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 2970 transitions. Word has length 97 [2022-07-12 17:10:30,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:10:30,869 INFO L495 AbstractCegarLoop]: Abstraction has 2121 states and 2970 transitions. [2022-07-12 17:10:30,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-12 17:10:30,869 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 2970 transitions. [2022-07-12 17:10:30,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-12 17:10:30,872 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:10:30,872 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2022-07-12 17:10:30,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-12 17:10:31,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:10:31,087 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:10:31,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:10:31,087 INFO L85 PathProgramCache]: Analyzing trace with hash -500874874, now seen corresponding path program 1 times [2022-07-12 17:10:31,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:10:31,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2110048424] [2022-07-12 17:10:31,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:10:31,088 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:10:31,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:10:31,089 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:10:31,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-12 17:10:31,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:31,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 1104 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-12 17:10:31,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:10:32,025 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 52 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-12 17:10:32,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 17:10:32,509 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-12 17:10:32,509 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:10:32,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2110048424] [2022-07-12 17:10:32,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2110048424] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 17:10:32,509 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 17:10:32,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-07-12 17:10:32,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570340383] [2022-07-12 17:10:32,509 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 17:10:32,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 17:10:32,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:10:32,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 17:10:32,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-12 17:10:32,510 INFO L87 Difference]: Start difference. First operand 2121 states and 2970 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 3 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 4 states have call predecessors, (27), 3 states have call successors, (27) [2022-07-12 17:10:33,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:10:33,345 INFO L93 Difference]: Finished difference Result 4229 states and 5932 transitions. [2022-07-12 17:10:33,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 17:10:33,347 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 3 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 4 states have call predecessors, (27), 3 states have call successors, (27) Word has length 108 [2022-07-12 17:10:33,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:10:33,355 INFO L225 Difference]: With dead ends: 4229 [2022-07-12 17:10:33,355 INFO L226 Difference]: Without dead ends: 2145 [2022-07-12 17:10:33,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 206 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-12 17:10:33,361 INFO L413 NwaCegarLoop]: 2990 mSDtfsCounter, 771 mSDsluCounter, 16858 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1022 SdHoareTripleChecker+Valid, 19848 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 17:10:33,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1022 Valid, 19848 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 17:10:33,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2145 states. [2022-07-12 17:10:33,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2145 to 2121. [2022-07-12 17:10:33,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2121 states, 1423 states have (on average 1.2965565706254392) internal successors, (1845), 1503 states have internal predecessors, (1845), 563 states have call successors, (563), 114 states have call predecessors, (563), 113 states have return successors, (561), 529 states have call predecessors, (561), 561 states have call successors, (561) [2022-07-12 17:10:33,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 2969 transitions. [2022-07-12 17:10:33,436 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 2969 transitions. Word has length 108 [2022-07-12 17:10:33,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:10:33,437 INFO L495 AbstractCegarLoop]: Abstraction has 2121 states and 2969 transitions. [2022-07-12 17:10:33,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 3 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 4 states have call predecessors, (27), 3 states have call successors, (27) [2022-07-12 17:10:33,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 2969 transitions. [2022-07-12 17:10:33,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-12 17:10:33,438 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:10:33,438 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2022-07-12 17:10:33,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-12 17:10:33,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:10:33,655 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:10:33,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:10:33,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1791612701, now seen corresponding path program 1 times [2022-07-12 17:10:33,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:10:33,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1808009689] [2022-07-12 17:10:33,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:10:33,657 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:10:33,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:10:33,658 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:10:33,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-12 17:10:34,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:34,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 1116 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 17:10:34,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:10:34,860 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-12 17:10:34,860 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:10:34,860 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:10:34,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1808009689] [2022-07-12 17:10:34,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1808009689] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:10:34,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:10:34,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 17:10:34,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616614505] [2022-07-12 17:10:34,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:10:34,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 17:10:34,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:10:34,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 17:10:34,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 17:10:34,861 INFO L87 Difference]: Start difference. First operand 2121 states and 2969 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 17:10:35,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:10:35,015 INFO L93 Difference]: Finished difference Result 4344 states and 6027 transitions. [2022-07-12 17:10:35,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 17:10:35,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 112 [2022-07-12 17:10:35,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:10:35,026 INFO L225 Difference]: With dead ends: 4344 [2022-07-12 17:10:35,026 INFO L226 Difference]: Without dead ends: 2262 [2022-07-12 17:10:35,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 17:10:35,032 INFO L413 NwaCegarLoop]: 2949 mSDtfsCounter, 2815 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2815 SdHoareTripleChecker+Valid, 3136 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 17:10:35,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2815 Valid, 3136 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 17:10:35,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2262 states. [2022-07-12 17:10:35,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2262 to 2230. [2022-07-12 17:10:35,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2230 states, 1509 states have (on average 1.2882703777335984) internal successors, (1944), 1589 states have internal predecessors, (1944), 564 states have call successors, (564), 136 states have call predecessors, (564), 135 states have return successors, (562), 530 states have call predecessors, (562), 562 states have call successors, (562) [2022-07-12 17:10:35,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2230 states to 2230 states and 3070 transitions. [2022-07-12 17:10:35,119 INFO L78 Accepts]: Start accepts. Automaton has 2230 states and 3070 transitions. Word has length 112 [2022-07-12 17:10:35,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:10:35,119 INFO L495 AbstractCegarLoop]: Abstraction has 2230 states and 3070 transitions. [2022-07-12 17:10:35,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 17:10:35,120 INFO L276 IsEmpty]: Start isEmpty. Operand 2230 states and 3070 transitions. [2022-07-12 17:10:35,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-12 17:10:35,121 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:10:35,121 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2022-07-12 17:10:35,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-12 17:10:35,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:10:35,335 INFO L420 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_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:10:35,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:10:35,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1020705901, now seen corresponding path program 1 times [2022-07-12 17:10:35,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:10:35,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [551194146] [2022-07-12 17:10:35,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:10:35,337 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:10:35,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:10:35,338 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:10:35,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-12 17:10:35,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:35,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 17:10:36,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:10:36,494 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 17:10:36,494 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:10:36,494 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:10:36,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [551194146] [2022-07-12 17:10:36,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [551194146] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:10:36,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:10:36,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 17:10:36,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826201656] [2022-07-12 17:10:36,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:10:36,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 17:10:36,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:10:36,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 17:10:36,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 17:10:36,495 INFO L87 Difference]: Start difference. First operand 2230 states and 3070 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-07-12 17:10:36,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:10:36,574 INFO L93 Difference]: Finished difference Result 2230 states and 3070 transitions. [2022-07-12 17:10:36,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 17:10:36,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 103 [2022-07-12 17:10:36,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:10:36,581 INFO L225 Difference]: With dead ends: 2230 [2022-07-12 17:10:36,582 INFO L226 Difference]: Without dead ends: 2228 [2022-07-12 17:10:36,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 17:10:36,583 INFO L413 NwaCegarLoop]: 2946 mSDtfsCounter, 2859 mSDsluCounter, 2940 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2861 SdHoareTripleChecker+Valid, 5886 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:10:36,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2861 Valid, 5886 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 17:10:36,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2228 states. [2022-07-12 17:10:36,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2228 to 2228. [2022-07-12 17:10:36,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2228 states, 1508 states have (on average 1.2871352785145889) internal successors, (1941), 1587 states have internal predecessors, (1941), 564 states have call successors, (564), 136 states have call predecessors, (564), 135 states have return successors, (562), 530 states have call predecessors, (562), 562 states have call successors, (562) [2022-07-12 17:10:36,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 3067 transitions. [2022-07-12 17:10:36,669 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 3067 transitions. Word has length 103 [2022-07-12 17:10:36,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:10:36,670 INFO L495 AbstractCegarLoop]: Abstraction has 2228 states and 3067 transitions. [2022-07-12 17:10:36,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-07-12 17:10:36,670 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 3067 transitions. [2022-07-12 17:10:36,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-12 17:10:36,671 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:10:36,671 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:10:36,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-12 17:10:36,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:10:36,887 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:10:36,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:10:36,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1645689226, now seen corresponding path program 1 times [2022-07-12 17:10:36,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:10:36,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1510322965] [2022-07-12 17:10:36,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:10:36,889 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:10:36,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:10:36,890 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:10:36,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-12 17:10:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:37,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 942 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 17:10:37,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:10:37,911 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 17:10:37,911 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:10:37,912 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:10:37,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1510322965] [2022-07-12 17:10:37,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1510322965] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:10:37,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:10:37,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 17:10:37,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997776769] [2022-07-12 17:10:37,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:10:37,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 17:10:37,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:10:37,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 17:10:37,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 17:10:37,913 INFO L87 Difference]: Start difference. First operand 2228 states and 3067 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-07-12 17:10:37,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:10:37,995 INFO L93 Difference]: Finished difference Result 2228 states and 3067 transitions. [2022-07-12 17:10:37,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 17:10:37,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2022-07-12 17:10:37,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:10:38,003 INFO L225 Difference]: With dead ends: 2228 [2022-07-12 17:10:38,003 INFO L226 Difference]: Without dead ends: 2226 [2022-07-12 17:10:38,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 17:10:38,004 INFO L413 NwaCegarLoop]: 2944 mSDtfsCounter, 2851 mSDsluCounter, 2942 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2853 SdHoareTripleChecker+Valid, 5886 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:10:38,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2853 Valid, 5886 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 17:10:38,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2226 states. [2022-07-12 17:10:38,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2226 to 2226. [2022-07-12 17:10:38,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2226 states, 1507 states have (on average 1.2859986728599868) internal successors, (1938), 1585 states have internal predecessors, (1938), 564 states have call successors, (564), 136 states have call predecessors, (564), 135 states have return successors, (562), 530 states have call predecessors, (562), 562 states have call successors, (562) [2022-07-12 17:10:38,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2226 states to 2226 states and 3064 transitions. [2022-07-12 17:10:38,084 INFO L78 Accepts]: Start accepts. Automaton has 2226 states and 3064 transitions. Word has length 105 [2022-07-12 17:10:38,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:10:38,085 INFO L495 AbstractCegarLoop]: Abstraction has 2226 states and 3064 transitions. [2022-07-12 17:10:38,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-07-12 17:10:38,085 INFO L276 IsEmpty]: Start isEmpty. Operand 2226 states and 3064 transitions. [2022-07-12 17:10:38,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-12 17:10:38,086 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:10:38,086 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2022-07-12 17:10:38,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-12 17:10:38,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:10:38,299 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:10:38,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:10:38,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1257847071, now seen corresponding path program 1 times [2022-07-12 17:10:38,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:10:38,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [837017027] [2022-07-12 17:10:38,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:10:38,301 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:10:38,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:10:38,302 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:10:38,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-12 17:10:39,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:39,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 1133 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 17:10:39,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:10:39,168 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-07-12 17:10:39,169 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:10:39,169 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:10:39,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [837017027] [2022-07-12 17:10:39,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [837017027] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:10:39,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:10:39,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 17:10:39,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290959625] [2022-07-12 17:10:39,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:10:39,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 17:10:39,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:10:39,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 17:10:39,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 17:10:39,170 INFO L87 Difference]: Start difference. First operand 2226 states and 3064 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 17:10:39,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:10:39,303 INFO L93 Difference]: Finished difference Result 4409 states and 6070 transitions. [2022-07-12 17:10:39,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 17:10:39,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 118 [2022-07-12 17:10:39,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:10:39,310 INFO L225 Difference]: With dead ends: 4409 [2022-07-12 17:10:39,310 INFO L226 Difference]: Without dead ends: 2222 [2022-07-12 17:10:39,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 17:10:39,316 INFO L413 NwaCegarLoop]: 2940 mSDtfsCounter, 2913 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2913 SdHoareTripleChecker+Valid, 2940 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 17:10:39,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2913 Valid, 2940 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 17:10:39,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2222 states. [2022-07-12 17:10:39,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2222 to 2222. [2022-07-12 17:10:39,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2222 states, 1504 states have (on average 1.2852393617021276) internal successors, (1933), 1581 states have internal predecessors, (1933), 564 states have call successors, (564), 136 states have call predecessors, (564), 135 states have return successors, (562), 530 states have call predecessors, (562), 562 states have call successors, (562) [2022-07-12 17:10:39,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2222 states to 2222 states and 3059 transitions. [2022-07-12 17:10:39,394 INFO L78 Accepts]: Start accepts. Automaton has 2222 states and 3059 transitions. Word has length 118 [2022-07-12 17:10:39,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:10:39,394 INFO L495 AbstractCegarLoop]: Abstraction has 2222 states and 3059 transitions. [2022-07-12 17:10:39,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 17:10:39,395 INFO L276 IsEmpty]: Start isEmpty. Operand 2222 states and 3059 transitions. [2022-07-12 17:10:39,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-12 17:10:39,395 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:10:39,395 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:10:39,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-12 17:10:39,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:10:39,611 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:10:39,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:10:39,612 INFO L85 PathProgramCache]: Analyzing trace with hash -906403881, now seen corresponding path program 1 times [2022-07-12 17:10:39,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:10:39,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1660665016] [2022-07-12 17:10:39,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:10:39,613 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:10:39,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:10:39,614 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:10:39,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-12 17:10:40,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:40,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 951 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 17:10:40,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:10:40,692 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 17:10:40,693 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:10:40,693 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:10:40,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1660665016] [2022-07-12 17:10:40,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1660665016] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:10:40,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:10:40,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 17:10:40,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668769662] [2022-07-12 17:10:40,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:10:40,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 17:10:40,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:10:40,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 17:10:40,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 17:10:40,694 INFO L87 Difference]: Start difference. First operand 2222 states and 3059 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2022-07-12 17:10:40,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:10:40,774 INFO L93 Difference]: Finished difference Result 2222 states and 3059 transitions. [2022-07-12 17:10:40,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 17:10:40,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 111 [2022-07-12 17:10:40,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:10:40,790 INFO L225 Difference]: With dead ends: 2222 [2022-07-12 17:10:40,791 INFO L226 Difference]: Without dead ends: 2220 [2022-07-12 17:10:40,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 17:10:40,792 INFO L413 NwaCegarLoop]: 2937 mSDtfsCounter, 2838 mSDsluCounter, 2935 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2840 SdHoareTripleChecker+Valid, 5872 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:10:40,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2840 Valid, 5872 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 17:10:40,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2220 states. [2022-07-12 17:10:40,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2220 to 2220. [2022-07-12 17:10:40,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2220 states, 1503 states have (on average 1.2840984697272122) internal successors, (1930), 1579 states have internal predecessors, (1930), 564 states have call successors, (564), 136 states have call predecessors, (564), 135 states have return successors, (562), 530 states have call predecessors, (562), 562 states have call successors, (562) [2022-07-12 17:10:40,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2220 states to 2220 states and 3056 transitions. [2022-07-12 17:10:40,868 INFO L78 Accepts]: Start accepts. Automaton has 2220 states and 3056 transitions. Word has length 111 [2022-07-12 17:10:40,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:10:40,869 INFO L495 AbstractCegarLoop]: Abstraction has 2220 states and 3056 transitions. [2022-07-12 17:10:40,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2022-07-12 17:10:40,869 INFO L276 IsEmpty]: Start isEmpty. Operand 2220 states and 3056 transitions. [2022-07-12 17:10:40,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-12 17:10:40,870 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:10:40,870 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2022-07-12 17:10:40,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-12 17:10:41,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:10:41,079 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:10:41,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:10:41,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1776112754, now seen corresponding path program 1 times [2022-07-12 17:10:41,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:10:41,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2015311093] [2022-07-12 17:10:41,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:10:41,081 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:10:41,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:10:41,082 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:10:41,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-12 17:10:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:41,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 1142 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 17:10:41,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:10:41,980 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-07-12 17:10:41,980 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:10:41,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:10:41,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2015311093] [2022-07-12 17:10:41,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2015311093] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:10:41,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:10:41,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 17:10:41,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290752006] [2022-07-12 17:10:41,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:10:41,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 17:10:41,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:10:41,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 17:10:41,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 17:10:41,982 INFO L87 Difference]: Start difference. First operand 2220 states and 3056 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 17:10:42,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:10:42,137 INFO L93 Difference]: Finished difference Result 4397 states and 6054 transitions. [2022-07-12 17:10:42,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 17:10:42,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 124 [2022-07-12 17:10:42,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:10:42,142 INFO L225 Difference]: With dead ends: 4397 [2022-07-12 17:10:42,142 INFO L226 Difference]: Without dead ends: 2216 [2022-07-12 17:10:42,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 17:10:42,146 INFO L413 NwaCegarLoop]: 2933 mSDtfsCounter, 2904 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2904 SdHoareTripleChecker+Valid, 2933 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 17:10:42,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2904 Valid, 2933 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 17:10:42,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2216 states. [2022-07-12 17:10:42,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2216 to 2216. [2022-07-12 17:10:42,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2216 states, 1500 states have (on average 1.2833333333333334) internal successors, (1925), 1575 states have internal predecessors, (1925), 564 states have call successors, (564), 136 states have call predecessors, (564), 135 states have return successors, (562), 530 states have call predecessors, (562), 562 states have call successors, (562) [2022-07-12 17:10:42,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 3051 transitions. [2022-07-12 17:10:42,218 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 3051 transitions. Word has length 124 [2022-07-12 17:10:42,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:10:42,219 INFO L495 AbstractCegarLoop]: Abstraction has 2216 states and 3051 transitions. [2022-07-12 17:10:42,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 17:10:42,219 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 3051 transitions. [2022-07-12 17:10:42,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-12 17:10:42,220 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:10:42,220 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:10:42,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-12 17:10:42,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:10:42,440 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:10:42,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:10:42,440 INFO L85 PathProgramCache]: Analyzing trace with hash -283647224, now seen corresponding path program 1 times [2022-07-12 17:10:42,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:10:42,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [249346642] [2022-07-12 17:10:42,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:10:42,441 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:10:42,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:10:42,442 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:10:42,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-12 17:10:43,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:43,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 960 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 17:10:43,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:10:43,571 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 17:10:43,571 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:10:43,572 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:10:43,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [249346642] [2022-07-12 17:10:43,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [249346642] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:10:43,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:10:43,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 17:10:43,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826433719] [2022-07-12 17:10:43,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:10:43,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 17:10:43,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:10:43,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 17:10:43,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 17:10:43,573 INFO L87 Difference]: Start difference. First operand 2216 states and 3051 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-12 17:10:43,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:10:43,669 INFO L93 Difference]: Finished difference Result 2216 states and 3051 transitions. [2022-07-12 17:10:43,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 17:10:43,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 117 [2022-07-12 17:10:43,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:10:43,675 INFO L225 Difference]: With dead ends: 2216 [2022-07-12 17:10:43,675 INFO L226 Difference]: Without dead ends: 2214 [2022-07-12 17:10:43,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 17:10:43,676 INFO L413 NwaCegarLoop]: 2930 mSDtfsCounter, 2825 mSDsluCounter, 2928 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2827 SdHoareTripleChecker+Valid, 5858 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:10:43,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2827 Valid, 5858 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 17:10:43,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2214 states. [2022-07-12 17:10:43,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2214 to 2214. [2022-07-12 17:10:43,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2214 states, 1499 states have (on average 1.2821881254169447) internal successors, (1922), 1573 states have internal predecessors, (1922), 564 states have call successors, (564), 136 states have call predecessors, (564), 135 states have return successors, (562), 530 states have call predecessors, (562), 562 states have call successors, (562) [2022-07-12 17:10:43,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2214 states to 2214 states and 3048 transitions. [2022-07-12 17:10:43,751 INFO L78 Accepts]: Start accepts. Automaton has 2214 states and 3048 transitions. Word has length 117 [2022-07-12 17:10:43,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:10:43,752 INFO L495 AbstractCegarLoop]: Abstraction has 2214 states and 3048 transitions. [2022-07-12 17:10:43,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-12 17:10:43,752 INFO L276 IsEmpty]: Start isEmpty. Operand 2214 states and 3048 transitions. [2022-07-12 17:10:43,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-12 17:10:43,754 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:10:43,754 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:10:43,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-12 17:10:43,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:10:43,968 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:10:43,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:10:43,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1320011400, now seen corresponding path program 1 times [2022-07-12 17:10:43,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:10:43,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1944034262] [2022-07-12 17:10:43,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:10:43,969 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:10:43,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:10:43,971 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:10:43,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-12 17:10:44,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:44,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 969 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 17:10:44,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:10:45,221 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 17:10:45,221 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:10:45,221 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:10:45,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1944034262] [2022-07-12 17:10:45,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1944034262] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:10:45,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:10:45,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 17:10:45,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978772613] [2022-07-12 17:10:45,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:10:45,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 17:10:45,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:10:45,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 17:10:45,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 17:10:45,223 INFO L87 Difference]: Start difference. First operand 2214 states and 3048 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2022-07-12 17:10:45,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:10:45,328 INFO L93 Difference]: Finished difference Result 2214 states and 3048 transitions. [2022-07-12 17:10:45,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 17:10:45,329 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 123 [2022-07-12 17:10:45,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:10:45,334 INFO L225 Difference]: With dead ends: 2214 [2022-07-12 17:10:45,334 INFO L226 Difference]: Without dead ends: 2212 [2022-07-12 17:10:45,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 17:10:45,335 INFO L413 NwaCegarLoop]: 2928 mSDtfsCounter, 2817 mSDsluCounter, 2926 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2819 SdHoareTripleChecker+Valid, 5854 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:10:45,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2819 Valid, 5854 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 17:10:45,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2212 states. [2022-07-12 17:10:45,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2212 to 2212. [2022-07-12 17:10:45,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2212 states, 1498 states have (on average 1.281041388518024) internal successors, (1919), 1571 states have internal predecessors, (1919), 564 states have call successors, (564), 136 states have call predecessors, (564), 135 states have return successors, (562), 530 states have call predecessors, (562), 562 states have call successors, (562) [2022-07-12 17:10:45,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2212 states to 2212 states and 3045 transitions. [2022-07-12 17:10:45,412 INFO L78 Accepts]: Start accepts. Automaton has 2212 states and 3045 transitions. Word has length 123 [2022-07-12 17:10:45,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:10:45,412 INFO L495 AbstractCegarLoop]: Abstraction has 2212 states and 3045 transitions. [2022-07-12 17:10:45,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2022-07-12 17:10:45,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2212 states and 3045 transitions. [2022-07-12 17:10:45,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-12 17:10:45,413 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:10:45,414 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:10:45,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-12 17:10:45,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:10:45,628 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:10:45,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:10:45,628 INFO L85 PathProgramCache]: Analyzing trace with hash 2123786986, now seen corresponding path program 1 times [2022-07-12 17:10:45,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:10:45,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [50784605] [2022-07-12 17:10:45,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:10:45,629 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:10:45,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:10:45,630 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:10:45,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-12 17:10:46,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:46,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 978 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 17:10:46,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:10:46,785 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 17:10:46,786 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:10:46,786 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:10:46,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [50784605] [2022-07-12 17:10:46,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [50784605] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:10:46,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:10:46,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 17:10:46,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082173324] [2022-07-12 17:10:46,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:10:46,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 17:10:46,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:10:46,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 17:10:46,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 17:10:46,788 INFO L87 Difference]: Start difference. First operand 2212 states and 3045 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-07-12 17:10:46,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:10:46,877 INFO L93 Difference]: Finished difference Result 2212 states and 3045 transitions. [2022-07-12 17:10:46,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 17:10:46,877 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 129 [2022-07-12 17:10:46,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:10:46,884 INFO L225 Difference]: With dead ends: 2212 [2022-07-12 17:10:46,884 INFO L226 Difference]: Without dead ends: 2210 [2022-07-12 17:10:46,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 17:10:46,885 INFO L413 NwaCegarLoop]: 2926 mSDtfsCounter, 2809 mSDsluCounter, 2924 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2811 SdHoareTripleChecker+Valid, 5850 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:10:46,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2811 Valid, 5850 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 17:10:46,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2210 states. [2022-07-12 17:10:46,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2210 to 2210. [2022-07-12 17:10:46,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2210 states, 1497 states have (on average 1.2798931195724783) internal successors, (1916), 1569 states have internal predecessors, (1916), 564 states have call successors, (564), 136 states have call predecessors, (564), 135 states have return successors, (562), 530 states have call predecessors, (562), 562 states have call successors, (562) [2022-07-12 17:10:46,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2210 states to 2210 states and 3042 transitions. [2022-07-12 17:10:46,967 INFO L78 Accepts]: Start accepts. Automaton has 2210 states and 3042 transitions. Word has length 129 [2022-07-12 17:10:46,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:10:46,968 INFO L495 AbstractCegarLoop]: Abstraction has 2210 states and 3042 transitions. [2022-07-12 17:10:46,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-07-12 17:10:46,968 INFO L276 IsEmpty]: Start isEmpty. Operand 2210 states and 3042 transitions. [2022-07-12 17:10:46,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-12 17:10:46,969 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:10:46,969 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 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] [2022-07-12 17:10:47,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-12 17:10:47,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:10:47,175 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:10:47,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:10:47,176 INFO L85 PathProgramCache]: Analyzing trace with hash -441552089, now seen corresponding path program 1 times [2022-07-12 17:10:47,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:10:47,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [363296523] [2022-07-12 17:10:47,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:10:47,177 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:10:47,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:10:47,179 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:10:47,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-12 17:10:47,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:47,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 1122 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 17:10:47,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:10:48,459 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-07-12 17:10:48,459 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:10:48,459 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:10:48,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [363296523] [2022-07-12 17:10:48,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [363296523] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:10:48,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:10:48,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 17:10:48,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584491584] [2022-07-12 17:10:48,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:10:48,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 17:10:48,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:10:48,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 17:10:48,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 17:10:48,461 INFO L87 Difference]: Start difference. First operand 2210 states and 3042 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-07-12 17:10:48,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:10:48,597 INFO L93 Difference]: Finished difference Result 2229 states and 3057 transitions. [2022-07-12 17:10:48,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 17:10:48,598 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2022-07-12 17:10:48,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:10:48,602 INFO L225 Difference]: With dead ends: 2229 [2022-07-12 17:10:48,602 INFO L226 Difference]: Without dead ends: 2227 [2022-07-12 17:10:48,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 17:10:48,603 INFO L413 NwaCegarLoop]: 2933 mSDtfsCounter, 2814 mSDsluCounter, 5893 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2815 SdHoareTripleChecker+Valid, 8826 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:10:48,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2815 Valid, 8826 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 17:10:48,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2022-07-12 17:10:48,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 2225. [2022-07-12 17:10:48,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2225 states, 1508 states have (on average 1.2785145888594165) internal successors, (1928), 1580 states have internal predecessors, (1928), 564 states have call successors, (564), 140 states have call predecessors, (564), 139 states have return successors, (562), 530 states have call predecessors, (562), 562 states have call successors, (562) [2022-07-12 17:10:48,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2225 states to 2225 states and 3054 transitions. [2022-07-12 17:10:48,706 INFO L78 Accepts]: Start accepts. Automaton has 2225 states and 3054 transitions. Word has length 144 [2022-07-12 17:10:48,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:10:48,706 INFO L495 AbstractCegarLoop]: Abstraction has 2225 states and 3054 transitions. [2022-07-12 17:10:48,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-07-12 17:10:48,706 INFO L276 IsEmpty]: Start isEmpty. Operand 2225 states and 3054 transitions. [2022-07-12 17:10:48,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-12 17:10:48,707 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:10:48,708 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:10:48,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-12 17:10:48,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:10:48,928 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:10:48,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:10:48,928 INFO L85 PathProgramCache]: Analyzing trace with hash 847759442, now seen corresponding path program 1 times [2022-07-12 17:10:48,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:10:48,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1862968661] [2022-07-12 17:10:48,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:10:48,929 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:10:48,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:10:48,931 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:10:48,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-12 17:10:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:49,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 17:10:49,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:10:50,199 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 17:10:50,199 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:10:50,199 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:10:50,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1862968661] [2022-07-12 17:10:50,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1862968661] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:10:50,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:10:50,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 17:10:50,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593197396] [2022-07-12 17:10:50,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:10:50,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 17:10:50,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:10:50,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 17:10:50,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 17:10:50,201 INFO L87 Difference]: Start difference. First operand 2225 states and 3054 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2022-07-12 17:10:50,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:10:50,297 INFO L93 Difference]: Finished difference Result 2225 states and 3054 transitions. [2022-07-12 17:10:50,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 17:10:50,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 135 [2022-07-12 17:10:50,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:10:50,302 INFO L225 Difference]: With dead ends: 2225 [2022-07-12 17:10:50,302 INFO L226 Difference]: Without dead ends: 2223 [2022-07-12 17:10:50,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 17:10:50,303 INFO L413 NwaCegarLoop]: 2924 mSDtfsCounter, 2801 mSDsluCounter, 2922 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2803 SdHoareTripleChecker+Valid, 5846 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:10:50,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2803 Valid, 5846 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 17:10:50,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2223 states. [2022-07-12 17:10:50,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2223 to 2223. [2022-07-12 17:10:50,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2223 states, 1507 states have (on average 1.2773722627737227) internal successors, (1925), 1578 states have internal predecessors, (1925), 564 states have call successors, (564), 140 states have call predecessors, (564), 139 states have return successors, (562), 530 states have call predecessors, (562), 562 states have call successors, (562) [2022-07-12 17:10:50,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 2223 states and 3051 transitions. [2022-07-12 17:10:50,402 INFO L78 Accepts]: Start accepts. Automaton has 2223 states and 3051 transitions. Word has length 135 [2022-07-12 17:10:50,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:10:50,402 INFO L495 AbstractCegarLoop]: Abstraction has 2223 states and 3051 transitions. [2022-07-12 17:10:50,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2022-07-12 17:10:50,403 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 3051 transitions. [2022-07-12 17:10:50,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-07-12 17:10:50,404 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:10:50,404 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 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] [2022-07-12 17:10:50,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-12 17:10:50,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:10:50,620 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:10:50,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:10:50,620 INFO L85 PathProgramCache]: Analyzing trace with hash 881503017, now seen corresponding path program 1 times [2022-07-12 17:10:50,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:10:50,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [863676806] [2022-07-12 17:10:50,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:10:50,621 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:10:50,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:10:50,623 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:10:50,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-12 17:10:51,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:51,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 1143 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 17:10:51,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:10:51,441 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-07-12 17:10:51,441 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:10:51,441 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:10:51,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [863676806] [2022-07-12 17:10:51,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [863676806] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:10:51,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:10:51,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 17:10:51,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519488412] [2022-07-12 17:10:51,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:10:51,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 17:10:51,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:10:51,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 17:10:51,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 17:10:51,443 INFO L87 Difference]: Start difference. First operand 2223 states and 3051 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 2 states have call predecessors, (22), 1 states have call successors, (22) [2022-07-12 17:10:51,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:10:51,676 INFO L93 Difference]: Finished difference Result 2225 states and 3052 transitions. [2022-07-12 17:10:51,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 17:10:51,676 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 2 states have call predecessors, (22), 1 states have call successors, (22) Word has length 155 [2022-07-12 17:10:51,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:10:51,681 INFO L225 Difference]: With dead ends: 2225 [2022-07-12 17:10:51,681 INFO L226 Difference]: Without dead ends: 2223 [2022-07-12 17:10:51,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 17:10:51,682 INFO L413 NwaCegarLoop]: 2925 mSDtfsCounter, 27 mSDsluCounter, 8750 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 11675 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 17:10:51,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 11675 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 17:10:51,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2223 states. [2022-07-12 17:10:51,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2223 to 2223. [2022-07-12 17:10:51,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2223 states, 1507 states have (on average 1.2760451227604512) internal successors, (1923), 1578 states have internal predecessors, (1923), 564 states have call successors, (564), 140 states have call predecessors, (564), 139 states have return successors, (562), 530 states have call predecessors, (562), 562 states have call successors, (562) [2022-07-12 17:10:51,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 2223 states and 3049 transitions. [2022-07-12 17:10:51,786 INFO L78 Accepts]: Start accepts. Automaton has 2223 states and 3049 transitions. Word has length 155 [2022-07-12 17:10:51,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:10:51,787 INFO L495 AbstractCegarLoop]: Abstraction has 2223 states and 3049 transitions. [2022-07-12 17:10:51,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 2 states have call predecessors, (22), 1 states have call successors, (22) [2022-07-12 17:10:51,787 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 3049 transitions. [2022-07-12 17:10:51,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-12 17:10:51,788 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:10:51,788 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:10:51,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-12 17:10:52,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:10:52,003 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:10:52,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:10:52,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1184548556, now seen corresponding path program 1 times [2022-07-12 17:10:52,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:10:52,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [426570872] [2022-07-12 17:10:52,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:10:52,005 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:10:52,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:10:52,006 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:10:52,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-12 17:10:52,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:52,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 996 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 17:10:52,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:10:53,174 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 17:10:53,174 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:10:53,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:10:53,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [426570872] [2022-07-12 17:10:53,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [426570872] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:10:53,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:10:53,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 17:10:53,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4773286] [2022-07-12 17:10:53,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:10:53,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 17:10:53,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:10:53,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 17:10:53,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 17:10:53,176 INFO L87 Difference]: Start difference. First operand 2223 states and 3049 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2022-07-12 17:10:53,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:10:53,275 INFO L93 Difference]: Finished difference Result 2223 states and 3049 transitions. [2022-07-12 17:10:53,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 17:10:53,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 141 [2022-07-12 17:10:53,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:10:53,280 INFO L225 Difference]: With dead ends: 2223 [2022-07-12 17:10:53,280 INFO L226 Difference]: Without dead ends: 2221 [2022-07-12 17:10:53,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 17:10:53,281 INFO L413 NwaCegarLoop]: 2922 mSDtfsCounter, 2793 mSDsluCounter, 2920 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2795 SdHoareTripleChecker+Valid, 5842 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:10:53,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2795 Valid, 5842 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 17:10:53,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2221 states. [2022-07-12 17:10:53,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2221 to 2221. [2022-07-12 17:10:53,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2221 states, 1506 states have (on average 1.2749003984063745) internal successors, (1920), 1576 states have internal predecessors, (1920), 564 states have call successors, (564), 140 states have call predecessors, (564), 139 states have return successors, (562), 530 states have call predecessors, (562), 562 states have call successors, (562) [2022-07-12 17:10:53,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2221 states to 2221 states and 3046 transitions. [2022-07-12 17:10:53,373 INFO L78 Accepts]: Start accepts. Automaton has 2221 states and 3046 transitions. Word has length 141 [2022-07-12 17:10:53,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:10:53,374 INFO L495 AbstractCegarLoop]: Abstraction has 2221 states and 3046 transitions. [2022-07-12 17:10:53,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2022-07-12 17:10:53,374 INFO L276 IsEmpty]: Start isEmpty. Operand 2221 states and 3046 transitions. [2022-07-12 17:10:53,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-12 17:10:53,375 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:10:53,375 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:10:53,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Ended with exit code 0 [2022-07-12 17:10:53,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:10:53,591 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:10:53,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:10:53,591 INFO L85 PathProgramCache]: Analyzing trace with hash 2065504485, now seen corresponding path program 1 times [2022-07-12 17:10:53,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:10:53,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2134106879] [2022-07-12 17:10:53,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:10:53,592 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:10:53,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:10:53,593 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:10:53,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-12 17:10:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:54,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 1005 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 17:10:54,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:10:54,854 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 17:10:54,854 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:10:54,855 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:10:54,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2134106879] [2022-07-12 17:10:54,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2134106879] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:10:54,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:10:54,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 17:10:54,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955845861] [2022-07-12 17:10:54,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:10:54,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 17:10:54,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:10:54,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 17:10:54,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 17:10:54,856 INFO L87 Difference]: Start difference. First operand 2221 states and 3046 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2022-07-12 17:10:54,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:10:54,958 INFO L93 Difference]: Finished difference Result 2221 states and 3046 transitions. [2022-07-12 17:10:54,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 17:10:54,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 147 [2022-07-12 17:10:54,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:10:54,963 INFO L225 Difference]: With dead ends: 2221 [2022-07-12 17:10:54,964 INFO L226 Difference]: Without dead ends: 2219 [2022-07-12 17:10:54,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 17:10:54,965 INFO L413 NwaCegarLoop]: 2920 mSDtfsCounter, 2785 mSDsluCounter, 2918 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2787 SdHoareTripleChecker+Valid, 5838 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:10:54,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2787 Valid, 5838 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 17:10:54,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2219 states. [2022-07-12 17:10:55,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2219 to 2219. [2022-07-12 17:10:55,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2219 states, 1505 states have (on average 1.2737541528239202) internal successors, (1917), 1574 states have internal predecessors, (1917), 564 states have call successors, (564), 140 states have call predecessors, (564), 139 states have return successors, (562), 530 states have call predecessors, (562), 562 states have call successors, (562) [2022-07-12 17:10:55,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2219 states to 2219 states and 3043 transitions. [2022-07-12 17:10:55,075 INFO L78 Accepts]: Start accepts. Automaton has 2219 states and 3043 transitions. Word has length 147 [2022-07-12 17:10:55,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:10:55,076 INFO L495 AbstractCegarLoop]: Abstraction has 2219 states and 3043 transitions. [2022-07-12 17:10:55,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2022-07-12 17:10:55,076 INFO L276 IsEmpty]: Start isEmpty. Operand 2219 states and 3043 transitions. [2022-07-12 17:10:55,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-12 17:10:55,078 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:10:55,078 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:10:55,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-07-12 17:10:55,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:10:55,294 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:10:55,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:10:55,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1212186328, now seen corresponding path program 1 times [2022-07-12 17:10:55,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:10:55,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2091883874] [2022-07-12 17:10:55,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:10:55,295 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:10:55,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:10:55,297 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:10:55,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-07-12 17:10:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 1014 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 17:10:55,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:10:56,563 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 17:10:56,563 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:10:56,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:10:56,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2091883874] [2022-07-12 17:10:56,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2091883874] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:10:56,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:10:56,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 17:10:56,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100584766] [2022-07-12 17:10:56,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:10:56,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 17:10:56,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:10:56,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 17:10:56,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 17:10:56,565 INFO L87 Difference]: Start difference. First operand 2219 states and 3043 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2022-07-12 17:10:56,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:10:56,667 INFO L93 Difference]: Finished difference Result 2219 states and 3043 transitions. [2022-07-12 17:10:56,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 17:10:56,668 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 153 [2022-07-12 17:10:56,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:10:56,672 INFO L225 Difference]: With dead ends: 2219 [2022-07-12 17:10:56,672 INFO L226 Difference]: Without dead ends: 2217 [2022-07-12 17:10:56,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 17:10:56,673 INFO L413 NwaCegarLoop]: 2918 mSDtfsCounter, 2777 mSDsluCounter, 2916 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2779 SdHoareTripleChecker+Valid, 5834 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:10:56,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2779 Valid, 5834 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 17:10:56,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2217 states. [2022-07-12 17:10:56,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2217 to 2217. [2022-07-12 17:10:56,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2217 states, 1504 states have (on average 1.2726063829787233) internal successors, (1914), 1572 states have internal predecessors, (1914), 564 states have call successors, (564), 140 states have call predecessors, (564), 139 states have return successors, (562), 530 states have call predecessors, (562), 562 states have call successors, (562) [2022-07-12 17:10:56,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 2217 states and 3040 transitions. [2022-07-12 17:10:56,773 INFO L78 Accepts]: Start accepts. Automaton has 2217 states and 3040 transitions. Word has length 153 [2022-07-12 17:10:56,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:10:56,774 INFO L495 AbstractCegarLoop]: Abstraction has 2217 states and 3040 transitions. [2022-07-12 17:10:56,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2022-07-12 17:10:56,774 INFO L276 IsEmpty]: Start isEmpty. Operand 2217 states and 3040 transitions. [2022-07-12 17:10:56,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-07-12 17:10:56,775 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:10:56,775 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:10:56,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-07-12 17:10:56,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:10:56,993 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:10:56,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:10:56,994 INFO L85 PathProgramCache]: Analyzing trace with hash 903145121, now seen corresponding path program 1 times [2022-07-12 17:10:56,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:10:56,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1438346139] [2022-07-12 17:10:56,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:10:56,995 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:10:56,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:10:56,996 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:10:56,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-07-12 17:10:57,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:57,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 1023 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 17:10:57,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:10:58,319 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 17:10:58,319 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:10:58,320 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:10:58,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1438346139] [2022-07-12 17:10:58,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1438346139] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:10:58,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:10:58,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 17:10:58,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33934432] [2022-07-12 17:10:58,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:10:58,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 17:10:58,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:10:58,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 17:10:58,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 17:10:58,322 INFO L87 Difference]: Start difference. First operand 2217 states and 3040 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2022-07-12 17:10:58,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:10:58,435 INFO L93 Difference]: Finished difference Result 2217 states and 3040 transitions. [2022-07-12 17:10:58,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 17:10:58,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 159 [2022-07-12 17:10:58,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:10:58,440 INFO L225 Difference]: With dead ends: 2217 [2022-07-12 17:10:58,440 INFO L226 Difference]: Without dead ends: 2215 [2022-07-12 17:10:58,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 17:10:58,441 INFO L413 NwaCegarLoop]: 2916 mSDtfsCounter, 2769 mSDsluCounter, 2914 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2771 SdHoareTripleChecker+Valid, 5830 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:10:58,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2771 Valid, 5830 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 17:10:58,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2022-07-12 17:10:58,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 2215. [2022-07-12 17:10:58,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2215 states, 1503 states have (on average 1.2714570858283434) internal successors, (1911), 1570 states have internal predecessors, (1911), 564 states have call successors, (564), 140 states have call predecessors, (564), 139 states have return successors, (562), 530 states have call predecessors, (562), 562 states have call successors, (562) [2022-07-12 17:10:58,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2215 states to 2215 states and 3037 transitions. [2022-07-12 17:10:58,547 INFO L78 Accepts]: Start accepts. Automaton has 2215 states and 3037 transitions. Word has length 159 [2022-07-12 17:10:58,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:10:58,547 INFO L495 AbstractCegarLoop]: Abstraction has 2215 states and 3037 transitions. [2022-07-12 17:10:58,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2022-07-12 17:10:58,547 INFO L276 IsEmpty]: Start isEmpty. Operand 2215 states and 3037 transitions. [2022-07-12 17:10:58,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-07-12 17:10:58,548 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:10:58,549 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:10:58,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-07-12 17:10:58,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:10:58,759 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:10:58,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:10:58,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1741248427, now seen corresponding path program 1 times [2022-07-12 17:10:58,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:10:58,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [364967995] [2022-07-12 17:10:58,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:10:58,761 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:10:58,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:10:58,762 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:10:58,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-07-12 17:10:59,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:59,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 1032 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 17:10:59,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:11:00,107 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 17:11:00,107 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:11:00,108 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:11:00,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [364967995] [2022-07-12 17:11:00,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [364967995] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:11:00,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:11:00,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 17:11:00,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819882277] [2022-07-12 17:11:00,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:11:00,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 17:11:00,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:11:00,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 17:11:00,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 17:11:00,109 INFO L87 Difference]: Start difference. First operand 2215 states and 3037 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2022-07-12 17:11:00,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:11:00,235 INFO L93 Difference]: Finished difference Result 2215 states and 3037 transitions. [2022-07-12 17:11:00,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 17:11:00,235 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 165 [2022-07-12 17:11:00,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:11:00,239 INFO L225 Difference]: With dead ends: 2215 [2022-07-12 17:11:00,239 INFO L226 Difference]: Without dead ends: 2213 [2022-07-12 17:11:00,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 17:11:00,240 INFO L413 NwaCegarLoop]: 2914 mSDtfsCounter, 2761 mSDsluCounter, 2912 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2763 SdHoareTripleChecker+Valid, 5826 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:11:00,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2763 Valid, 5826 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 17:11:00,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2213 states. [2022-07-12 17:11:00,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2213 to 2213. [2022-07-12 17:11:00,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2213 states, 1502 states have (on average 1.270306258322237) internal successors, (1908), 1568 states have internal predecessors, (1908), 564 states have call successors, (564), 140 states have call predecessors, (564), 139 states have return successors, (562), 530 states have call predecessors, (562), 562 states have call successors, (562) [2022-07-12 17:11:00,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2213 states to 2213 states and 3034 transitions. [2022-07-12 17:11:00,338 INFO L78 Accepts]: Start accepts. Automaton has 2213 states and 3034 transitions. Word has length 165 [2022-07-12 17:11:00,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:11:00,339 INFO L495 AbstractCegarLoop]: Abstraction has 2213 states and 3034 transitions. [2022-07-12 17:11:00,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2022-07-12 17:11:00,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2213 states and 3034 transitions. [2022-07-12 17:11:00,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-07-12 17:11:00,341 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:11:00,341 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:11:00,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Ended with exit code 0 [2022-07-12 17:11:00,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:11:00,545 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:11:00,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:11:00,546 INFO L85 PathProgramCache]: Analyzing trace with hash 565245805, now seen corresponding path program 1 times [2022-07-12 17:11:00,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:11:00,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [220993586] [2022-07-12 17:11:00,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:00,547 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:11:00,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:11:00,548 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:11:00,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-07-12 17:11:01,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:01,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 17:11:01,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:11:01,826 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 17:11:01,826 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:11:01,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:11:01,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [220993586] [2022-07-12 17:11:01,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [220993586] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:11:01,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:11:01,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 17:11:01,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526652054] [2022-07-12 17:11:01,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:11:01,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 17:11:01,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:11:01,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 17:11:01,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 17:11:01,828 INFO L87 Difference]: Start difference. First operand 2213 states and 3034 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 3 states have internal predecessors, (110), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2022-07-12 17:11:01,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:11:01,952 INFO L93 Difference]: Finished difference Result 2213 states and 3034 transitions. [2022-07-12 17:11:01,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 17:11:01,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 3 states have internal predecessors, (110), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2022-07-12 17:11:01,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:11:01,956 INFO L225 Difference]: With dead ends: 2213 [2022-07-12 17:11:01,956 INFO L226 Difference]: Without dead ends: 2211 [2022-07-12 17:11:01,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 17:11:01,956 INFO L413 NwaCegarLoop]: 2912 mSDtfsCounter, 2753 mSDsluCounter, 2910 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2755 SdHoareTripleChecker+Valid, 5822 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:11:01,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2755 Valid, 5822 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 17:11:01,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2211 states. [2022-07-12 17:11:02,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2211 to 2211. [2022-07-12 17:11:02,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2211 states, 1501 states have (on average 1.2691538974017322) internal successors, (1905), 1566 states have internal predecessors, (1905), 564 states have call successors, (564), 140 states have call predecessors, (564), 139 states have return successors, (562), 530 states have call predecessors, (562), 562 states have call successors, (562) [2022-07-12 17:11:02,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2211 states to 2211 states and 3031 transitions. [2022-07-12 17:11:02,054 INFO L78 Accepts]: Start accepts. Automaton has 2211 states and 3031 transitions. Word has length 171 [2022-07-12 17:11:02,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:11:02,055 INFO L495 AbstractCegarLoop]: Abstraction has 2211 states and 3031 transitions. [2022-07-12 17:11:02,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 3 states have internal predecessors, (110), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2022-07-12 17:11:02,055 INFO L276 IsEmpty]: Start isEmpty. Operand 2211 states and 3031 transitions. [2022-07-12 17:11:02,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-07-12 17:11:02,057 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:11:02,057 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:11:02,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Ended with exit code 0 [2022-07-12 17:11:02,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:11:02,257 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:11:02,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:11:02,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1132240358, now seen corresponding path program 1 times [2022-07-12 17:11:02,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:11:02,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [382806738] [2022-07-12 17:11:02,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:02,259 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:11:02,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:11:02,260 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:11:02,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-07-12 17:11:03,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:03,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 1310 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-12 17:11:03,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:11:03,594 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2022-07-12 17:11:03,594 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:11:03,595 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:11:03,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [382806738] [2022-07-12 17:11:03,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [382806738] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:11:03,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:11:03,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-12 17:11:03,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486130438] [2022-07-12 17:11:03,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:11:03,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 17:11:03,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:11:03,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 17:11:03,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2022-07-12 17:11:03,596 INFO L87 Difference]: Start difference. First operand 2211 states and 3031 transitions. Second operand has 15 states, 14 states have (on average 6.571428571428571) internal successors, (92), 13 states have internal predecessors, (92), 6 states have call successors, (30), 2 states have call predecessors, (30), 5 states have return successors, (27), 7 states have call predecessors, (27), 6 states have call successors, (27) [2022-07-12 17:11:06,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:11:06,275 INFO L93 Difference]: Finished difference Result 5071 states and 7087 transitions. [2022-07-12 17:11:06,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 17:11:06,276 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 6.571428571428571) internal successors, (92), 13 states have internal predecessors, (92), 6 states have call successors, (30), 2 states have call predecessors, (30), 5 states have return successors, (27), 7 states have call predecessors, (27), 6 states have call successors, (27) Word has length 187 [2022-07-12 17:11:06,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:11:06,281 INFO L225 Difference]: With dead ends: 5071 [2022-07-12 17:11:06,281 INFO L226 Difference]: Without dead ends: 2898 [2022-07-12 17:11:06,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2022-07-12 17:11:06,286 INFO L413 NwaCegarLoop]: 3936 mSDtfsCounter, 3481 mSDsluCounter, 45630 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 1303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3691 SdHoareTripleChecker+Valid, 49566 SdHoareTripleChecker+Invalid, 1935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1303 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-12 17:11:06,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3691 Valid, 49566 Invalid, 1935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1303 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-12 17:11:06,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2022-07-12 17:11:06,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2228. [2022-07-12 17:11:06,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2228 states, 1513 states have (on average 1.2670191672174487) internal successors, (1917), 1578 states have internal predecessors, (1917), 568 states have call successors, (568), 140 states have call predecessors, (568), 140 states have return successors, (568), 535 states have call predecessors, (568), 566 states have call successors, (568) [2022-07-12 17:11:06,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 3053 transitions. [2022-07-12 17:11:06,415 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 3053 transitions. Word has length 187 [2022-07-12 17:11:06,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:11:06,415 INFO L495 AbstractCegarLoop]: Abstraction has 2228 states and 3053 transitions. [2022-07-12 17:11:06,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 6.571428571428571) internal successors, (92), 13 states have internal predecessors, (92), 6 states have call successors, (30), 2 states have call predecessors, (30), 5 states have return successors, (27), 7 states have call predecessors, (27), 6 states have call successors, (27) [2022-07-12 17:11:06,416 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 3053 transitions. [2022-07-12 17:11:06,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-07-12 17:11:06,417 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:11:06,417 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:11:06,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-07-12 17:11:06,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:11:06,631 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_linux_usb_urb_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:11:06,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:11:06,632 INFO L85 PathProgramCache]: Analyzing trace with hash -307449643, now seen corresponding path program 1 times [2022-07-12 17:11:06,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:11:06,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [107397360] [2022-07-12 17:11:06,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:06,633 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:11:06,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:11:06,634 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:11:06,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-07-12 17:11:07,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:07,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 1050 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 17:11:07,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:11:07,924 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 17:11:07,926 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:11:07,926 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:11:07,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [107397360] [2022-07-12 17:11:07,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [107397360] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:11:07,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:11:07,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 17:11:07,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405304471] [2022-07-12 17:11:07,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:11:07,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 17:11:07,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:11:07,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 17:11:07,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 17:11:07,927 INFO L87 Difference]: Start difference. First operand 2228 states and 3053 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2022-07-12 17:11:08,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:11:08,112 INFO L93 Difference]: Finished difference Result 2228 states and 3053 transitions. [2022-07-12 17:11:08,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 17:11:08,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 177 [2022-07-12 17:11:08,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:11:08,116 INFO L225 Difference]: With dead ends: 2228 [2022-07-12 17:11:08,116 INFO L226 Difference]: Without dead ends: 1908 [2022-07-12 17:11:08,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 17:11:08,117 INFO L413 NwaCegarLoop]: 2911 mSDtfsCounter, 2744 mSDsluCounter, 2911 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2744 SdHoareTripleChecker+Valid, 5822 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:11:08,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2744 Valid, 5822 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 17:11:08,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1908 states. [2022-07-12 17:11:08,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1908 to 1908. [2022-07-12 17:11:08,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1908 states, 1291 states have (on average 1.3051897753679318) internal successors, (1685), 1353 states have internal predecessors, (1685), 512 states have call successors, (512), 98 states have call predecessors, (512), 99 states have return successors, (514), 481 states have call predecessors, (514), 512 states have call successors, (514) [2022-07-12 17:11:08,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1908 states to 1908 states and 2711 transitions. [2022-07-12 17:11:08,221 INFO L78 Accepts]: Start accepts. Automaton has 1908 states and 2711 transitions. Word has length 177 [2022-07-12 17:11:08,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:11:08,221 INFO L495 AbstractCegarLoop]: Abstraction has 1908 states and 2711 transitions. [2022-07-12 17:11:08,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2022-07-12 17:11:08,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1908 states and 2711 transitions. [2022-07-12 17:11:08,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-07-12 17:11:08,222 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:11:08,222 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:11:08,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Ended with exit code 0 [2022-07-12 17:11:08,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:11:08,423 INFO L420 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_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:11:08,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:11:08,423 INFO L85 PathProgramCache]: Analyzing trace with hash 695055497, now seen corresponding path program 1 times [2022-07-12 17:11:08,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:11:08,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2103389961] [2022-07-12 17:11:08,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:08,424 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:11:08,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:11:08,425 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:11:08,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-07-12 17:11:09,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:09,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 1578 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 17:11:09,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:11:09,530 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-07-12 17:11:09,530 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:11:09,530 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:11:09,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2103389961] [2022-07-12 17:11:09,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2103389961] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:11:09,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:11:09,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:11:09,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690824418] [2022-07-12 17:11:09,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:11:09,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:11:09,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:11:09,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:11:09,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:11:09,531 INFO L87 Difference]: Start difference. First operand 1908 states and 2711 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (30), 3 states have call predecessors, (30), 2 states have call successors, (30) [2022-07-12 17:11:09,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:11:09,796 INFO L93 Difference]: Finished difference Result 3802 states and 5428 transitions. [2022-07-12 17:11:09,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 17:11:09,796 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (30), 3 states have call predecessors, (30), 2 states have call successors, (30) Word has length 199 [2022-07-12 17:11:09,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:11:09,802 INFO L225 Difference]: With dead ends: 3802 [2022-07-12 17:11:09,802 INFO L226 Difference]: Without dead ends: 1917 [2022-07-12 17:11:09,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 17:11:09,807 INFO L413 NwaCegarLoop]: 2679 mSDtfsCounter, 7 mSDsluCounter, 10701 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 13380 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 17:11:09,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 13380 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 17:11:09,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2022-07-12 17:11:09,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1913. [2022-07-12 17:11:09,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1913 states, 1295 states have (on average 1.3042471042471042) internal successors, (1689), 1357 states have internal predecessors, (1689), 512 states have call successors, (512), 98 states have call predecessors, (512), 100 states have return successors, (516), 482 states have call predecessors, (516), 512 states have call successors, (516) [2022-07-12 17:11:09,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1913 states to 1913 states and 2717 transitions. [2022-07-12 17:11:09,907 INFO L78 Accepts]: Start accepts. Automaton has 1913 states and 2717 transitions. Word has length 199 [2022-07-12 17:11:09,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:11:09,907 INFO L495 AbstractCegarLoop]: Abstraction has 1913 states and 2717 transitions. [2022-07-12 17:11:09,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (30), 3 states have call predecessors, (30), 2 states have call successors, (30) [2022-07-12 17:11:09,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1913 states and 2717 transitions. [2022-07-12 17:11:09,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-07-12 17:11:09,909 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:11:09,909 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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] [2022-07-12 17:11:09,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Ended with exit code 0 [2022-07-12 17:11:10,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:11:10,123 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:11:10,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:11:10,124 INFO L85 PathProgramCache]: Analyzing trace with hash -326700578, now seen corresponding path program 1 times [2022-07-12 17:11:10,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:11:10,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1051817352] [2022-07-12 17:11:10,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:10,125 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:11:10,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:11:10,125 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:11:10,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-07-12 17:11:10,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:11,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 1400 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 17:11:11,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:11:11,940 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 681 trivial. 0 not checked. [2022-07-12 17:11:11,940 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:11:11,941 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:11:11,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1051817352] [2022-07-12 17:11:11,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1051817352] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:11:11,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:11:11,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 17:11:11,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252075233] [2022-07-12 17:11:11,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:11:11,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 17:11:11,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:11:11,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 17:11:11,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 17:11:11,942 INFO L87 Difference]: Start difference. First operand 1913 states and 2717 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2022-07-12 17:11:12,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:11:12,151 INFO L93 Difference]: Finished difference Result 2398 states and 3383 transitions. [2022-07-12 17:11:12,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 17:11:12,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 253 [2022-07-12 17:11:12,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:11:12,157 INFO L225 Difference]: With dead ends: 2398 [2022-07-12 17:11:12,157 INFO L226 Difference]: Without dead ends: 2396 [2022-07-12 17:11:12,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 17:11:12,158 INFO L413 NwaCegarLoop]: 2873 mSDtfsCounter, 1971 mSDsluCounter, 6965 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1972 SdHoareTripleChecker+Valid, 9838 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:11:12,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1972 Valid, 9838 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 17:11:12,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2022-07-12 17:11:12,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 2386. [2022-07-12 17:11:12,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2386 states, 1583 states have (on average 1.2905874921036007) internal successors, (2043), 1682 states have internal predecessors, (2043), 639 states have call successors, (639), 157 states have call predecessors, (639), 158 states have return successors, (693), 581 states have call predecessors, (693), 639 states have call successors, (693) [2022-07-12 17:11:12,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2386 states to 2386 states and 3375 transitions. [2022-07-12 17:11:12,282 INFO L78 Accepts]: Start accepts. Automaton has 2386 states and 3375 transitions. Word has length 253 [2022-07-12 17:11:12,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:11:12,283 INFO L495 AbstractCegarLoop]: Abstraction has 2386 states and 3375 transitions. [2022-07-12 17:11:12,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2022-07-12 17:11:12,283 INFO L276 IsEmpty]: Start isEmpty. Operand 2386 states and 3375 transitions. [2022-07-12 17:11:12,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2022-07-12 17:11:12,284 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:11:12,285 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2022-07-12 17:11:12,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2022-07-12 17:11:12,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:11:12,503 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:11:12,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:11:12,504 INFO L85 PathProgramCache]: Analyzing trace with hash 823108487, now seen corresponding path program 1 times [2022-07-12 17:11:12,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:11:12,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [53471517] [2022-07-12 17:11:12,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:12,505 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:11:12,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:11:12,506 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:11:12,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-07-12 17:11:13,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:13,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 1486 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-12 17:11:13,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:11:13,752 INFO L134 CoverageAnalysis]: Checked inductivity of 851 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2022-07-12 17:11:13,752 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:11:13,752 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:11:13,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [53471517] [2022-07-12 17:11:13,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [53471517] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:11:13,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:11:13,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-12 17:11:13,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779621795] [2022-07-12 17:11:13,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:11:13,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 17:11:13,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:11:13,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 17:11:13,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-07-12 17:11:13,754 INFO L87 Difference]: Start difference. First operand 2386 states and 3375 transitions. Second operand has 13 states, 12 states have (on average 7.916666666666667) internal successors, (95), 11 states have internal predecessors, (95), 5 states have call successors, (36), 2 states have call predecessors, (36), 5 states have return successors, (33), 6 states have call predecessors, (33), 5 states have call successors, (33) [2022-07-12 17:11:14,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:11:14,946 INFO L93 Difference]: Finished difference Result 4314 states and 6114 transitions. [2022-07-12 17:11:14,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 17:11:14,947 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.916666666666667) internal successors, (95), 11 states have internal predecessors, (95), 5 states have call successors, (36), 2 states have call predecessors, (36), 5 states have return successors, (33), 6 states have call predecessors, (33), 5 states have call successors, (33) Word has length 284 [2022-07-12 17:11:14,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:11:14,952 INFO L225 Difference]: With dead ends: 4314 [2022-07-12 17:11:14,953 INFO L226 Difference]: Without dead ends: 2407 [2022-07-12 17:11:14,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2022-07-12 17:11:14,957 INFO L413 NwaCegarLoop]: 2670 mSDtfsCounter, 26 mSDsluCounter, 29240 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 31910 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 17:11:14,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 31910 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-12 17:11:14,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2407 states. [2022-07-12 17:11:15,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2407 to 2396. [2022-07-12 17:11:15,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2396 states, 1590 states have (on average 1.2893081761006289) internal successors, (2050), 1689 states have internal predecessors, (2050), 641 states have call successors, (641), 157 states have call predecessors, (641), 159 states have return successors, (697), 584 states have call predecessors, (697), 641 states have call successors, (697) [2022-07-12 17:11:15,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2396 states to 2396 states and 3388 transitions. [2022-07-12 17:11:15,080 INFO L78 Accepts]: Start accepts. Automaton has 2396 states and 3388 transitions. Word has length 284 [2022-07-12 17:11:15,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:11:15,080 INFO L495 AbstractCegarLoop]: Abstraction has 2396 states and 3388 transitions. [2022-07-12 17:11:15,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.916666666666667) internal successors, (95), 11 states have internal predecessors, (95), 5 states have call successors, (36), 2 states have call predecessors, (36), 5 states have return successors, (33), 6 states have call predecessors, (33), 5 states have call successors, (33) [2022-07-12 17:11:15,081 INFO L276 IsEmpty]: Start isEmpty. Operand 2396 states and 3388 transitions. [2022-07-12 17:11:15,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2022-07-12 17:11:15,082 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:11:15,082 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2022-07-12 17:11:15,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2022-07-12 17:11:15,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:11:15,303 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:11:15,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:11:15,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1257353576, now seen corresponding path program 1 times [2022-07-12 17:11:15,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:11:15,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [267445692] [2022-07-12 17:11:15,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:15,305 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:11:15,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:11:15,306 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:11:15,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2022-07-12 17:11:16,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:16,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 1488 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-12 17:11:16,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:11:16,529 INFO L134 CoverageAnalysis]: Checked inductivity of 851 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2022-07-12 17:11:16,529 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:11:16,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:11:16,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [267445692] [2022-07-12 17:11:16,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [267445692] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:11:16,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:11:16,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-12 17:11:16,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328287356] [2022-07-12 17:11:16,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:11:16,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 17:11:16,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:11:16,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 17:11:16,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-07-12 17:11:16,530 INFO L87 Difference]: Start difference. First operand 2396 states and 3388 transitions. Second operand has 13 states, 12 states have (on average 8.0) internal successors, (96), 11 states have internal predecessors, (96), 5 states have call successors, (36), 2 states have call predecessors, (36), 5 states have return successors, (33), 6 states have call predecessors, (33), 5 states have call successors, (33) [2022-07-12 17:11:17,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:11:17,790 INFO L93 Difference]: Finished difference Result 4336 states and 6142 transitions. [2022-07-12 17:11:17,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 17:11:17,791 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.0) internal successors, (96), 11 states have internal predecessors, (96), 5 states have call successors, (36), 2 states have call predecessors, (36), 5 states have return successors, (33), 6 states have call predecessors, (33), 5 states have call successors, (33) Word has length 285 [2022-07-12 17:11:17,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:11:17,797 INFO L225 Difference]: With dead ends: 4336 [2022-07-12 17:11:17,797 INFO L226 Difference]: Without dead ends: 2419 [2022-07-12 17:11:17,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2022-07-12 17:11:17,802 INFO L413 NwaCegarLoop]: 2674 mSDtfsCounter, 26 mSDsluCounter, 29274 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 31948 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 17:11:17,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 31948 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-12 17:11:17,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2022-07-12 17:11:17,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 2396. [2022-07-12 17:11:17,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2396 states, 1590 states have (on average 1.2893081761006289) internal successors, (2050), 1689 states have internal predecessors, (2050), 641 states have call successors, (641), 157 states have call predecessors, (641), 159 states have return successors, (697), 584 states have call predecessors, (697), 641 states have call successors, (697) [2022-07-12 17:11:17,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2396 states to 2396 states and 3388 transitions. [2022-07-12 17:11:17,945 INFO L78 Accepts]: Start accepts. Automaton has 2396 states and 3388 transitions. Word has length 285 [2022-07-12 17:11:17,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:11:17,946 INFO L495 AbstractCegarLoop]: Abstraction has 2396 states and 3388 transitions. [2022-07-12 17:11:17,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.0) internal successors, (96), 11 states have internal predecessors, (96), 5 states have call successors, (36), 2 states have call predecessors, (36), 5 states have return successors, (33), 6 states have call predecessors, (33), 5 states have call successors, (33) [2022-07-12 17:11:17,946 INFO L276 IsEmpty]: Start isEmpty. Operand 2396 states and 3388 transitions. [2022-07-12 17:11:17,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-07-12 17:11:17,947 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:11:17,947 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:11:17,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Ended with exit code 0 [2022-07-12 17:11:18,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:11:18,153 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:11:18,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:11:18,153 INFO L85 PathProgramCache]: Analyzing trace with hash -965057028, now seen corresponding path program 1 times [2022-07-12 17:11:18,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:11:18,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [597699122] [2022-07-12 17:11:18,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:18,155 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:11:18,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:11:18,156 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:11:18,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2022-07-12 17:11:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:19,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 1829 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 17:11:19,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:11:19,483 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-07-12 17:11:19,483 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:11:19,483 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:11:19,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [597699122] [2022-07-12 17:11:19,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [597699122] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:11:19,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:11:19,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 17:11:19,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020655736] [2022-07-12 17:11:19,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:11:19,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 17:11:19,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:11:19,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 17:11:19,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 17:11:19,485 INFO L87 Difference]: Start difference. First operand 2396 states and 3388 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 3 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2022-07-12 17:11:19,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:11:19,736 INFO L93 Difference]: Finished difference Result 4780 states and 6785 transitions. [2022-07-12 17:11:19,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 17:11:19,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 3 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) Word has length 253 [2022-07-12 17:11:19,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:11:19,743 INFO L225 Difference]: With dead ends: 4780 [2022-07-12 17:11:19,743 INFO L226 Difference]: Without dead ends: 2407 [2022-07-12 17:11:19,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 17:11:19,750 INFO L413 NwaCegarLoop]: 2681 mSDtfsCounter, 5 mSDsluCounter, 5348 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 8029 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 17:11:19,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 8029 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 17:11:19,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2407 states. [2022-07-12 17:11:19,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2407 to 2398. [2022-07-12 17:11:19,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2398 states, 1592 states have (on average 1.2889447236180904) internal successors, (2052), 1690 states have internal predecessors, (2052), 641 states have call successors, (641), 157 states have call predecessors, (641), 159 states have return successors, (697), 584 states have call predecessors, (697), 641 states have call successors, (697) [2022-07-12 17:11:19,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2398 states to 2398 states and 3390 transitions. [2022-07-12 17:11:19,897 INFO L78 Accepts]: Start accepts. Automaton has 2398 states and 3390 transitions. Word has length 253 [2022-07-12 17:11:19,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:11:19,897 INFO L495 AbstractCegarLoop]: Abstraction has 2398 states and 3390 transitions. [2022-07-12 17:11:19,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 3 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2022-07-12 17:11:19,898 INFO L276 IsEmpty]: Start isEmpty. Operand 2398 states and 3390 transitions. [2022-07-12 17:11:19,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2022-07-12 17:11:19,899 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:11:19,899 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:11:19,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Ended with exit code 0 [2022-07-12 17:11:20,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:11:20,100 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:11:20,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:11:20,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1034655848, now seen corresponding path program 1 times [2022-07-12 17:11:20,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:11:20,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [247278751] [2022-07-12 17:11:20,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:20,101 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:11:20,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:11:20,103 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:11:20,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2022-07-12 17:11:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:21,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 1604 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 17:11:21,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:11:21,136 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 681 trivial. 0 not checked. [2022-07-12 17:11:21,136 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:11:21,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:11:21,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [247278751] [2022-07-12 17:11:21,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [247278751] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:11:21,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:11:21,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 17:11:21,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189316822] [2022-07-12 17:11:21,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:11:21,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 17:11:21,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:11:21,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 17:11:21,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 17:11:21,137 INFO L87 Difference]: Start difference. First operand 2398 states and 3390 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2022-07-12 17:11:21,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:11:21,387 INFO L93 Difference]: Finished difference Result 4789 states and 6797 transitions. [2022-07-12 17:11:21,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 17:11:21,388 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 293 [2022-07-12 17:11:21,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:11:21,394 INFO L225 Difference]: With dead ends: 4789 [2022-07-12 17:11:21,394 INFO L226 Difference]: Without dead ends: 2414 [2022-07-12 17:11:21,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 17:11:21,400 INFO L413 NwaCegarLoop]: 2683 mSDtfsCounter, 15 mSDsluCounter, 5322 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 8005 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 17:11:21,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 8005 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 17:11:21,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states. [2022-07-12 17:11:21,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 2400. [2022-07-12 17:11:21,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2400 states, 1594 states have (on average 1.288582183186951) internal successors, (2054), 1692 states have internal predecessors, (2054), 641 states have call successors, (641), 157 states have call predecessors, (641), 159 states have return successors, (697), 584 states have call predecessors, (697), 641 states have call successors, (697) [2022-07-12 17:11:21,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2400 states to 2400 states and 3392 transitions. [2022-07-12 17:11:21,562 INFO L78 Accepts]: Start accepts. Automaton has 2400 states and 3392 transitions. Word has length 293 [2022-07-12 17:11:21,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:11:21,562 INFO L495 AbstractCegarLoop]: Abstraction has 2400 states and 3392 transitions. [2022-07-12 17:11:21,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2022-07-12 17:11:21,563 INFO L276 IsEmpty]: Start isEmpty. Operand 2400 states and 3392 transitions. [2022-07-12 17:11:21,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2022-07-12 17:11:21,564 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:11:21,564 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:11:21,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2022-07-12 17:11:21,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:11:21,787 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:11:21,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:11:21,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1408199590, now seen corresponding path program 1 times [2022-07-12 17:11:21,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:11:21,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [10097550] [2022-07-12 17:11:21,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:21,789 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:11:21,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:11:21,790 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:11:21,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2022-07-12 17:11:22,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:22,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 1667 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 17:11:22,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:11:23,082 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 692 trivial. 0 not checked. [2022-07-12 17:11:23,083 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:11:23,083 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:11:23,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [10097550] [2022-07-12 17:11:23,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [10097550] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:11:23,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:11:23,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 17:11:23,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461565042] [2022-07-12 17:11:23,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:11:23,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 17:11:23,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:11:23,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 17:11:23,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 17:11:23,085 INFO L87 Difference]: Start difference. First operand 2400 states and 3392 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (39), 3 states have call predecessors, (39), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-07-12 17:11:23,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:11:23,391 INFO L93 Difference]: Finished difference Result 2416 states and 3403 transitions. [2022-07-12 17:11:23,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 17:11:23,392 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (39), 3 states have call predecessors, (39), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 303 [2022-07-12 17:11:23,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:11:23,397 INFO L225 Difference]: With dead ends: 2416 [2022-07-12 17:11:23,397 INFO L226 Difference]: Without dead ends: 2414 [2022-07-12 17:11:23,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 17:11:23,398 INFO L413 NwaCegarLoop]: 3263 mSDtfsCounter, 1200 mSDsluCounter, 8615 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1201 SdHoareTripleChecker+Valid, 11878 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 17:11:23,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1201 Valid, 11878 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 17:11:23,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states. [2022-07-12 17:11:23,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 2404. [2022-07-12 17:11:23,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2404 states, 1597 states have (on average 1.2880400751408891) internal successors, (2057), 1695 states have internal predecessors, (2057), 641 states have call successors, (641), 158 states have call predecessors, (641), 160 states have return successors, (697), 584 states have call predecessors, (697), 641 states have call successors, (697) [2022-07-12 17:11:23,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2404 states to 2404 states and 3395 transitions. [2022-07-12 17:11:23,523 INFO L78 Accepts]: Start accepts. Automaton has 2404 states and 3395 transitions. Word has length 303 [2022-07-12 17:11:23,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:11:23,523 INFO L495 AbstractCegarLoop]: Abstraction has 2404 states and 3395 transitions. [2022-07-12 17:11:23,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (39), 3 states have call predecessors, (39), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-07-12 17:11:23,524 INFO L276 IsEmpty]: Start isEmpty. Operand 2404 states and 3395 transitions. [2022-07-12 17:11:23,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2022-07-12 17:11:23,526 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:11:23,526 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:11:23,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Ended with exit code 0 [2022-07-12 17:11:23,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:11:23,751 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:11:23,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:11:23,752 INFO L85 PathProgramCache]: Analyzing trace with hash -615065789, now seen corresponding path program 1 times [2022-07-12 17:11:23,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:11:23,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [855567614] [2022-07-12 17:11:23,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:23,753 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:11:23,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:11:23,754 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:11:23,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2022-07-12 17:11:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:25,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 2293 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 17:11:25,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:11:25,531 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2022-07-12 17:11:25,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 17:11:25,809 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2022-07-12 17:11:25,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:11:25,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [855567614] [2022-07-12 17:11:25,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [855567614] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 17:11:25,810 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 17:11:25,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-12 17:11:25,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606387409] [2022-07-12 17:11:25,810 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 17:11:25,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 17:11:25,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:11:25,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 17:11:25,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-12 17:11:25,811 INFO L87 Difference]: Start difference. First operand 2404 states and 3395 transitions. Second operand has 8 states, 8 states have (on average 22.75) internal successors, (182), 8 states have internal predecessors, (182), 6 states have call successors, (72), 2 states have call predecessors, (72), 2 states have return successors, (64), 6 states have call predecessors, (64), 6 states have call successors, (64) [2022-07-12 17:11:26,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:11:26,770 INFO L93 Difference]: Finished difference Result 4815 states and 6828 transitions. [2022-07-12 17:11:26,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:11:26,771 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 22.75) internal successors, (182), 8 states have internal predecessors, (182), 6 states have call successors, (72), 2 states have call predecessors, (72), 2 states have return successors, (64), 6 states have call predecessors, (64), 6 states have call successors, (64) Word has length 316 [2022-07-12 17:11:26,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:11:26,778 INFO L225 Difference]: With dead ends: 4815 [2022-07-12 17:11:26,778 INFO L226 Difference]: Without dead ends: 2434 [2022-07-12 17:11:26,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 633 GetRequests, 624 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-07-12 17:11:26,783 INFO L413 NwaCegarLoop]: 2694 mSDtfsCounter, 31 mSDsluCounter, 10701 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 13395 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 17:11:26,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 13395 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 17:11:26,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states. [2022-07-12 17:11:26,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2434. [2022-07-12 17:11:26,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2434 states, 1615 states have (on average 1.284829721362229) internal successors, (2075), 1713 states have internal predecessors, (2075), 653 states have call successors, (653), 158 states have call predecessors, (653), 160 states have return successors, (709), 596 states have call predecessors, (709), 653 states have call successors, (709) [2022-07-12 17:11:26,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 3437 transitions. [2022-07-12 17:11:26,911 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 3437 transitions. Word has length 316 [2022-07-12 17:11:26,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:11:26,912 INFO L495 AbstractCegarLoop]: Abstraction has 2434 states and 3437 transitions. [2022-07-12 17:11:26,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.75) internal successors, (182), 8 states have internal predecessors, (182), 6 states have call successors, (72), 2 states have call predecessors, (72), 2 states have return successors, (64), 6 states have call predecessors, (64), 6 states have call successors, (64) [2022-07-12 17:11:26,912 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 3437 transitions. [2022-07-12 17:11:26,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2022-07-12 17:11:26,914 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:11:26,914 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:11:26,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Forceful destruction successful, exit code 0 [2022-07-12 17:11:27,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:11:27,143 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:11:27,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:11:27,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1253696816, now seen corresponding path program 1 times [2022-07-12 17:11:27,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:11:27,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [943627427] [2022-07-12 17:11:27,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:27,144 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:11:27,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:11:27,145 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:11:27,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2022-07-12 17:11:28,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:28,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 1810 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-12 17:11:28,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:11:28,708 INFO L134 CoverageAnalysis]: Checked inductivity of 865 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 789 trivial. 0 not checked. [2022-07-12 17:11:28,708 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:11:28,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:11:28,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [943627427] [2022-07-12 17:11:28,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [943627427] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:11:28,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:11:28,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-12 17:11:28,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678737980] [2022-07-12 17:11:28,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:11:28,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 17:11:28,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:11:28,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 17:11:28,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2022-07-12 17:11:28,710 INFO L87 Difference]: Start difference. First operand 2434 states and 3437 transitions. Second operand has 15 states, 14 states have (on average 9.5) internal successors, (133), 13 states have internal predecessors, (133), 6 states have call successors, (48), 2 states have call predecessors, (48), 5 states have return successors, (45), 7 states have call predecessors, (45), 6 states have call successors, (45) [2022-07-12 17:11:30,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:11:30,437 INFO L93 Difference]: Finished difference Result 4402 states and 6230 transitions. [2022-07-12 17:11:30,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-12 17:11:30,438 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 9.5) internal successors, (133), 13 states have internal predecessors, (133), 6 states have call successors, (48), 2 states have call predecessors, (48), 5 states have return successors, (45), 7 states have call predecessors, (45), 6 states have call successors, (45) Word has length 357 [2022-07-12 17:11:30,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:11:30,456 INFO L225 Difference]: With dead ends: 4402 [2022-07-12 17:11:30,456 INFO L226 Difference]: Without dead ends: 2479 [2022-07-12 17:11:30,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2022-07-12 17:11:30,460 INFO L413 NwaCegarLoop]: 2671 mSDtfsCounter, 39 mSDsluCounter, 34548 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 37219 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-12 17:11:30,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 37219 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-12 17:11:30,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2479 states. [2022-07-12 17:11:30,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2479 to 2438. [2022-07-12 17:11:30,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2438 states, 1617 states have (on average 1.2844774273345703) internal successors, (2077), 1715 states have internal predecessors, (2077), 655 states have call successors, (655), 158 states have call predecessors, (655), 160 states have return successors, (711), 598 states have call predecessors, (711), 655 states have call successors, (711) [2022-07-12 17:11:30,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2438 states to 2438 states and 3443 transitions. [2022-07-12 17:11:30,598 INFO L78 Accepts]: Start accepts. Automaton has 2438 states and 3443 transitions. Word has length 357 [2022-07-12 17:11:30,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:11:30,598 INFO L495 AbstractCegarLoop]: Abstraction has 2438 states and 3443 transitions. [2022-07-12 17:11:30,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 9.5) internal successors, (133), 13 states have internal predecessors, (133), 6 states have call successors, (48), 2 states have call predecessors, (48), 5 states have return successors, (45), 7 states have call predecessors, (45), 6 states have call successors, (45) [2022-07-12 17:11:30,599 INFO L276 IsEmpty]: Start isEmpty. Operand 2438 states and 3443 transitions. [2022-07-12 17:11:30,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2022-07-12 17:11:30,601 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:11:30,601 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:11:30,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (40)] Forceful destruction successful, exit code 0 [2022-07-12 17:11:30,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:11:30,815 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:11:30,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:11:30,816 INFO L85 PathProgramCache]: Analyzing trace with hash -233443378, now seen corresponding path program 2 times [2022-07-12 17:11:30,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:11:30,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [296225542] [2022-07-12 17:11:30,817 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 17:11:30,817 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:11:30,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:11:30,819 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:11:30,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2022-07-12 17:11:33,024 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 17:11:33,024 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 17:11:33,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 2944 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 17:11:33,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:11:33,412 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2022-07-12 17:11:33,412 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:11:33,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:11:33,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [296225542] [2022-07-12 17:11:33,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [296225542] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:11:33,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:11:33,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 17:11:33,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646534884] [2022-07-12 17:11:33,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:11:33,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 17:11:33,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:11:33,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 17:11:33,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 17:11:33,414 INFO L87 Difference]: Start difference. First operand 2438 states and 3443 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 3 states have call successors, (55), 2 states have call predecessors, (55), 2 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) [2022-07-12 17:11:35,481 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:11:37,523 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:11:37,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:11:37,643 INFO L93 Difference]: Finished difference Result 4857 states and 6884 transitions. [2022-07-12 17:11:37,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 17:11:37,668 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 3 states have call successors, (55), 2 states have call predecessors, (55), 2 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) Word has length 382 [2022-07-12 17:11:37,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:11:37,676 INFO L225 Difference]: With dead ends: 4857 [2022-07-12 17:11:37,676 INFO L226 Difference]: Without dead ends: 2442 [2022-07-12 17:11:37,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 17:11:37,682 INFO L413 NwaCegarLoop]: 2677 mSDtfsCounter, 2 mSDsluCounter, 5324 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8001 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-07-12 17:11:37,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8001 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 2 Unknown, 0 Unchecked, 4.1s Time] [2022-07-12 17:11:37,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2022-07-12 17:11:37,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2440. [2022-07-12 17:11:37,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2440 states, 1619 states have (on average 1.2841260037059914) internal successors, (2079), 1717 states have internal predecessors, (2079), 655 states have call successors, (655), 158 states have call predecessors, (655), 160 states have return successors, (711), 598 states have call predecessors, (711), 655 states have call successors, (711) [2022-07-12 17:11:37,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2440 states to 2440 states and 3445 transitions. [2022-07-12 17:11:37,833 INFO L78 Accepts]: Start accepts. Automaton has 2440 states and 3445 transitions. Word has length 382 [2022-07-12 17:11:37,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:11:37,834 INFO L495 AbstractCegarLoop]: Abstraction has 2440 states and 3445 transitions. [2022-07-12 17:11:37,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 3 states have call successors, (55), 2 states have call predecessors, (55), 2 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) [2022-07-12 17:11:37,834 INFO L276 IsEmpty]: Start isEmpty. Operand 2440 states and 3445 transitions. [2022-07-12 17:11:37,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2022-07-12 17:11:37,837 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:11:37,837 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:11:37,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (41)] Forceful destruction successful, exit code 0 [2022-07-12 17:11:38,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:11:38,050 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:11:38,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:11:38,050 INFO L85 PathProgramCache]: Analyzing trace with hash 786896037, now seen corresponding path program 1 times [2022-07-12 17:11:38,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:11:38,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1460562089] [2022-07-12 17:11:38,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:38,052 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:11:38,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:11:38,053 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:11:38,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2022-07-12 17:11:40,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:40,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 3020 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 17:11:40,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:11:40,643 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2022-07-12 17:11:40,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 17:11:41,163 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-07-12 17:11:41,163 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:11:41,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1460562089] [2022-07-12 17:11:41,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1460562089] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 17:11:41,164 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 17:11:41,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-12 17:11:41,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456010615] [2022-07-12 17:11:41,164 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 17:11:41,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 17:11:41,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:11:41,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 17:11:41,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-12 17:11:41,165 INFO L87 Difference]: Start difference. First operand 2440 states and 3445 transitions. Second operand has 8 states, 8 states have (on average 22.375) internal successors, (179), 8 states have internal predecessors, (179), 4 states have call successors, (71), 2 states have call predecessors, (71), 2 states have return successors, (63), 4 states have call predecessors, (63), 4 states have call successors, (63) [2022-07-12 17:11:43,362 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:11:45,432 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:11:45,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:11:45,589 INFO L93 Difference]: Finished difference Result 4863 states and 6891 transitions. [2022-07-12 17:11:45,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 17:11:45,590 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 22.375) internal successors, (179), 8 states have internal predecessors, (179), 4 states have call successors, (71), 2 states have call predecessors, (71), 2 states have return successors, (63), 4 states have call predecessors, (63), 4 states have call successors, (63) Word has length 385 [2022-07-12 17:11:45,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:11:45,596 INFO L225 Difference]: With dead ends: 4863 [2022-07-12 17:11:45,596 INFO L226 Difference]: Without dead ends: 2446 [2022-07-12 17:11:45,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 770 GetRequests, 762 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:11:45,601 INFO L413 NwaCegarLoop]: 2675 mSDtfsCounter, 18 mSDsluCounter, 10635 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 16 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 13310 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-12 17:11:45,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 13310 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 32 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-12 17:11:45,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2446 states. [2022-07-12 17:11:45,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2446 to 2446. [2022-07-12 17:11:45,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2446 states, 1625 states have (on average 1.283076923076923) internal successors, (2085), 1723 states have internal predecessors, (2085), 655 states have call successors, (655), 158 states have call predecessors, (655), 160 states have return successors, (711), 598 states have call predecessors, (711), 655 states have call successors, (711) [2022-07-12 17:11:45,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2446 states to 2446 states and 3451 transitions. [2022-07-12 17:11:45,732 INFO L78 Accepts]: Start accepts. Automaton has 2446 states and 3451 transitions. Word has length 385 [2022-07-12 17:11:45,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:11:45,732 INFO L495 AbstractCegarLoop]: Abstraction has 2446 states and 3451 transitions. [2022-07-12 17:11:45,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.375) internal successors, (179), 8 states have internal predecessors, (179), 4 states have call successors, (71), 2 states have call predecessors, (71), 2 states have return successors, (63), 4 states have call predecessors, (63), 4 states have call successors, (63) [2022-07-12 17:11:45,733 INFO L276 IsEmpty]: Start isEmpty. Operand 2446 states and 3451 transitions. [2022-07-12 17:11:45,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2022-07-12 17:11:45,735 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:11:45,735 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:11:45,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (42)] Ended with exit code 0 [2022-07-12 17:11:45,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:11:45,938 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:11:45,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:11:45,938 INFO L85 PathProgramCache]: Analyzing trace with hash -285797371, now seen corresponding path program 2 times [2022-07-12 17:11:45,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:11:45,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [136270771] [2022-07-12 17:11:45,940 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 17:11:45,940 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:11:45,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:11:45,941 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:11:45,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2022-07-12 17:11:48,553 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 17:11:48,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 17:11:48,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 3172 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 17:11:48,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:11:49,132 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2022-07-12 17:11:49,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 17:11:49,742 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-07-12 17:11:49,742 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:11:49,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [136270771] [2022-07-12 17:11:49,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [136270771] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 17:11:49,742 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 17:11:49,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-07-12 17:11:49,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931087866] [2022-07-12 17:11:49,743 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 17:11:49,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 17:11:49,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:11:49,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 17:11:49,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-07-12 17:11:49,744 INFO L87 Difference]: Start difference. First operand 2446 states and 3451 transitions. Second operand has 12 states, 12 states have (on average 15.916666666666666) internal successors, (191), 12 states have internal predecessors, (191), 4 states have call successors, (71), 2 states have call predecessors, (71), 2 states have return successors, (63), 4 states have call predecessors, (63), 4 states have call successors, (63) [2022-07-12 17:11:52,119 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:11:54,193 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:11:56,269 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:11:58,384 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:11:58,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:11:58,731 INFO L93 Difference]: Finished difference Result 4881 states and 6911 transitions. [2022-07-12 17:11:58,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 17:11:58,731 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 15.916666666666666) internal successors, (191), 12 states have internal predecessors, (191), 4 states have call successors, (71), 2 states have call predecessors, (71), 2 states have return successors, (63), 4 states have call predecessors, (63), 4 states have call successors, (63) Word has length 391 [2022-07-12 17:11:58,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:11:58,737 INFO L225 Difference]: With dead ends: 4881 [2022-07-12 17:11:58,737 INFO L226 Difference]: Without dead ends: 2458 [2022-07-12 17:11:58,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 788 GetRequests, 770 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2022-07-12 17:11:58,742 INFO L413 NwaCegarLoop]: 2675 mSDtfsCounter, 46 mSDsluCounter, 18632 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 43 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 21307 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-07-12 17:11:58,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 21307 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 92 Invalid, 4 Unknown, 0 Unchecked, 8.5s Time] [2022-07-12 17:11:58,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2458 states. [2022-07-12 17:11:58,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2458 to 2458. [2022-07-12 17:11:58,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2458 states, 1637 states have (on average 1.2810018326206476) internal successors, (2097), 1735 states have internal predecessors, (2097), 655 states have call successors, (655), 158 states have call predecessors, (655), 160 states have return successors, (711), 598 states have call predecessors, (711), 655 states have call successors, (711) [2022-07-12 17:11:58,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2458 states to 2458 states and 3463 transitions. [2022-07-12 17:11:58,904 INFO L78 Accepts]: Start accepts. Automaton has 2458 states and 3463 transitions. Word has length 391 [2022-07-12 17:11:58,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:11:58,904 INFO L495 AbstractCegarLoop]: Abstraction has 2458 states and 3463 transitions. [2022-07-12 17:11:58,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 15.916666666666666) internal successors, (191), 12 states have internal predecessors, (191), 4 states have call successors, (71), 2 states have call predecessors, (71), 2 states have return successors, (63), 4 states have call predecessors, (63), 4 states have call successors, (63) [2022-07-12 17:11:58,905 INFO L276 IsEmpty]: Start isEmpty. Operand 2458 states and 3463 transitions. [2022-07-12 17:11:58,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2022-07-12 17:11:58,907 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:11:58,907 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:11:58,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (43)] Forceful destruction successful, exit code 0 [2022-07-12 17:11:59,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:11:59,123 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:11:59,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:11:59,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1766718149, now seen corresponding path program 3 times [2022-07-12 17:11:59,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:11:59,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1627667845] [2022-07-12 17:11:59,125 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 17:11:59,126 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:11:59,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:11:59,127 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:11:59,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2022-07-12 17:12:00,489 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-12 17:12:00,489 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 17:12:00,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 1281 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 17:12:00,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:12:00,608 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2022-07-12 17:12:00,608 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:12:00,608 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:12:00,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1627667845] [2022-07-12 17:12:00,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1627667845] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:12:00,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:12:00,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 17:12:00,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552174691] [2022-07-12 17:12:00,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:12:00,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 17:12:00,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:12:00,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 17:12:00,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 17:12:00,610 INFO L87 Difference]: Start difference. First operand 2458 states and 3463 transitions. Second operand has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 2 states have call successors, (55), 2 states have call predecessors, (55), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2022-07-12 17:12:00,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:12:00,853 INFO L93 Difference]: Finished difference Result 4907 states and 7086 transitions. [2022-07-12 17:12:00,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 17:12:00,853 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 2 states have call successors, (55), 2 states have call predecessors, (55), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) Word has length 403 [2022-07-12 17:12:00,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:12:00,860 INFO L225 Difference]: With dead ends: 4907 [2022-07-12 17:12:00,860 INFO L226 Difference]: Without dead ends: 2472 [2022-07-12 17:12:00,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 17:12:00,865 INFO L413 NwaCegarLoop]: 2675 mSDtfsCounter, 10 mSDsluCounter, 8022 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 10697 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 17:12:00,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 10697 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 17:12:00,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2472 states. [2022-07-12 17:12:01,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2472 to 2466. [2022-07-12 17:12:01,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2466 states, 1644 states have (on average 1.2798053527980535) internal successors, (2104), 1743 states have internal predecessors, (2104), 655 states have call successors, (655), 158 states have call predecessors, (655), 161 states have return successors, (712), 598 states have call predecessors, (712), 655 states have call successors, (712) [2022-07-12 17:12:01,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2466 states to 2466 states and 3471 transitions. [2022-07-12 17:12:01,029 INFO L78 Accepts]: Start accepts. Automaton has 2466 states and 3471 transitions. Word has length 403 [2022-07-12 17:12:01,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:12:01,029 INFO L495 AbstractCegarLoop]: Abstraction has 2466 states and 3471 transitions. [2022-07-12 17:12:01,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 2 states have call successors, (55), 2 states have call predecessors, (55), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2022-07-12 17:12:01,030 INFO L276 IsEmpty]: Start isEmpty. Operand 2466 states and 3471 transitions. [2022-07-12 17:12:01,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2022-07-12 17:12:01,032 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:12:01,032 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:12:01,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (44)] Forceful destruction successful, exit code 0 [2022-07-12 17:12:01,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:12:01,237 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:12:01,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:12:01,237 INFO L85 PathProgramCache]: Analyzing trace with hash 745649795, now seen corresponding path program 1 times [2022-07-12 17:12:01,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:12:01,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [315790385] [2022-07-12 17:12:01,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:12:01,239 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:12:01,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:12:01,240 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:12:01,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (45)] Waiting until timeout for monitored process [2022-07-12 17:12:03,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:04,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 3476 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 17:12:04,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:12:04,477 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2022-07-12 17:12:04,478 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:12:04,478 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:12:04,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [315790385] [2022-07-12 17:12:04,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [315790385] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:12:04,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:12:04,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 17:12:04,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538758223] [2022-07-12 17:12:04,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:12:04,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 17:12:04,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:12:04,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 17:12:04,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 17:12:04,479 INFO L87 Difference]: Start difference. First operand 2466 states and 3471 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 3 states have call successors, (55), 2 states have call predecessors, (55), 2 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) [2022-07-12 17:12:04,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:12:04,700 INFO L93 Difference]: Finished difference Result 4913 states and 6940 transitions. [2022-07-12 17:12:04,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 17:12:04,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 3 states have call successors, (55), 2 states have call predecessors, (55), 2 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) Word has length 403 [2022-07-12 17:12:04,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:12:04,706 INFO L225 Difference]: With dead ends: 4913 [2022-07-12 17:12:04,706 INFO L226 Difference]: Without dead ends: 2470 [2022-07-12 17:12:04,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 400 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 17:12:04,711 INFO L413 NwaCegarLoop]: 2677 mSDtfsCounter, 2 mSDsluCounter, 5320 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 7997 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 17:12:04,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 7997 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 17:12:04,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2470 states. [2022-07-12 17:12:04,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2470 to 2468. [2022-07-12 17:12:04,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2468 states, 1646 states have (on average 1.2794653705953827) internal successors, (2106), 1745 states have internal predecessors, (2106), 655 states have call successors, (655), 158 states have call predecessors, (655), 161 states have return successors, (712), 598 states have call predecessors, (712), 655 states have call successors, (712) [2022-07-12 17:12:04,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2468 states to 2468 states and 3473 transitions. [2022-07-12 17:12:04,846 INFO L78 Accepts]: Start accepts. Automaton has 2468 states and 3473 transitions. Word has length 403 [2022-07-12 17:12:04,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:12:04,846 INFO L495 AbstractCegarLoop]: Abstraction has 2468 states and 3473 transitions. [2022-07-12 17:12:04,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 3 states have call successors, (55), 2 states have call predecessors, (55), 2 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) [2022-07-12 17:12:04,847 INFO L276 IsEmpty]: Start isEmpty. Operand 2468 states and 3473 transitions. [2022-07-12 17:12:04,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2022-07-12 17:12:04,849 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:12:04,849 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:12:04,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (45)] Forceful destruction successful, exit code 0 [2022-07-12 17:12:05,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:12:05,063 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:12:05,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:12:05,064 INFO L85 PathProgramCache]: Analyzing trace with hash 293039085, now seen corresponding path program 1 times [2022-07-12 17:12:05,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:12:05,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [900227295] [2022-07-12 17:12:05,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:12:05,066 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:12:05,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:12:05,066 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:12:05,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (46)] Waiting until timeout for monitored process [2022-07-12 17:12:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:07,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 3490 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 17:12:07,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:12:08,411 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2022-07-12 17:12:08,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 17:12:09,122 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2022-07-12 17:12:09,122 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:12:09,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [900227295] [2022-07-12 17:12:09,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [900227295] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 17:12:09,123 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 17:12:09,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-12 17:12:09,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358007562] [2022-07-12 17:12:09,123 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 17:12:09,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 17:12:09,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:12:09,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 17:12:09,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-12 17:12:09,124 INFO L87 Difference]: Start difference. First operand 2468 states and 3473 transitions. Second operand has 8 states, 8 states have (on average 23.125) internal successors, (185), 8 states have internal predecessors, (185), 4 states have call successors, (71), 2 states have call predecessors, (71), 2 states have return successors, (63), 4 states have call predecessors, (63), 4 states have call successors, (63) [2022-07-12 17:12:09,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:12:09,620 INFO L93 Difference]: Finished difference Result 4922 states and 6951 transitions. [2022-07-12 17:12:09,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:12:09,621 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 23.125) internal successors, (185), 8 states have internal predecessors, (185), 4 states have call successors, (71), 2 states have call predecessors, (71), 2 states have return successors, (63), 4 states have call predecessors, (63), 4 states have call successors, (63) Word has length 406 [2022-07-12 17:12:09,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:12:09,627 INFO L225 Difference]: With dead ends: 4922 [2022-07-12 17:12:09,627 INFO L226 Difference]: Without dead ends: 2477 [2022-07-12 17:12:09,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 813 GetRequests, 804 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-07-12 17:12:09,637 INFO L413 NwaCegarLoop]: 2675 mSDtfsCounter, 30 mSDsluCounter, 10627 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 13302 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 17:12:09,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 13302 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 17:12:09,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2477 states. [2022-07-12 17:12:09,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2477 to 2477. [2022-07-12 17:12:09,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2477 states, 1655 states have (on average 1.2779456193353473) internal successors, (2115), 1754 states have internal predecessors, (2115), 655 states have call successors, (655), 158 states have call predecessors, (655), 161 states have return successors, (712), 598 states have call predecessors, (712), 655 states have call successors, (712) [2022-07-12 17:12:09,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2477 states to 2477 states and 3482 transitions. [2022-07-12 17:12:09,782 INFO L78 Accepts]: Start accepts. Automaton has 2477 states and 3482 transitions. Word has length 406 [2022-07-12 17:12:09,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:12:09,783 INFO L495 AbstractCegarLoop]: Abstraction has 2477 states and 3482 transitions. [2022-07-12 17:12:09,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 23.125) internal successors, (185), 8 states have internal predecessors, (185), 4 states have call successors, (71), 2 states have call predecessors, (71), 2 states have return successors, (63), 4 states have call predecessors, (63), 4 states have call successors, (63) [2022-07-12 17:12:09,783 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 3482 transitions. [2022-07-12 17:12:09,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2022-07-12 17:12:09,786 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:12:09,786 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:12:09,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (46)] Forceful destruction successful, exit code 0 [2022-07-12 17:12:09,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:12:09,986 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:12:09,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:12:09,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1522072061, now seen corresponding path program 2 times [2022-07-12 17:12:09,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:12:09,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1913893239] [2022-07-12 17:12:09,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 17:12:09,989 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:12:09,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:12:09,990 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:12:09,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (47)] Waiting until timeout for monitored process [2022-07-12 17:12:13,014 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 17:12:13,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 17:12:13,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 3532 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 17:12:13,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:12:13,769 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 8 proven. 26 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2022-07-12 17:12:13,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 17:12:14,585 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2022-07-12 17:12:14,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:12:14,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1913893239] [2022-07-12 17:12:14,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1913893239] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 17:12:14,586 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 17:12:14,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-07-12 17:12:14,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891546012] [2022-07-12 17:12:14,587 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 17:12:14,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 17:12:14,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:12:14,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 17:12:14,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-07-12 17:12:14,588 INFO L87 Difference]: Start difference. First operand 2477 states and 3482 transitions. Second operand has 14 states, 14 states have (on average 14.5) internal successors, (203), 14 states have internal predecessors, (203), 4 states have call successors, (71), 2 states have call predecessors, (71), 2 states have return successors, (63), 4 states have call predecessors, (63), 4 states have call successors, (63) [2022-07-12 17:12:15,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:12:15,869 INFO L93 Difference]: Finished difference Result 4949 states and 6981 transitions. [2022-07-12 17:12:15,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 17:12:15,870 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 14.5) internal successors, (203), 14 states have internal predecessors, (203), 4 states have call successors, (71), 2 states have call predecessors, (71), 2 states have return successors, (63), 4 states have call predecessors, (63), 4 states have call successors, (63) Word has length 415 [2022-07-12 17:12:15,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:12:15,877 INFO L225 Difference]: With dead ends: 4949 [2022-07-12 17:12:15,878 INFO L226 Difference]: Without dead ends: 2495 [2022-07-12 17:12:15,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 837 GetRequests, 816 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=144, Invalid=362, Unknown=0, NotChecked=0, Total=506 [2022-07-12 17:12:15,884 INFO L413 NwaCegarLoop]: 2675 mSDtfsCounter, 94 mSDsluCounter, 26578 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 29253 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 17:12:15,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 29253 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 17:12:15,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2495 states. [2022-07-12 17:12:16,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2495 to 2495. [2022-07-12 17:12:16,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2495 states, 1673 states have (on average 1.2749551703526598) internal successors, (2133), 1772 states have internal predecessors, (2133), 655 states have call successors, (655), 158 states have call predecessors, (655), 161 states have return successors, (712), 598 states have call predecessors, (712), 655 states have call successors, (712) [2022-07-12 17:12:16,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2495 states and 3500 transitions. [2022-07-12 17:12:16,062 INFO L78 Accepts]: Start accepts. Automaton has 2495 states and 3500 transitions. Word has length 415 [2022-07-12 17:12:16,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:12:16,062 INFO L495 AbstractCegarLoop]: Abstraction has 2495 states and 3500 transitions. [2022-07-12 17:12:16,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 14.5) internal successors, (203), 14 states have internal predecessors, (203), 4 states have call successors, (71), 2 states have call predecessors, (71), 2 states have return successors, (63), 4 states have call predecessors, (63), 4 states have call successors, (63) [2022-07-12 17:12:16,062 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 3500 transitions. [2022-07-12 17:12:16,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2022-07-12 17:12:16,065 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:12:16,065 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:12:16,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (47)] Forceful destruction successful, exit code 0 [2022-07-12 17:12:16,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:12:16,272 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:12:16,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:12:16,273 INFO L85 PathProgramCache]: Analyzing trace with hash 540403011, now seen corresponding path program 3 times [2022-07-12 17:12:16,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:12:16,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1877747330] [2022-07-12 17:12:16,275 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 17:12:16,275 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:12:16,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:12:16,276 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:12:16,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (48)] Waiting until timeout for monitored process [2022-07-12 17:12:17,874 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-12 17:12:17,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 17:12:17,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 1281 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 17:12:17,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:12:18,103 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 596 trivial. 0 not checked. [2022-07-12 17:12:18,103 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:12:18,104 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:12:18,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1877747330] [2022-07-12 17:12:18,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1877747330] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:12:18,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:12:18,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 17:12:18,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038828979] [2022-07-12 17:12:18,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:12:18,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 17:12:18,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:12:18,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 17:12:18,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 17:12:18,105 INFO L87 Difference]: Start difference. First operand 2495 states and 3500 transitions. Second operand has 7 states, 6 states have (on average 25.666666666666668) internal successors, (154), 5 states have internal predecessors, (154), 4 states have call successors, (55), 5 states have call predecessors, (55), 1 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2022-07-12 17:12:18,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:12:18,728 INFO L93 Difference]: Finished difference Result 5044 states and 7234 transitions. [2022-07-12 17:12:18,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:12:18,729 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 25.666666666666668) internal successors, (154), 5 states have internal predecessors, (154), 4 states have call successors, (55), 5 states have call predecessors, (55), 1 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 433 [2022-07-12 17:12:18,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:12:18,736 INFO L225 Difference]: With dead ends: 5044 [2022-07-12 17:12:18,737 INFO L226 Difference]: Without dead ends: 2572 [2022-07-12 17:12:18,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 427 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-12 17:12:18,743 INFO L413 NwaCegarLoop]: 2671 mSDtfsCounter, 36 mSDsluCounter, 13319 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 15990 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 17:12:18,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 15990 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 17:12:18,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2572 states. [2022-07-12 17:12:18,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2572 to 2570. [2022-07-12 17:12:18,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2570 states, 1727 states have (on average 1.269253039953677) internal successors, (2192), 1828 states have internal predecessors, (2192), 671 states have call successors, (671), 164 states have call predecessors, (671), 166 states have return successors, (708), 612 states have call predecessors, (708), 671 states have call successors, (708) [2022-07-12 17:12:18,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2570 states to 2570 states and 3571 transitions. [2022-07-12 17:12:18,922 INFO L78 Accepts]: Start accepts. Automaton has 2570 states and 3571 transitions. Word has length 433 [2022-07-12 17:12:18,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:12:18,923 INFO L495 AbstractCegarLoop]: Abstraction has 2570 states and 3571 transitions. [2022-07-12 17:12:18,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 25.666666666666668) internal successors, (154), 5 states have internal predecessors, (154), 4 states have call successors, (55), 5 states have call predecessors, (55), 1 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2022-07-12 17:12:18,923 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 3571 transitions. [2022-07-12 17:12:18,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2022-07-12 17:12:18,927 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:12:18,927 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 13, 13, 12, 12, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:12:18,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (48)] Ended with exit code 0 [2022-07-12 17:12:19,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:12:19,153 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:12:19,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:12:19,153 INFO L85 PathProgramCache]: Analyzing trace with hash -70791302, now seen corresponding path program 1 times [2022-07-12 17:12:19,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:12:19,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [933969600] [2022-07-12 17:12:19,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:12:19,155 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:12:19,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:12:19,156 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:12:19,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (49)] Waiting until timeout for monitored process [2022-07-12 17:12:20,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:20,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 2404 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 17:12:20,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:12:21,027 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-12 17:12:21,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 21 [2022-07-12 17:12:21,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1304 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 1090 trivial. 0 not checked. [2022-07-12 17:12:21,214 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:12:21,214 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:12:21,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [933969600] [2022-07-12 17:12:21,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [933969600] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:12:21,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:12:21,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 17:12:21,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291697164] [2022-07-12 17:12:21,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:12:21,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 17:12:21,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:12:21,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 17:12:21,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 17:12:21,216 INFO L87 Difference]: Start difference. First operand 2570 states and 3571 transitions. Second operand has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 2 states have call successors, (74), 2 states have call predecessors, (74), 2 states have return successors, (71), 2 states have call predecessors, (71), 2 states have call successors, (71) [2022-07-12 17:12:24,201 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:12:26,723 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:12:28,743 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:12:42,237 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:12:44,245 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:12:46,283 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:12:48,261 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:12:50,293 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:12:52,305 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:12:55,021 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:12:57,039 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:12:59,118 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:13:01,130 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:13:03,155 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:13:05,176 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:13:06,243 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:13:09,180 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:13:10,514 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:13:13,097 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:13:15,341 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:13:17,451 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:13:19,468 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:13:21,517 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:13:23,531 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:13:27,389 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:13:29,405 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:13:31,444 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:13:33,466 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:13:33,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:13:33,468 INFO L93 Difference]: Finished difference Result 5275 states and 7392 transitions. [2022-07-12 17:13:33,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 17:13:33,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 2 states have call successors, (74), 2 states have call predecessors, (74), 2 states have return successors, (71), 2 states have call predecessors, (71), 2 states have call successors, (71) Word has length 531 [2022-07-12 17:13:33,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:13:33,494 INFO L225 Difference]: With dead ends: 5275 [2022-07-12 17:13:33,494 INFO L226 Difference]: Without dead ends: 2728 [2022-07-12 17:13:33,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 532 GetRequests, 527 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 17:13:33,499 INFO L413 NwaCegarLoop]: 2832 mSDtfsCounter, 182 mSDsluCounter, 7603 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 3 mSolverCounterUnsat, 22 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 69.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 10435 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 22 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 71.9s IncrementalHoareTripleChecker+Time [2022-07-12 17:13:33,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 10435 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 862 Invalid, 22 Unknown, 64 Unchecked, 71.9s Time] [2022-07-12 17:13:33,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2728 states. [2022-07-12 17:13:33,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2728 to 2572. [2022-07-12 17:13:33,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2572 states, 1729 states have (on average 1.2689415847310583) internal successors, (2194), 1830 states have internal predecessors, (2194), 671 states have call successors, (671), 164 states have call predecessors, (671), 166 states have return successors, (708), 612 states have call predecessors, (708), 671 states have call successors, (708) [2022-07-12 17:13:33,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2572 states to 2572 states and 3573 transitions. [2022-07-12 17:13:33,641 INFO L78 Accepts]: Start accepts. Automaton has 2572 states and 3573 transitions. Word has length 531 [2022-07-12 17:13:33,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:13:33,642 INFO L495 AbstractCegarLoop]: Abstraction has 2572 states and 3573 transitions. [2022-07-12 17:13:33,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 2 states have call successors, (74), 2 states have call predecessors, (74), 2 states have return successors, (71), 2 states have call predecessors, (71), 2 states have call successors, (71) [2022-07-12 17:13:33,642 INFO L276 IsEmpty]: Start isEmpty. Operand 2572 states and 3573 transitions. [2022-07-12 17:13:33,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2022-07-12 17:13:33,645 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:13:33,646 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 13, 13, 12, 12, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:13:33,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (49)] Forceful destruction successful, exit code 0 [2022-07-12 17:13:33,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 17:13:33,846 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:13:33,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:13:33,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1377523513, now seen corresponding path program 1 times [2022-07-12 17:13:33,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 17:13:33,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1223599833] [2022-07-12 17:13:33,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:13:33,848 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 17:13:33,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 17:13:33,851 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 17:13:33,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (50)] Waiting until timeout for monitored process [2022-07-12 17:13:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:35,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 2440 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 17:13:35,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:13:35,913 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-12 17:13:35,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 21 [2022-07-12 17:13:36,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1304 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 1090 trivial. 0 not checked. [2022-07-12 17:13:36,237 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:13:36,237 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 17:13:36,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1223599833] [2022-07-12 17:13:36,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1223599833] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:13:36,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:13:36,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 17:13:36,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325280099] [2022-07-12 17:13:36,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:13:36,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 17:13:36,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 17:13:36,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 17:13:36,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 17:13:36,239 INFO L87 Difference]: Start difference. First operand 2572 states and 3573 transitions. Second operand has 5 states, 5 states have (on average 43.4) internal successors, (217), 5 states have internal predecessors, (217), 2 states have call successors, (74), 2 states have call predecessors, (74), 2 states have return successors, (71), 2 states have call predecessors, (71), 2 states have call successors, (71)