./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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---sound--drivers--vx--snd-vx-lib.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 f240ffa8bbe57321940b5df51685e00d551a6f85a6476ff38145ce15f731fd7b --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 15:48:09,796 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 15:48:09,798 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 15:48:09,834 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 15:48:09,834 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 15:48:09,836 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 15:48:09,839 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 15:48:09,842 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 15:48:09,844 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 15:48:09,848 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 15:48:09,849 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 15:48:09,851 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 15:48:09,851 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 15:48:09,854 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 15:48:09,855 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 15:48:09,860 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 15:48:09,861 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 15:48:09,862 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 15:48:09,864 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 15:48:09,871 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 15:48:09,872 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 15:48:09,873 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 15:48:09,875 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 15:48:09,876 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 15:48:09,877 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 15:48:09,883 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 15:48:09,884 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 15:48:09,884 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 15:48:09,885 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 15:48:09,885 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 15:48:09,886 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 15:48:09,886 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 15:48:09,888 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 15:48:09,889 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 15:48:09,890 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 15:48:09,891 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 15:48:09,891 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 15:48:09,892 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 15:48:09,892 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 15:48:09,892 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 15:48:09,893 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 15:48:09,894 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 15:48:09,899 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-21 15:48:09,935 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 15:48:09,936 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 15:48:09,936 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 15:48:09,936 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 15:48:09,937 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 15:48:09,937 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 15:48:09,938 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 15:48:09,938 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 15:48:09,938 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 15:48:09,939 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 15:48:09,940 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 15:48:09,940 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 15:48:09,940 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 15:48:09,940 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 15:48:09,940 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 15:48:09,941 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 15:48:09,941 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 15:48:09,941 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 15:48:09,941 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 15:48:09,941 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 15:48:09,941 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 15:48:09,942 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 15:48:09,942 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 15:48:09,942 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 15:48:09,942 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 15:48:09,942 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 15:48:09,943 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 15:48:09,943 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 15:48:09,943 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 15:48:09,943 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 15:48:09,943 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 -> f240ffa8bbe57321940b5df51685e00d551a6f85a6476ff38145ce15f731fd7b [2022-07-21 15:48:10,254 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 15:48:10,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 15:48:10,279 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 15:48:10,280 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 15:48:10,280 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 15:48:10,282 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---sound--drivers--vx--snd-vx-lib.ko.cil.i [2022-07-21 15:48:10,342 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf7e68a29/d3bff513a06a4a49b54fec7453016f8d/FLAGd999099f6 [2022-07-21 15:48:11,222 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 15:48:11,223 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i [2022-07-21 15:48:11,286 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf7e68a29/d3bff513a06a4a49b54fec7453016f8d/FLAGd999099f6 [2022-07-21 15:48:11,716 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf7e68a29/d3bff513a06a4a49b54fec7453016f8d [2022-07-21 15:48:11,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 15:48:11,720 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 15:48:11,721 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 15:48:11,722 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 15:48:11,725 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 15:48:11,726 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 03:48:11" (1/1) ... [2022-07-21 15:48:11,727 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bd3eb39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:48:11, skipping insertion in model container [2022-07-21 15:48:11,727 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 03:48:11" (1/1) ... [2022-07-21 15:48:11,733 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 15:48:11,853 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 15:48:15,037 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[357609,357622] [2022-07-21 15:48:15,040 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[357754,357767] [2022-07-21 15:48:15,041 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[357900,357913] [2022-07-21 15:48:15,041 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[358065,358078] [2022-07-21 15:48:15,041 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[358223,358236] [2022-07-21 15:48:15,042 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[358381,358394] [2022-07-21 15:48:15,042 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[358539,358552] [2022-07-21 15:48:15,043 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[358699,358712] [2022-07-21 15:48:15,043 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[358858,358871] [2022-07-21 15:48:15,043 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[358997,359010] [2022-07-21 15:48:15,044 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[359139,359152] [2022-07-21 15:48:15,045 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[359288,359301] [2022-07-21 15:48:15,045 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[359427,359440] [2022-07-21 15:48:15,045 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[359582,359595] [2022-07-21 15:48:15,046 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[359742,359755] [2022-07-21 15:48:15,047 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[359893,359906] [2022-07-21 15:48:15,047 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[360044,360057] [2022-07-21 15:48:15,047 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[360196,360209] [2022-07-21 15:48:15,048 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[360345,360358] [2022-07-21 15:48:15,049 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[360493,360506] [2022-07-21 15:48:15,049 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[360650,360663] [2022-07-21 15:48:15,050 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[360799,360812] [2022-07-21 15:48:15,050 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[360955,360968] [2022-07-21 15:48:15,050 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[361108,361121] [2022-07-21 15:48:15,052 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[361254,361267] [2022-07-21 15:48:15,053 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[361397,361410] [2022-07-21 15:48:15,054 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[361549,361562] [2022-07-21 15:48:15,054 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[361695,361708] [2022-07-21 15:48:15,054 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[361840,361853] [2022-07-21 15:48:15,055 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[361994,362007] [2022-07-21 15:48:15,056 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[362145,362158] [2022-07-21 15:48:15,057 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[362300,362313] [2022-07-21 15:48:15,057 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[362452,362465] [2022-07-21 15:48:15,058 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[362607,362620] [2022-07-21 15:48:15,058 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[362771,362784] [2022-07-21 15:48:15,059 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[362927,362940] [2022-07-21 15:48:15,059 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[363091,363104] [2022-07-21 15:48:15,060 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[363233,363246] [2022-07-21 15:48:15,060 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[363391,363404] [2022-07-21 15:48:15,060 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[363558,363571] [2022-07-21 15:48:15,061 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[363717,363730] [2022-07-21 15:48:15,061 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[363876,363889] [2022-07-21 15:48:15,061 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[364025,364038] [2022-07-21 15:48:15,062 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[364172,364185] [2022-07-21 15:48:15,062 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[364311,364324] [2022-07-21 15:48:15,062 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[364474,364487] [2022-07-21 15:48:15,063 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[364640,364653] [2022-07-21 15:48:15,064 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[364804,364817] [2022-07-21 15:48:15,065 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[364969,364982] [2022-07-21 15:48:15,065 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[365134,365147] [2022-07-21 15:48:15,065 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[365300,365313] [2022-07-21 15:48:15,066 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[365465,365478] [2022-07-21 15:48:15,066 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[365632,365645] [2022-07-21 15:48:15,066 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[365792,365805] [2022-07-21 15:48:15,067 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[365954,365967] [2022-07-21 15:48:15,067 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[366113,366126] [2022-07-21 15:48:15,067 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[366259,366272] [2022-07-21 15:48:15,068 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[366402,366415] [2022-07-21 15:48:15,068 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[366546,366559] [2022-07-21 15:48:15,068 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[366689,366702] [2022-07-21 15:48:15,069 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[366833,366846] [2022-07-21 15:48:15,069 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[366974,366987] [2022-07-21 15:48:15,069 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[367112,367125] [2022-07-21 15:48:15,070 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[367270,367283] [2022-07-21 15:48:15,070 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[367429,367442] [2022-07-21 15:48:15,071 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[367585,367598] [2022-07-21 15:48:15,071 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[367734,367747] [2022-07-21 15:48:15,071 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[367886,367899] [2022-07-21 15:48:15,072 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[368037,368050] [2022-07-21 15:48:15,072 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[368186,368199] [2022-07-21 15:48:15,072 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[368338,368351] [2022-07-21 15:48:15,073 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[368486,368499] [2022-07-21 15:48:15,073 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[368639,368652] [2022-07-21 15:48:15,073 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[368790,368803] [2022-07-21 15:48:15,074 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[368940,368953] [2022-07-21 15:48:15,074 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[369087,369100] [2022-07-21 15:48:15,074 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[369238,369251] [2022-07-21 15:48:15,075 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[369389,369402] [2022-07-21 15:48:15,075 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[369537,369550] [2022-07-21 15:48:15,075 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[369703,369716] [2022-07-21 15:48:15,076 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[369872,369885] [2022-07-21 15:48:15,076 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[370039,370052] [2022-07-21 15:48:15,076 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[370207,370220] [2022-07-21 15:48:15,077 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[370357,370370] [2022-07-21 15:48:15,077 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[370504,370517] [2022-07-21 15:48:15,077 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[370665,370678] [2022-07-21 15:48:15,078 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[370835,370848] [2022-07-21 15:48:15,078 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[370997,371010] [2022-07-21 15:48:15,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 15:48:15,122 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 15:48:15,613 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[357609,357622] [2022-07-21 15:48:15,614 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[357754,357767] [2022-07-21 15:48:15,614 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[357900,357913] [2022-07-21 15:48:15,615 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[358065,358078] [2022-07-21 15:48:15,615 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[358223,358236] [2022-07-21 15:48:15,615 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[358381,358394] [2022-07-21 15:48:15,616 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[358539,358552] [2022-07-21 15:48:15,616 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[358699,358712] [2022-07-21 15:48:15,616 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[358858,358871] [2022-07-21 15:48:15,617 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[358997,359010] [2022-07-21 15:48:15,617 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[359139,359152] [2022-07-21 15:48:15,617 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[359288,359301] [2022-07-21 15:48:15,618 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[359427,359440] [2022-07-21 15:48:15,618 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[359582,359595] [2022-07-21 15:48:15,618 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[359742,359755] [2022-07-21 15:48:15,619 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[359893,359906] [2022-07-21 15:48:15,619 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[360044,360057] [2022-07-21 15:48:15,619 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[360196,360209] [2022-07-21 15:48:15,620 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[360345,360358] [2022-07-21 15:48:15,620 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[360493,360506] [2022-07-21 15:48:15,620 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[360650,360663] [2022-07-21 15:48:15,621 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[360799,360812] [2022-07-21 15:48:15,621 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[360955,360968] [2022-07-21 15:48:15,621 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[361108,361121] [2022-07-21 15:48:15,622 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[361254,361267] [2022-07-21 15:48:15,622 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[361397,361410] [2022-07-21 15:48:15,622 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[361549,361562] [2022-07-21 15:48:15,623 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[361695,361708] [2022-07-21 15:48:15,623 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[361840,361853] [2022-07-21 15:48:15,623 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[361994,362007] [2022-07-21 15:48:15,624 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[362145,362158] [2022-07-21 15:48:15,624 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[362300,362313] [2022-07-21 15:48:15,624 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[362452,362465] [2022-07-21 15:48:15,625 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[362607,362620] [2022-07-21 15:48:15,625 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[362771,362784] [2022-07-21 15:48:15,625 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[362927,362940] [2022-07-21 15:48:15,626 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[363091,363104] [2022-07-21 15:48:15,626 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[363233,363246] [2022-07-21 15:48:15,626 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[363391,363404] [2022-07-21 15:48:15,627 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[363558,363571] [2022-07-21 15:48:15,627 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[363717,363730] [2022-07-21 15:48:15,627 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[363876,363889] [2022-07-21 15:48:15,628 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[364025,364038] [2022-07-21 15:48:15,628 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[364172,364185] [2022-07-21 15:48:15,628 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[364311,364324] [2022-07-21 15:48:15,629 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[364474,364487] [2022-07-21 15:48:15,629 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[364640,364653] [2022-07-21 15:48:15,629 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[364804,364817] [2022-07-21 15:48:15,630 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[364969,364982] [2022-07-21 15:48:15,630 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[365134,365147] [2022-07-21 15:48:15,630 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[365300,365313] [2022-07-21 15:48:15,631 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[365465,365478] [2022-07-21 15:48:15,631 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[365632,365645] [2022-07-21 15:48:15,631 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[365792,365805] [2022-07-21 15:48:15,632 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[365954,365967] [2022-07-21 15:48:15,632 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[366113,366126] [2022-07-21 15:48:15,632 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[366259,366272] [2022-07-21 15:48:15,633 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[366402,366415] [2022-07-21 15:48:15,633 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[366546,366559] [2022-07-21 15:48:15,633 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[366689,366702] [2022-07-21 15:48:15,633 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[366833,366846] [2022-07-21 15:48:15,634 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[366974,366987] [2022-07-21 15:48:15,634 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[367112,367125] [2022-07-21 15:48:15,634 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[367270,367283] [2022-07-21 15:48:15,635 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[367429,367442] [2022-07-21 15:48:15,635 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[367585,367598] [2022-07-21 15:48:15,636 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[367734,367747] [2022-07-21 15:48:15,636 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[367886,367899] [2022-07-21 15:48:15,636 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[368037,368050] [2022-07-21 15:48:15,637 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[368186,368199] [2022-07-21 15:48:15,637 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[368338,368351] [2022-07-21 15:48:15,637 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[368486,368499] [2022-07-21 15:48:15,638 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[368639,368652] [2022-07-21 15:48:15,638 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[368790,368803] [2022-07-21 15:48:15,638 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[368940,368953] [2022-07-21 15:48:15,639 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[369087,369100] [2022-07-21 15:48:15,639 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[369238,369251] [2022-07-21 15:48:15,639 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[369389,369402] [2022-07-21 15:48:15,640 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[369537,369550] [2022-07-21 15:48:15,640 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[369703,369716] [2022-07-21 15:48:15,640 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[369872,369885] [2022-07-21 15:48:15,641 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[370039,370052] [2022-07-21 15:48:15,641 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[370207,370220] [2022-07-21 15:48:15,641 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[370357,370370] [2022-07-21 15:48:15,642 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[370504,370517] [2022-07-21 15:48:15,642 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[370665,370678] [2022-07-21 15:48:15,642 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[370835,370848] [2022-07-21 15:48:15,642 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[370997,371010] [2022-07-21 15:48:15,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 15:48:15,898 INFO L208 MainTranslator]: Completed translation [2022-07-21 15:48:15,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:48:15 WrapperNode [2022-07-21 15:48:15,899 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 15:48:15,900 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 15:48:15,901 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 15:48:15,901 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 15:48:15,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:48:15" (1/1) ... [2022-07-21 15:48:16,032 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:48:15" (1/1) ... [2022-07-21 15:48:16,194 INFO L137 Inliner]: procedures = 637, calls = 3768, calls flagged for inlining = 247, calls inlined = 94, statements flattened = 2799 [2022-07-21 15:48:16,195 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 15:48:16,196 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 15:48:16,196 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 15:48:16,196 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 15:48:16,203 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:48:15" (1/1) ... [2022-07-21 15:48:16,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:48:15" (1/1) ... [2022-07-21 15:48:16,245 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:48:15" (1/1) ... [2022-07-21 15:48:16,246 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:48:15" (1/1) ... [2022-07-21 15:48:16,329 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:48:15" (1/1) ... [2022-07-21 15:48:16,343 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:48:15" (1/1) ... [2022-07-21 15:48:16,387 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:48:15" (1/1) ... [2022-07-21 15:48:16,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 15:48:16,424 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 15:48:16,425 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 15:48:16,425 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 15:48:16,426 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:48:15" (1/1) ... [2022-07-21 15:48:16,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 15:48:16,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:48:16,457 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-21 15:48:16,474 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-21 15:48:16,498 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-21 15:48:16,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-21 15:48:16,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-21 15:48:16,498 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-21 15:48:16,498 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-21 15:48:16,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-21 15:48:16,499 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~$Pointer$~X~int~TO~VOID [2022-07-21 15:48:16,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~$Pointer$~X~int~TO~VOID [2022-07-21 15:48:16,499 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-21 15:48:16,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-21 15:48:16,500 INFO L130 BoogieDeclarations]: Found specification of procedure vx_pcm_capture_close [2022-07-21 15:48:16,500 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_pcm_capture_close [2022-07-21 15:48:16,500 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-21 15:48:16,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-21 15:48:16,501 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-21 15:48:16,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-21 15:48:16,501 INFO L130 BoogieDeclarations]: Found specification of procedure vx_alloc_pipe [2022-07-21 15:48:16,501 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_alloc_pipe [2022-07-21 15:48:16,501 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~VOID [2022-07-21 15:48:16,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~VOID [2022-07-21 15:48:16,502 INFO L130 BoogieDeclarations]: Found specification of procedure snd_vx_outl [2022-07-21 15:48:16,502 INFO L138 BoogieDeclarations]: Found implementation of procedure snd_vx_outl [2022-07-21 15:48:16,502 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-21 15:48:16,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-21 15:48:16,502 INFO L130 BoogieDeclarations]: Found specification of procedure vx_set_differed_time [2022-07-21 15:48:16,502 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_set_differed_time [2022-07-21 15:48:16,502 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-21 15:48:16,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-21 15:48:16,503 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-21 15:48:16,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-21 15:48:16,503 INFO L130 BoogieDeclarations]: Found specification of procedure snd_vx_outb [2022-07-21 15:48:16,503 INFO L138 BoogieDeclarations]: Found implementation of procedure snd_vx_outb [2022-07-21 15:48:16,503 INFO L130 BoogieDeclarations]: Found specification of procedure vx_send_msg [2022-07-21 15:48:16,503 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_send_msg [2022-07-21 15:48:16,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 15:48:16,504 INFO L130 BoogieDeclarations]: Found specification of procedure snd_pcm_lib_get_vmalloc_page [2022-07-21 15:48:16,504 INFO L138 BoogieDeclarations]: Found implementation of procedure snd_pcm_lib_get_vmalloc_page [2022-07-21 15:48:16,504 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-21 15:48:16,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-21 15:48:16,504 INFO L130 BoogieDeclarations]: Found specification of procedure vx_send_irq_dsp [2022-07-21 15:48:16,504 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_send_irq_dsp [2022-07-21 15:48:16,504 INFO L130 BoogieDeclarations]: Found specification of procedure vx_set_pipe_cmd_params [2022-07-21 15:48:16,505 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_set_pipe_cmd_params [2022-07-21 15:48:16,505 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_lock_of_vx_core [2022-07-21 15:48:16,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_lock_of_vx_core [2022-07-21 15:48:16,505 INFO L130 BoogieDeclarations]: Found specification of procedure vx_adjust_audio_level [2022-07-21 15:48:16,505 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_adjust_audio_level [2022-07-21 15:48:16,505 INFO L130 BoogieDeclarations]: Found specification of procedure vx_change_clock_source [2022-07-21 15:48:16,505 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_change_clock_source [2022-07-21 15:48:16,505 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~int [2022-07-21 15:48:16,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~int [2022-07-21 15:48:16,506 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-21 15:48:16,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-21 15:48:16,506 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-21 15:48:16,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-21 15:48:16,507 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-21 15:48:16,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-21 15:48:16,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 15:48:16,507 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-21 15:48:16,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-21 15:48:16,507 INFO L130 BoogieDeclarations]: Found specification of procedure vx_transfer_end [2022-07-21 15:48:16,507 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_transfer_end [2022-07-21 15:48:16,508 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2022-07-21 15:48:16,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2022-07-21 15:48:16,508 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-21 15:48:16,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-21 15:48:16,508 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2022-07-21 15:48:16,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2022-07-21 15:48:16,508 INFO L130 BoogieDeclarations]: Found specification of procedure vx_read_status [2022-07-21 15:48:16,508 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_read_status [2022-07-21 15:48:16,509 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-21 15:48:16,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-21 15:48:16,509 INFO L130 BoogieDeclarations]: Found specification of procedure vx_sync_audio_source [2022-07-21 15:48:16,512 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_sync_audio_source [2022-07-21 15:48:16,512 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-21 15:48:16,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-21 15:48:16,513 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-21 15:48:16,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-21 15:48:16,513 INFO L130 BoogieDeclarations]: Found specification of procedure vx_stop_stream [2022-07-21 15:48:16,513 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_stop_stream [2022-07-21 15:48:16,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 15:48:16,514 INFO L130 BoogieDeclarations]: Found specification of procedure vx_conf_pipe [2022-07-21 15:48:16,518 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_conf_pipe [2022-07-21 15:48:16,519 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_calloc [2022-07-21 15:48:16,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_calloc [2022-07-21 15:48:16,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 15:48:16,519 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-21 15:48:16,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-21 15:48:16,519 INFO L130 BoogieDeclarations]: Found specification of procedure vx_query_hbuffer_size [2022-07-21 15:48:16,519 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_query_hbuffer_size [2022-07-21 15:48:16,519 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-07-21 15:48:16,520 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-07-21 15:48:16,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 15:48:16,520 INFO L130 BoogieDeclarations]: Found specification of procedure vx_pipe_can_start [2022-07-21 15:48:16,520 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_pipe_can_start [2022-07-21 15:48:16,520 INFO L130 BoogieDeclarations]: Found specification of procedure vx_pcm_capture_open [2022-07-21 15:48:16,520 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_pcm_capture_open [2022-07-21 15:48:16,568 INFO L130 BoogieDeclarations]: Found specification of procedure vx_set_codec_reg [2022-07-21 15:48:16,568 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_set_codec_reg [2022-07-21 15:48:16,568 INFO L130 BoogieDeclarations]: Found specification of procedure vx_set_clock [2022-07-21 15:48:16,568 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_set_clock [2022-07-21 15:48:16,568 INFO L130 BoogieDeclarations]: Found specification of procedure vx_notify_end_of_buffer [2022-07-21 15:48:16,568 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_notify_end_of_buffer [2022-07-21 15:48:16,568 INFO L130 BoogieDeclarations]: Found specification of procedure vx_set_monitor_level [2022-07-21 15:48:16,568 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_set_monitor_level [2022-07-21 15:48:16,568 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-21 15:48:16,569 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-21 15:48:16,569 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-21 15:48:16,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-21 15:48:16,569 INFO L130 BoogieDeclarations]: Found specification of procedure vx_stop_pipe [2022-07-21 15:48:16,569 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_stop_pipe [2022-07-21 15:48:16,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 15:48:16,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 15:48:16,569 INFO L130 BoogieDeclarations]: Found specification of procedure vx_send_irqa [2022-07-21 15:48:16,569 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_send_irqa [2022-07-21 15:48:16,569 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-21 15:48:16,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-21 15:48:16,569 INFO L130 BoogieDeclarations]: Found specification of procedure vx_free_pipe [2022-07-21 15:48:16,569 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_free_pipe [2022-07-21 15:48:16,569 INFO L130 BoogieDeclarations]: Found specification of procedure vx_set_stream_cmd_params [2022-07-21 15:48:16,569 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_set_stream_cmd_params [2022-07-21 15:48:16,569 INFO L130 BoogieDeclarations]: Found specification of procedure snd_pcm_hw_constraint_step [2022-07-21 15:48:16,569 INFO L138 BoogieDeclarations]: Found implementation of procedure snd_pcm_hw_constraint_step [2022-07-21 15:48:16,570 INFO L130 BoogieDeclarations]: Found specification of procedure vx_pcm_hw_params [2022-07-21 15:48:16,570 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_pcm_hw_params [2022-07-21 15:48:16,570 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_lock_of_vx_core [2022-07-21 15:48:16,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_lock_of_vx_core [2022-07-21 15:48:16,570 INFO L130 BoogieDeclarations]: Found specification of procedure vx_pcm_playback_open [2022-07-21 15:48:16,570 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_pcm_playback_open [2022-07-21 15:48:16,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-21 15:48:16,570 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-21 15:48:16,570 INFO L130 BoogieDeclarations]: Found specification of procedure vx_toggle_dac_mute [2022-07-21 15:48:16,570 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_toggle_dac_mute [2022-07-21 15:48:16,570 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-21 15:48:16,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-21 15:48:16,570 INFO L130 BoogieDeclarations]: Found specification of procedure vx_reset_chk [2022-07-21 15:48:16,570 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_reset_chk [2022-07-21 15:48:16,570 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-21 15:48:16,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-21 15:48:16,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 15:48:16,571 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-21 15:48:16,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-21 15:48:16,571 INFO L130 BoogieDeclarations]: Found specification of procedure vx_start_stream [2022-07-21 15:48:16,571 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_start_stream [2022-07-21 15:48:16,571 INFO L130 BoogieDeclarations]: Found specification of procedure vx_send_rih_nolock [2022-07-21 15:48:16,571 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_send_rih_nolock [2022-07-21 15:48:16,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 15:48:16,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 15:48:16,571 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-21 15:48:16,571 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-21 15:48:16,571 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-21 15:48:16,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-21 15:48:16,571 INFO L130 BoogieDeclarations]: Found specification of procedure vx_pcm_trigger [2022-07-21 15:48:16,571 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_pcm_trigger [2022-07-21 15:48:16,571 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-21 15:48:16,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-21 15:48:16,572 INFO L130 BoogieDeclarations]: Found specification of procedure vx_get_pipe_state [2022-07-21 15:48:16,572 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_get_pipe_state [2022-07-21 15:48:16,572 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-21 15:48:16,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-21 15:48:16,572 INFO L130 BoogieDeclarations]: Found specification of procedure vx_pcm_playback_close [2022-07-21 15:48:16,572 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_pcm_playback_close [2022-07-21 15:48:16,572 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-21 15:48:16,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-21 15:48:16,572 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-21 15:48:16,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-21 15:48:16,572 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-21 15:48:16,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-21 15:48:16,572 INFO L130 BoogieDeclarations]: Found specification of procedure vx_send_rih [2022-07-21 15:48:16,572 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_send_rih [2022-07-21 15:48:16,572 INFO L130 BoogieDeclarations]: Found specification of procedure vx_send_msg_nolock [2022-07-21 15:48:16,572 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_send_msg_nolock [2022-07-21 15:48:16,573 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-21 15:48:16,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-21 15:48:16,573 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-21 15:48:16,573 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-21 15:48:16,573 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-21 15:48:16,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-21 15:48:16,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 15:48:16,573 INFO L130 BoogieDeclarations]: Found specification of procedure vx_update_pipe_position [2022-07-21 15:48:16,573 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_update_pipe_position [2022-07-21 15:48:16,573 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-21 15:48:16,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-21 15:48:16,573 INFO L130 BoogieDeclarations]: Found specification of procedure vx_pcm_playback_transfer [2022-07-21 15:48:16,573 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_pcm_playback_transfer [2022-07-21 15:48:16,573 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-21 15:48:16,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-21 15:48:16,573 INFO L130 BoogieDeclarations]: Found specification of procedure vx_pcm_prepare [2022-07-21 15:48:16,573 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_pcm_prepare [2022-07-21 15:48:16,574 INFO L130 BoogieDeclarations]: Found specification of procedure vx_pcm_playback_transfer_chunk [2022-07-21 15:48:16,574 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_pcm_playback_transfer_chunk [2022-07-21 15:48:16,574 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-21 15:48:16,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-21 15:48:16,574 INFO L130 BoogieDeclarations]: Found specification of procedure vx_pcm_hw_free [2022-07-21 15:48:16,574 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_pcm_hw_free [2022-07-21 15:48:16,574 INFO L130 BoogieDeclarations]: Found specification of procedure frames_to_bytes [2022-07-21 15:48:16,574 INFO L138 BoogieDeclarations]: Found implementation of procedure frames_to_bytes [2022-07-21 15:48:16,574 INFO L130 BoogieDeclarations]: Found specification of procedure snd_vx_inb [2022-07-21 15:48:16,574 INFO L138 BoogieDeclarations]: Found implementation of procedure snd_vx_inb [2022-07-21 15:48:16,574 INFO L130 BoogieDeclarations]: Found specification of procedure snd_pcm_lib_ioctl [2022-07-21 15:48:16,574 INFO L138 BoogieDeclarations]: Found implementation of procedure snd_pcm_lib_ioctl [2022-07-21 15:48:16,574 INFO L130 BoogieDeclarations]: Found specification of procedure snd_vx_check_reg_bit [2022-07-21 15:48:16,574 INFO L138 BoogieDeclarations]: Found implementation of procedure snd_vx_check_reg_bit [2022-07-21 15:48:16,574 INFO L130 BoogieDeclarations]: Found specification of procedure vx_toggle_pipe [2022-07-21 15:48:16,574 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_toggle_pipe [2022-07-21 15:48:16,574 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-21 15:48:16,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-21 15:48:16,575 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-21 15:48:16,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-21 15:48:16,575 INFO L130 BoogieDeclarations]: Found specification of procedure vx_set_internal_clock [2022-07-21 15:48:16,575 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_set_internal_clock [2022-07-21 15:48:16,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 15:48:16,589 INFO L130 BoogieDeclarations]: Found specification of procedure vx_init_rmh [2022-07-21 15:48:16,589 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_init_rmh [2022-07-21 15:48:16,589 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~int~TO~VOID [2022-07-21 15:48:16,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~int~TO~VOID [2022-07-21 15:48:17,181 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 15:48:17,184 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 15:48:17,354 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-21 15:48:24,986 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 15:48:25,011 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 15:48:25,011 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-21 15:48:25,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:48:25 BoogieIcfgContainer [2022-07-21 15:48:25,016 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 15:48:25,017 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 15:48:25,018 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 15:48:25,020 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 15:48:25,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 03:48:11" (1/3) ... [2022-07-21 15:48:25,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1664abb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 03:48:25, skipping insertion in model container [2022-07-21 15:48:25,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:48:15" (2/3) ... [2022-07-21 15:48:25,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1664abb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 03:48:25, skipping insertion in model container [2022-07-21 15:48:25,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:48:25" (3/3) ... [2022-07-21 15:48:25,027 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i [2022-07-21 15:48:25,040 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 15:48:25,040 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2022-07-21 15:48:25,137 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 15:48:25,146 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@64be49a2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@28c0eea4 [2022-07-21 15:48:25,146 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2022-07-21 15:48:25,155 INFO L276 IsEmpty]: Start isEmpty. Operand has 1370 states, 920 states have (on average 1.3456521739130434) internal successors, (1238), 964 states have internal predecessors, (1238), 325 states have call successors, (325), 102 states have call predecessors, (325), 101 states have return successors, (321), 320 states have call predecessors, (321), 321 states have call successors, (321) [2022-07-21 15:48:25,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-21 15:48:25,168 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:48:25,169 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] [2022-07-21 15:48:25,169 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 23 more)] === [2022-07-21 15:48:25,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:48:25,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1561423034, now seen corresponding path program 1 times [2022-07-21 15:48:25,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:48:25,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477082514] [2022-07-21 15:48:25,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:48:25,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:48:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:25,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:48:25,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:25,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:48:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:25,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:48:25,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:25,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:48:25,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:25,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:48:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:25,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:48:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:25,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:48:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:25,946 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-21 15:48:25,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:48:25,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477082514] [2022-07-21 15:48:25,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477082514] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:48:25,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:48:25,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:48:25,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989298982] [2022-07-21 15:48:25,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:48:25,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:48:25,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:48:25,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:48:25,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:48:25,986 INFO L87 Difference]: Start difference. First operand has 1370 states, 920 states have (on average 1.3456521739130434) internal successors, (1238), 964 states have internal predecessors, (1238), 325 states have call successors, (325), 102 states have call predecessors, (325), 101 states have return successors, (321), 320 states have call predecessors, (321), 321 states have call successors, (321) Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-21 15:48:30,004 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:48:33,477 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:48:34,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:48:34,788 INFO L93 Difference]: Finished difference Result 2688 states and 3876 transitions. [2022-07-21 15:48:34,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:48:34,790 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 49 [2022-07-21 15:48:34,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:48:34,820 INFO L225 Difference]: With dead ends: 2688 [2022-07-21 15:48:34,822 INFO L226 Difference]: Without dead ends: 1347 [2022-07-21 15:48:34,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:48:34,839 INFO L413 NwaCegarLoop]: 1585 mSDtfsCounter, 3343 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 2004 mSolverCounterSat, 1576 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3423 SdHoareTripleChecker+Valid, 2072 SdHoareTripleChecker+Invalid, 3582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1576 IncrementalHoareTripleChecker+Valid, 2004 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-07-21 15:48:34,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3423 Valid, 2072 Invalid, 3582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1576 Valid, 2004 Invalid, 2 Unknown, 0 Unchecked, 8.5s Time] [2022-07-21 15:48:34,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2022-07-21 15:48:34,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1347. [2022-07-21 15:48:34,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1347 states, 904 states have (on average 1.2920353982300885) internal successors, (1168), 942 states have internal predecessors, (1168), 319 states have call successors, (319), 101 states have call predecessors, (319), 100 states have return successors, (317), 316 states have call predecessors, (317), 317 states have call successors, (317) [2022-07-21 15:48:34,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1804 transitions. [2022-07-21 15:48:34,978 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1804 transitions. Word has length 49 [2022-07-21 15:48:34,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:48:34,980 INFO L495 AbstractCegarLoop]: Abstraction has 1347 states and 1804 transitions. [2022-07-21 15:48:34,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-21 15:48:34,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1804 transitions. [2022-07-21 15:48:34,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-21 15:48:34,984 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:48:34,984 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] [2022-07-21 15:48:34,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 15:48:34,985 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 23 more)] === [2022-07-21 15:48:34,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:48:34,986 INFO L85 PathProgramCache]: Analyzing trace with hash 497600241, now seen corresponding path program 1 times [2022-07-21 15:48:34,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:48:34,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200519853] [2022-07-21 15:48:34,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:48:34,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:48:35,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:35,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:48:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:35,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:48:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:35,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:48:35,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:35,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:48:35,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:35,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:48:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:35,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:48:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:35,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:48:35,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:35,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 15:48:35,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:35,333 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-21 15:48:35,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:48:35,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200519853] [2022-07-21 15:48:35,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200519853] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:48:35,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:48:35,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:48:35,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863843522] [2022-07-21 15:48:35,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:48:35,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:48:35,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:48:35,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:48:35,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:48:35,337 INFO L87 Difference]: Start difference. First operand 1347 states and 1804 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 15:48:38,730 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:48:42,301 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:48:43,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:48:43,557 INFO L93 Difference]: Finished difference Result 1347 states and 1804 transitions. [2022-07-21 15:48:43,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:48:43,558 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 55 [2022-07-21 15:48:43,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:48:43,566 INFO L225 Difference]: With dead ends: 1347 [2022-07-21 15:48:43,566 INFO L226 Difference]: Without dead ends: 1345 [2022-07-21 15:48:43,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:48:43,571 INFO L413 NwaCegarLoop]: 1567 mSDtfsCounter, 3311 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 1990 mSolverCounterSat, 1568 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3388 SdHoareTripleChecker+Valid, 2038 SdHoareTripleChecker+Invalid, 3560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1568 IncrementalHoareTripleChecker+Valid, 1990 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:48:43,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3388 Valid, 2038 Invalid, 3560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1568 Valid, 1990 Invalid, 2 Unknown, 0 Unchecked, 8.0s Time] [2022-07-21 15:48:43,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2022-07-21 15:48:43,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1345. [2022-07-21 15:48:43,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1345 states, 903 states have (on average 1.29125138427464) internal successors, (1166), 940 states have internal predecessors, (1166), 319 states have call successors, (319), 101 states have call predecessors, (319), 100 states have return successors, (317), 316 states have call predecessors, (317), 317 states have call successors, (317) [2022-07-21 15:48:43,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 1802 transitions. [2022-07-21 15:48:43,645 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 1802 transitions. Word has length 55 [2022-07-21 15:48:43,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:48:43,646 INFO L495 AbstractCegarLoop]: Abstraction has 1345 states and 1802 transitions. [2022-07-21 15:48:43,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 15:48:43,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1802 transitions. [2022-07-21 15:48:43,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-21 15:48:43,650 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:48:43,651 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-21 15:48:43,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 15:48:43,652 INFO L420 AbstractCegarLoop]: === Iteration 3 === 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 23 more)] === [2022-07-21 15:48:43,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:48:43,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1892947023, now seen corresponding path program 1 times [2022-07-21 15:48:43,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:48:43,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576903424] [2022-07-21 15:48:43,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:48:43,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:48:43,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:43,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:48:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:43,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:48:43,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:43,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:48:43,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:43,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:48:43,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:43,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:48:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:43,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:48:43,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:43,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:48:43,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:43,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 15:48:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:43,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 15:48:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:44,013 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-21 15:48:44,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:48:44,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576903424] [2022-07-21 15:48:44,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576903424] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:48:44,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:48:44,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:48:44,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673255112] [2022-07-21 15:48:44,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:48:44,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:48:44,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:48:44,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:48:44,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:48:44,017 INFO L87 Difference]: Start difference. First operand 1345 states and 1802 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-21 15:48:49,856 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:48:51,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:48:51,034 INFO L93 Difference]: Finished difference Result 1345 states and 1802 transitions. [2022-07-21 15:48:51,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:48:51,035 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 61 [2022-07-21 15:48:51,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:48:51,043 INFO L225 Difference]: With dead ends: 1345 [2022-07-21 15:48:51,043 INFO L226 Difference]: Without dead ends: 1343 [2022-07-21 15:48:51,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:48:51,045 INFO L413 NwaCegarLoop]: 1565 mSDtfsCounter, 3305 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 1989 mSolverCounterSat, 1568 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3381 SdHoareTripleChecker+Valid, 2036 SdHoareTripleChecker+Invalid, 3558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1568 IncrementalHoareTripleChecker+Valid, 1989 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-07-21 15:48:51,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3381 Valid, 2036 Invalid, 3558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1568 Valid, 1989 Invalid, 1 Unknown, 0 Unchecked, 6.8s Time] [2022-07-21 15:48:51,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2022-07-21 15:48:51,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1343. [2022-07-21 15:48:51,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1343 states, 902 states have (on average 1.2904656319290466) internal successors, (1164), 938 states have internal predecessors, (1164), 319 states have call successors, (319), 101 states have call predecessors, (319), 100 states have return successors, (317), 316 states have call predecessors, (317), 317 states have call successors, (317) [2022-07-21 15:48:51,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1800 transitions. [2022-07-21 15:48:51,105 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1800 transitions. Word has length 61 [2022-07-21 15:48:51,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:48:51,106 INFO L495 AbstractCegarLoop]: Abstraction has 1343 states and 1800 transitions. [2022-07-21 15:48:51,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-21 15:48:51,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1800 transitions. [2022-07-21 15:48:51,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-21 15:48:51,107 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:48:51,108 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-21 15:48:51,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 15:48:51,108 INFO L420 AbstractCegarLoop]: === Iteration 4 === 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 23 more)] === [2022-07-21 15:48:51,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:48:51,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1202645261, now seen corresponding path program 1 times [2022-07-21 15:48:51,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:48:51,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504663552] [2022-07-21 15:48:51,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:48:51,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:48:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:51,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:48:51,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:51,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:48:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:51,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:48:51,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:51,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:48:51,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:51,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:48:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:51,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:48:51,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:51,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:48:51,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:51,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 15:48:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:51,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 15:48:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:51,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:48:51,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:51,421 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-21 15:48:51,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:48:51,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504663552] [2022-07-21 15:48:51,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504663552] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:48:51,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:48:51,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:48:51,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588512106] [2022-07-21 15:48:51,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:48:51,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:48:51,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:48:51,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:48:51,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:48:51,423 INFO L87 Difference]: Start difference. First operand 1343 states and 1800 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-21 15:48:56,882 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:48:57,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:48:57,901 INFO L93 Difference]: Finished difference Result 1343 states and 1800 transitions. [2022-07-21 15:48:57,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:48:57,902 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 67 [2022-07-21 15:48:57,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:48:57,909 INFO L225 Difference]: With dead ends: 1343 [2022-07-21 15:48:57,909 INFO L226 Difference]: Without dead ends: 1341 [2022-07-21 15:48:57,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:48:57,913 INFO L413 NwaCegarLoop]: 1563 mSDtfsCounter, 3299 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 1987 mSolverCounterSat, 1568 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3374 SdHoareTripleChecker+Valid, 2034 SdHoareTripleChecker+Invalid, 3556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1568 IncrementalHoareTripleChecker+Valid, 1987 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-07-21 15:48:57,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3374 Valid, 2034 Invalid, 3556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1568 Valid, 1987 Invalid, 1 Unknown, 0 Unchecked, 6.3s Time] [2022-07-21 15:48:57,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2022-07-21 15:48:57,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1341. [2022-07-21 15:48:57,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1341 states, 901 states have (on average 1.2896781354051055) internal successors, (1162), 936 states have internal predecessors, (1162), 319 states have call successors, (319), 101 states have call predecessors, (319), 100 states have return successors, (317), 316 states have call predecessors, (317), 317 states have call successors, (317) [2022-07-21 15:48:57,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 1798 transitions. [2022-07-21 15:48:57,962 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 1798 transitions. Word has length 67 [2022-07-21 15:48:57,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:48:57,963 INFO L495 AbstractCegarLoop]: Abstraction has 1341 states and 1798 transitions. [2022-07-21 15:48:57,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-21 15:48:57,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1798 transitions. [2022-07-21 15:48:57,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-21 15:48:57,964 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:48:57,964 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-21 15:48:57,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 15:48:57,965 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-07-21 15:48:57,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:48:57,965 INFO L85 PathProgramCache]: Analyzing trace with hash -160386052, now seen corresponding path program 1 times [2022-07-21 15:48:57,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:48:57,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627695930] [2022-07-21 15:48:57,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:48:57,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:48:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:58,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:48:58,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:58,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:48:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:58,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:48:58,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:58,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:48:58,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:58,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:48:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:58,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:48:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:58,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:48:58,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:58,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 15:48:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:58,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 15:48:58,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:58,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:48:58,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:58,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:48:58,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:58,259 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-21 15:48:58,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:48:58,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627695930] [2022-07-21 15:48:58,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627695930] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:48:58,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:48:58,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:48:58,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807517643] [2022-07-21 15:48:58,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:48:58,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:48:58,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:48:58,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:48:58,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:48:58,262 INFO L87 Difference]: Start difference. First operand 1341 states and 1798 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-21 15:49:01,580 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:49:04,974 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:49:06,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:49:06,151 INFO L93 Difference]: Finished difference Result 1341 states and 1798 transitions. [2022-07-21 15:49:06,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:49:06,152 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 73 [2022-07-21 15:49:06,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:49:06,158 INFO L225 Difference]: With dead ends: 1341 [2022-07-21 15:49:06,158 INFO L226 Difference]: Without dead ends: 1339 [2022-07-21 15:49:06,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:49:06,160 INFO L413 NwaCegarLoop]: 1561 mSDtfsCounter, 3293 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 1984 mSolverCounterSat, 1568 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3367 SdHoareTripleChecker+Valid, 2032 SdHoareTripleChecker+Invalid, 3554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1568 IncrementalHoareTripleChecker+Valid, 1984 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-07-21 15:49:06,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3367 Valid, 2032 Invalid, 3554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1568 Valid, 1984 Invalid, 2 Unknown, 0 Unchecked, 7.7s Time] [2022-07-21 15:49:06,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2022-07-21 15:49:06,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1339. [2022-07-21 15:49:06,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1339 states, 900 states have (on average 1.288888888888889) internal successors, (1160), 934 states have internal predecessors, (1160), 319 states have call successors, (319), 101 states have call predecessors, (319), 100 states have return successors, (317), 316 states have call predecessors, (317), 317 states have call successors, (317) [2022-07-21 15:49:06,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 1796 transitions. [2022-07-21 15:49:06,212 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 1796 transitions. Word has length 73 [2022-07-21 15:49:06,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:49:06,213 INFO L495 AbstractCegarLoop]: Abstraction has 1339 states and 1796 transitions. [2022-07-21 15:49:06,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-21 15:49:06,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 1796 transitions. [2022-07-21 15:49:06,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-21 15:49:06,218 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:49:06,218 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-21 15:49:06,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 15:49:06,219 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-07-21 15:49:06,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:49:06,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1154737015, now seen corresponding path program 1 times [2022-07-21 15:49:06,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:49:06,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114293046] [2022-07-21 15:49:06,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:49:06,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:49:06,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:06,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:49:06,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:06,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:49:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:06,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:49:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:06,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:49:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:06,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:49:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:06,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:49:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:06,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:49:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:06,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 15:49:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:06,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 15:49:06,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:06,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:49:06,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:06,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:49:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:06,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:49:06,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:06,525 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-21 15:49:06,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:49:06,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114293046] [2022-07-21 15:49:06,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114293046] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:49:06,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:49:06,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:49:06,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404072739] [2022-07-21 15:49:06,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:49:06,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:49:06,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:49:06,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:49:06,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:49:06,527 INFO L87 Difference]: Start difference. First operand 1339 states and 1796 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-21 15:49:09,986 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:49:13,209 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:49:14,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:49:14,293 INFO L93 Difference]: Finished difference Result 1339 states and 1796 transitions. [2022-07-21 15:49:14,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:49:14,294 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 79 [2022-07-21 15:49:14,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:49:14,299 INFO L225 Difference]: With dead ends: 1339 [2022-07-21 15:49:14,300 INFO L226 Difference]: Without dead ends: 1337 [2022-07-21 15:49:14,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:49:14,301 INFO L413 NwaCegarLoop]: 1559 mSDtfsCounter, 3287 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 1982 mSolverCounterSat, 1568 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3360 SdHoareTripleChecker+Valid, 2030 SdHoareTripleChecker+Invalid, 3552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1568 IncrementalHoareTripleChecker+Valid, 1982 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-07-21 15:49:14,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3360 Valid, 2030 Invalid, 3552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1568 Valid, 1982 Invalid, 2 Unknown, 0 Unchecked, 7.6s Time] [2022-07-21 15:49:14,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1337 states. [2022-07-21 15:49:14,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1337 to 1337. [2022-07-21 15:49:14,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1337 states, 899 states have (on average 1.2880978865406008) internal successors, (1158), 932 states have internal predecessors, (1158), 319 states have call successors, (319), 101 states have call predecessors, (319), 100 states have return successors, (317), 316 states have call predecessors, (317), 317 states have call successors, (317) [2022-07-21 15:49:14,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1794 transitions. [2022-07-21 15:49:14,353 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1794 transitions. Word has length 79 [2022-07-21 15:49:14,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:49:14,353 INFO L495 AbstractCegarLoop]: Abstraction has 1337 states and 1794 transitions. [2022-07-21 15:49:14,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-21 15:49:14,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1794 transitions. [2022-07-21 15:49:14,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-21 15:49:14,354 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:49:14,355 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-21 15:49:14,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 15:49:14,355 INFO L420 AbstractCegarLoop]: === Iteration 7 === 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 23 more)] === [2022-07-21 15:49:14,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:49:14,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1225443709, now seen corresponding path program 1 times [2022-07-21 15:49:14,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:49:14,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900686653] [2022-07-21 15:49:14,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:49:14,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:49:14,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:14,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:49:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:14,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:49:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:14,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:49:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:14,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:49:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:14,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:49:14,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:14,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:49:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:14,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:49:14,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:14,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 15:49:14,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:14,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 15:49:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:14,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:49:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:14,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:49:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:14,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:49:14,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:14,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:49:14,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:14,664 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-21 15:49:14,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:49:14,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900686653] [2022-07-21 15:49:14,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900686653] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:49:14,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:49:14,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:49:14,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031676490] [2022-07-21 15:49:14,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:49:14,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:49:14,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:49:14,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:49:14,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:49:14,667 INFO L87 Difference]: Start difference. First operand 1337 states and 1794 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-21 15:49:18,012 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:49:20,360 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:49:21,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:49:21,369 INFO L93 Difference]: Finished difference Result 1337 states and 1794 transitions. [2022-07-21 15:49:21,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:49:21,370 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 85 [2022-07-21 15:49:21,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:49:21,376 INFO L225 Difference]: With dead ends: 1337 [2022-07-21 15:49:21,377 INFO L226 Difference]: Without dead ends: 1335 [2022-07-21 15:49:21,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:49:21,378 INFO L413 NwaCegarLoop]: 1557 mSDtfsCounter, 3281 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 1981 mSolverCounterSat, 1568 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3353 SdHoareTripleChecker+Valid, 2028 SdHoareTripleChecker+Invalid, 3550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1568 IncrementalHoareTripleChecker+Valid, 1981 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-07-21 15:49:21,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3353 Valid, 2028 Invalid, 3550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1568 Valid, 1981 Invalid, 1 Unknown, 0 Unchecked, 6.6s Time] [2022-07-21 15:49:21,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2022-07-21 15:49:21,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1335. [2022-07-21 15:49:21,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1335 states, 898 states have (on average 1.287305122494432) internal successors, (1156), 930 states have internal predecessors, (1156), 319 states have call successors, (319), 101 states have call predecessors, (319), 100 states have return successors, (317), 316 states have call predecessors, (317), 317 states have call successors, (317) [2022-07-21 15:49:21,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1335 states to 1335 states and 1792 transitions. [2022-07-21 15:49:21,475 INFO L78 Accepts]: Start accepts. Automaton has 1335 states and 1792 transitions. Word has length 85 [2022-07-21 15:49:21,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:49:21,475 INFO L495 AbstractCegarLoop]: Abstraction has 1335 states and 1792 transitions. [2022-07-21 15:49:21,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-21 15:49:21,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 1792 transitions. [2022-07-21 15:49:21,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-21 15:49:21,481 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:49:21,481 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-21 15:49:21,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 15:49:21,481 INFO L420 AbstractCegarLoop]: === Iteration 8 === 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 23 more)] === [2022-07-21 15:49:21,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:49:21,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1648352015, now seen corresponding path program 1 times [2022-07-21 15:49:21,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:49:21,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204990753] [2022-07-21 15:49:21,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:49:21,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:49:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:21,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:49:21,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:21,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:49:21,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:21,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:49:21,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:21,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:49:21,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:21,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:49:21,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:21,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:49:21,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:21,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:49:21,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:21,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 15:49:21,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:21,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 15:49:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:21,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:49:21,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:21,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:49:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:21,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:49:21,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:21,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:49:21,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:21,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 15:49:21,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:21,801 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-21 15:49:21,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:49:21,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204990753] [2022-07-21 15:49:21,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204990753] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:49:21,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:49:21,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:49:21,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137700925] [2022-07-21 15:49:21,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:49:21,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:49:21,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:49:21,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:49:21,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:49:21,803 INFO L87 Difference]: Start difference. First operand 1335 states and 1792 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-21 15:49:24,811 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:49:27,034 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:49:28,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:49:28,083 INFO L93 Difference]: Finished difference Result 1335 states and 1792 transitions. [2022-07-21 15:49:28,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:49:28,083 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 91 [2022-07-21 15:49:28,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:49:28,090 INFO L225 Difference]: With dead ends: 1335 [2022-07-21 15:49:28,090 INFO L226 Difference]: Without dead ends: 1333 [2022-07-21 15:49:28,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:49:28,092 INFO L413 NwaCegarLoop]: 1555 mSDtfsCounter, 3279 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 1976 mSolverCounterSat, 1568 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3350 SdHoareTripleChecker+Valid, 2026 SdHoareTripleChecker+Invalid, 3544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1568 IncrementalHoareTripleChecker+Valid, 1976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-07-21 15:49:28,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3350 Valid, 2026 Invalid, 3544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1568 Valid, 1976 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-07-21 15:49:28,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2022-07-21 15:49:28,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 1333. [2022-07-21 15:49:28,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1333 states, 897 states have (on average 1.286510590858417) internal successors, (1154), 928 states have internal predecessors, (1154), 319 states have call successors, (319), 101 states have call predecessors, (319), 100 states have return successors, (317), 316 states have call predecessors, (317), 317 states have call successors, (317) [2022-07-21 15:49:28,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1790 transitions. [2022-07-21 15:49:28,196 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1790 transitions. Word has length 91 [2022-07-21 15:49:28,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:49:28,196 INFO L495 AbstractCegarLoop]: Abstraction has 1333 states and 1790 transitions. [2022-07-21 15:49:28,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-21 15:49:28,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1790 transitions. [2022-07-21 15:49:28,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-21 15:49:28,198 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:49:28,199 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] [2022-07-21 15:49:28,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 15:49:28,199 INFO L420 AbstractCegarLoop]: === Iteration 9 === 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 23 more)] === [2022-07-21 15:49:28,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:49:28,199 INFO L85 PathProgramCache]: Analyzing trace with hash 776790548, now seen corresponding path program 1 times [2022-07-21 15:49:28,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:49:28,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047445322] [2022-07-21 15:49:28,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:49:28,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:49:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:28,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:49:28,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:28,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:49:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:28,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:49:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:28,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:49:28,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:28,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:49:28,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:28,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:49:28,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:28,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:49:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:28,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 15:49:28,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:28,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 15:49:28,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:28,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:49:28,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:28,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:49:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:28,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:49:28,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:28,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:49:28,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:28,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 15:49:28,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:28,496 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-21 15:49:28,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:49:28,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047445322] [2022-07-21 15:49:28,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047445322] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:49:28,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:49:28,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:49:28,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382862664] [2022-07-21 15:49:28,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:49:28,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:49:28,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:49:28,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:49:28,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:49:28,499 INFO L87 Difference]: Start difference. First operand 1333 states and 1790 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-21 15:49:33,707 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:49:34,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:49:34,759 INFO L93 Difference]: Finished difference Result 1333 states and 1790 transitions. [2022-07-21 15:49:34,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:49:34,760 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 93 [2022-07-21 15:49:34,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:49:34,767 INFO L225 Difference]: With dead ends: 1333 [2022-07-21 15:49:34,767 INFO L226 Difference]: Without dead ends: 1331 [2022-07-21 15:49:34,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:49:34,768 INFO L413 NwaCegarLoop]: 1553 mSDtfsCounter, 3267 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 1977 mSolverCounterSat, 1568 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3338 SdHoareTripleChecker+Valid, 2024 SdHoareTripleChecker+Invalid, 3546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1568 IncrementalHoareTripleChecker+Valid, 1977 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-07-21 15:49:34,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3338 Valid, 2024 Invalid, 3546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1568 Valid, 1977 Invalid, 1 Unknown, 0 Unchecked, 6.1s Time] [2022-07-21 15:49:34,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2022-07-21 15:49:34,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1331. [2022-07-21 15:49:34,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1331 states, 896 states have (on average 1.2857142857142858) internal successors, (1152), 926 states have internal predecessors, (1152), 319 states have call successors, (319), 101 states have call predecessors, (319), 100 states have return successors, (317), 316 states have call predecessors, (317), 317 states have call successors, (317) [2022-07-21 15:49:34,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 1788 transitions. [2022-07-21 15:49:34,867 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 1788 transitions. Word has length 93 [2022-07-21 15:49:34,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:49:34,868 INFO L495 AbstractCegarLoop]: Abstraction has 1331 states and 1788 transitions. [2022-07-21 15:49:34,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-21 15:49:34,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1788 transitions. [2022-07-21 15:49:34,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-21 15:49:34,870 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:49:34,870 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] [2022-07-21 15:49:34,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 15:49:34,872 INFO L420 AbstractCegarLoop]: === Iteration 10 === 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 23 more)] === [2022-07-21 15:49:34,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:49:34,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1686698121, now seen corresponding path program 1 times [2022-07-21 15:49:34,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:49:34,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417291341] [2022-07-21 15:49:34,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:49:34,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:49:34,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:35,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:49:35,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:35,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:49:35,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:35,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:49:35,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:35,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:49:35,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:35,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:49:35,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:35,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:49:35,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:35,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:49:35,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:35,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 15:49:35,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:35,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 15:49:35,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:35,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:49:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:35,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:49:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:35,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:49:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:35,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:49:35,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:35,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 15:49:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:35,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 15:49:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:35,160 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-21 15:49:35,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:49:35,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417291341] [2022-07-21 15:49:35,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417291341] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:49:35,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:49:35,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:49:35,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846480079] [2022-07-21 15:49:35,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:49:35,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:49:35,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:49:35,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:49:35,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:49:35,162 INFO L87 Difference]: Start difference. First operand 1331 states and 1788 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-21 15:49:39,887 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:49:40,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:49:40,885 INFO L93 Difference]: Finished difference Result 1331 states and 1788 transitions. [2022-07-21 15:49:40,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:49:40,886 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 99 [2022-07-21 15:49:40,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:49:40,892 INFO L225 Difference]: With dead ends: 1331 [2022-07-21 15:49:40,892 INFO L226 Difference]: Without dead ends: 1329 [2022-07-21 15:49:40,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:49:40,894 INFO L413 NwaCegarLoop]: 1551 mSDtfsCounter, 3263 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 1976 mSolverCounterSat, 1568 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3333 SdHoareTripleChecker+Valid, 2022 SdHoareTripleChecker+Invalid, 3544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1568 IncrementalHoareTripleChecker+Valid, 1976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-07-21 15:49:40,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3333 Valid, 2022 Invalid, 3544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1568 Valid, 1976 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-07-21 15:49:40,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2022-07-21 15:49:40,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1329. [2022-07-21 15:49:40,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1329 states, 895 states have (on average 1.2849162011173185) internal successors, (1150), 924 states have internal predecessors, (1150), 319 states have call successors, (319), 101 states have call predecessors, (319), 100 states have return successors, (317), 316 states have call predecessors, (317), 317 states have call successors, (317) [2022-07-21 15:49:40,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 1786 transitions. [2022-07-21 15:49:40,988 INFO L78 Accepts]: Start accepts. Automaton has 1329 states and 1786 transitions. Word has length 99 [2022-07-21 15:49:40,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:49:40,989 INFO L495 AbstractCegarLoop]: Abstraction has 1329 states and 1786 transitions. [2022-07-21 15:49:40,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-21 15:49:40,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1786 transitions. [2022-07-21 15:49:40,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-21 15:49:40,991 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:49:40,992 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-21 15:49:40,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 15:49:40,992 INFO L420 AbstractCegarLoop]: === Iteration 11 === 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 23 more)] === [2022-07-21 15:49:40,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:49:40,993 INFO L85 PathProgramCache]: Analyzing trace with hash -945850592, now seen corresponding path program 1 times [2022-07-21 15:49:40,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:49:40,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102411550] [2022-07-21 15:49:40,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:49:40,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:49:41,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:41,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:49:41,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:41,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:49:41,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:41,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:49:41,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:41,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:49:41,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:41,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:49:41,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:41,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:49:41,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:41,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:49:41,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:41,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 15:49:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:41,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 15:49:41,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:41,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:49:41,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:41,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:49:41,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:41,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:49:41,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:41,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:49:41,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:41,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 15:49:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:41,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 15:49:41,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:41,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:49:41,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:41,281 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-21 15:49:41,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:49:41,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102411550] [2022-07-21 15:49:41,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102411550] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:49:41,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:49:41,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:49:41,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679083066] [2022-07-21 15:49:41,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:49:41,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:49:41,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:49:41,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:49:41,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:49:41,284 INFO L87 Difference]: Start difference. First operand 1329 states and 1786 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-21 15:49:45,756 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:49:46,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:49:46,790 INFO L93 Difference]: Finished difference Result 1329 states and 1786 transitions. [2022-07-21 15:49:46,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:49:46,791 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 105 [2022-07-21 15:49:46,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:49:46,796 INFO L225 Difference]: With dead ends: 1329 [2022-07-21 15:49:46,796 INFO L226 Difference]: Without dead ends: 1327 [2022-07-21 15:49:46,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:49:46,798 INFO L413 NwaCegarLoop]: 1549 mSDtfsCounter, 3257 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 1973 mSolverCounterSat, 1568 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3326 SdHoareTripleChecker+Valid, 2020 SdHoareTripleChecker+Invalid, 3542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1568 IncrementalHoareTripleChecker+Valid, 1973 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-07-21 15:49:46,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3326 Valid, 2020 Invalid, 3542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1568 Valid, 1973 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2022-07-21 15:49:46,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states. [2022-07-21 15:49:46,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 1327. [2022-07-21 15:49:46,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1327 states, 894 states have (on average 1.284116331096197) internal successors, (1148), 922 states have internal predecessors, (1148), 319 states have call successors, (319), 101 states have call predecessors, (319), 100 states have return successors, (317), 316 states have call predecessors, (317), 317 states have call successors, (317) [2022-07-21 15:49:46,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1327 states and 1784 transitions. [2022-07-21 15:49:46,891 INFO L78 Accepts]: Start accepts. Automaton has 1327 states and 1784 transitions. Word has length 105 [2022-07-21 15:49:46,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:49:46,892 INFO L495 AbstractCegarLoop]: Abstraction has 1327 states and 1784 transitions. [2022-07-21 15:49:46,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-21 15:49:46,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 1784 transitions. [2022-07-21 15:49:46,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-21 15:49:46,893 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:49:46,893 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-21 15:49:46,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 15:49:46,894 INFO L420 AbstractCegarLoop]: === Iteration 12 === 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 23 more)] === [2022-07-21 15:49:46,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:49:46,894 INFO L85 PathProgramCache]: Analyzing trace with hash 271687204, now seen corresponding path program 1 times [2022-07-21 15:49:46,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:49:46,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085971803] [2022-07-21 15:49:46,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:49:46,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:49:46,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:47,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:49:47,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:47,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:49:47,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:47,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:49:47,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:47,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:49:47,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:47,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:49:47,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:47,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:49:47,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:47,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:49:47,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:47,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 15:49:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:47,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 15:49:47,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:47,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:49:47,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:47,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:49:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:47,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:49:47,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:47,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:49:47,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:47,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 15:49:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:47,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 15:49:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:47,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:49:47,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:47,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 15:49:47,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:47,160 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-21 15:49:47,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:49:47,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085971803] [2022-07-21 15:49:47,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085971803] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:49:47,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:49:47,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:49:47,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122091599] [2022-07-21 15:49:47,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:49:47,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:49:47,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:49:47,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:49:47,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:49:47,162 INFO L87 Difference]: Start difference. First operand 1327 states and 1784 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-21 15:49:52,139 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:49:53,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:49:53,179 INFO L93 Difference]: Finished difference Result 1327 states and 1784 transitions. [2022-07-21 15:49:53,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:49:53,180 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 111 [2022-07-21 15:49:53,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:49:53,218 INFO L225 Difference]: With dead ends: 1327 [2022-07-21 15:49:53,218 INFO L226 Difference]: Without dead ends: 1325 [2022-07-21 15:49:53,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:49:53,219 INFO L413 NwaCegarLoop]: 1547 mSDtfsCounter, 3251 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 1971 mSolverCounterSat, 1568 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3319 SdHoareTripleChecker+Valid, 2018 SdHoareTripleChecker+Invalid, 3540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1568 IncrementalHoareTripleChecker+Valid, 1971 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-07-21 15:49:53,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3319 Valid, 2018 Invalid, 3540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1568 Valid, 1971 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2022-07-21 15:49:53,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2022-07-21 15:49:53,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 1325. [2022-07-21 15:49:53,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 893 states have (on average 1.2833146696528555) internal successors, (1146), 920 states have internal predecessors, (1146), 319 states have call successors, (319), 101 states have call predecessors, (319), 100 states have return successors, (317), 316 states have call predecessors, (317), 317 states have call successors, (317) [2022-07-21 15:49:53,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1782 transitions. [2022-07-21 15:49:53,277 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1782 transitions. Word has length 111 [2022-07-21 15:49:53,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:49:53,278 INFO L495 AbstractCegarLoop]: Abstraction has 1325 states and 1782 transitions. [2022-07-21 15:49:53,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-21 15:49:53,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1782 transitions. [2022-07-21 15:49:53,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-21 15:49:53,280 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:49:53,280 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-21 15:49:53,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 15:49:53,280 INFO L420 AbstractCegarLoop]: === Iteration 13 === 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 23 more)] === [2022-07-21 15:49:53,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:49:53,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1218114242, now seen corresponding path program 1 times [2022-07-21 15:49:53,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:49:53,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819821571] [2022-07-21 15:49:53,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:49:53,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:49:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:53,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:49:53,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:53,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:49:53,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:53,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:49:53,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:53,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:49:53,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:53,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:49:53,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:53,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:49:53,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:53,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:49:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:53,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 15:49:53,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:53,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 15:49:53,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:53,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:49:53,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:53,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:49:53,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:53,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:49:53,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:53,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:49:53,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:53,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 15:49:53,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:53,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 15:49:53,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:53,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:49:53,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:53,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 15:49:53,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:53,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 15:49:53,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:53,565 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-21 15:49:53,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:49:53,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819821571] [2022-07-21 15:49:53,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819821571] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:49:53,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:49:53,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:49:53,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851501635] [2022-07-21 15:49:53,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:49:53,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:49:53,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:49:53,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:49:53,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:49:53,568 INFO L87 Difference]: Start difference. First operand 1325 states and 1782 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-21 15:49:57,187 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:50:00,390 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:50:01,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:50:01,417 INFO L93 Difference]: Finished difference Result 1325 states and 1782 transitions. [2022-07-21 15:50:01,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:50:01,417 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 117 [2022-07-21 15:50:01,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:50:01,423 INFO L225 Difference]: With dead ends: 1325 [2022-07-21 15:50:01,423 INFO L226 Difference]: Without dead ends: 1323 [2022-07-21 15:50:01,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:50:01,424 INFO L413 NwaCegarLoop]: 1545 mSDtfsCounter, 3245 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 1968 mSolverCounterSat, 1568 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3312 SdHoareTripleChecker+Valid, 2016 SdHoareTripleChecker+Invalid, 3538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1568 IncrementalHoareTripleChecker+Valid, 1968 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-07-21 15:50:01,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3312 Valid, 2016 Invalid, 3538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1568 Valid, 1968 Invalid, 2 Unknown, 0 Unchecked, 7.7s Time] [2022-07-21 15:50:01,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2022-07-21 15:50:01,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1323. [2022-07-21 15:50:01,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1323 states, 892 states have (on average 1.2825112107623318) internal successors, (1144), 918 states have internal predecessors, (1144), 319 states have call successors, (319), 101 states have call predecessors, (319), 100 states have return successors, (317), 316 states have call predecessors, (317), 317 states have call successors, (317) [2022-07-21 15:50:01,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1323 states and 1780 transitions. [2022-07-21 15:50:01,483 INFO L78 Accepts]: Start accepts. Automaton has 1323 states and 1780 transitions. Word has length 117 [2022-07-21 15:50:01,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:50:01,484 INFO L495 AbstractCegarLoop]: Abstraction has 1323 states and 1780 transitions. [2022-07-21 15:50:01,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-21 15:50:01,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1780 transitions. [2022-07-21 15:50:01,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-21 15:50:01,486 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:50:01,486 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-21 15:50:01,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 15:50:01,486 INFO L420 AbstractCegarLoop]: === Iteration 14 === 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 23 more)] === [2022-07-21 15:50:01,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:50:01,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1396288369, now seen corresponding path program 1 times [2022-07-21 15:50:01,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:50:01,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509501172] [2022-07-21 15:50:01,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:50:01,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:50:01,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:01,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:50:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:01,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:50:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:01,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:50:01,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:01,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:50:01,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:01,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:50:01,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:01,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:50:01,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:01,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:50:01,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:01,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 15:50:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:01,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 15:50:01,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:01,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:50:01,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:01,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:50:01,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:01,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:50:01,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:01,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:50:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:01,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 15:50:01,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:01,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 15:50:01,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:01,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:50:01,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:01,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 15:50:01,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:01,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 15:50:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:01,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 15:50:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:01,810 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-21 15:50:01,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:50:01,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509501172] [2022-07-21 15:50:01,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509501172] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:50:01,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:50:01,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:50:01,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329383778] [2022-07-21 15:50:01,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:50:01,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:50:01,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:50:01,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:50:01,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:50:01,813 INFO L87 Difference]: Start difference. First operand 1323 states and 1780 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-21 15:50:05,220 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:50:08,009 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:50:09,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:50:09,022 INFO L93 Difference]: Finished difference Result 1323 states and 1780 transitions. [2022-07-21 15:50:09,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:50:09,023 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 123 [2022-07-21 15:50:09,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:50:09,027 INFO L225 Difference]: With dead ends: 1323 [2022-07-21 15:50:09,027 INFO L226 Difference]: Without dead ends: 1321 [2022-07-21 15:50:09,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:50:09,028 INFO L413 NwaCegarLoop]: 1543 mSDtfsCounter, 3239 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 1967 mSolverCounterSat, 1568 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3305 SdHoareTripleChecker+Valid, 2014 SdHoareTripleChecker+Invalid, 3536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1568 IncrementalHoareTripleChecker+Valid, 1967 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-07-21 15:50:09,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3305 Valid, 2014 Invalid, 3536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1568 Valid, 1967 Invalid, 1 Unknown, 0 Unchecked, 7.1s Time] [2022-07-21 15:50:09,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2022-07-21 15:50:09,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1321. [2022-07-21 15:50:09,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 891 states have (on average 1.281705948372615) internal successors, (1142), 916 states have internal predecessors, (1142), 319 states have call successors, (319), 101 states have call predecessors, (319), 100 states have return successors, (317), 316 states have call predecessors, (317), 317 states have call successors, (317) [2022-07-21 15:50:09,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1778 transitions. [2022-07-21 15:50:09,087 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1778 transitions. Word has length 123 [2022-07-21 15:50:09,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:50:09,088 INFO L495 AbstractCegarLoop]: Abstraction has 1321 states and 1778 transitions. [2022-07-21 15:50:09,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-21 15:50:09,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1778 transitions. [2022-07-21 15:50:09,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-21 15:50:09,090 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:50:09,090 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-21 15:50:09,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 15:50:09,090 INFO L420 AbstractCegarLoop]: === Iteration 15 === 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 23 more)] === [2022-07-21 15:50:09,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:50:09,091 INFO L85 PathProgramCache]: Analyzing trace with hash -508454391, now seen corresponding path program 1 times [2022-07-21 15:50:09,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:50:09,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759319805] [2022-07-21 15:50:09,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:50:09,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:50:09,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:09,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:50:09,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:09,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:50:09,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:09,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:50:09,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:09,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:50:09,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:09,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:50:09,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:09,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:50:09,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:09,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:50:09,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:09,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 15:50:09,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:09,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 15:50:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:09,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:50:09,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:09,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:50:09,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:09,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:50:09,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:09,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:50:09,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:09,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 15:50:09,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:09,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 15:50:09,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:09,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:50:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:09,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 15:50:09,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:09,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 15:50:09,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:09,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 15:50:09,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:09,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 15:50:09,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:09,489 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-21 15:50:09,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:50:09,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759319805] [2022-07-21 15:50:09,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759319805] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:50:09,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:50:09,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:50:09,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079027753] [2022-07-21 15:50:09,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:50:09,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:50:09,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:50:09,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:50:09,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:50:09,492 INFO L87 Difference]: Start difference. First operand 1321 states and 1778 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-21 15:50:12,943 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:50:16,238 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:50:17,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:50:17,257 INFO L93 Difference]: Finished difference Result 1321 states and 1778 transitions. [2022-07-21 15:50:17,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:50:17,257 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 129 [2022-07-21 15:50:17,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:50:17,261 INFO L225 Difference]: With dead ends: 1321 [2022-07-21 15:50:17,261 INFO L226 Difference]: Without dead ends: 1319 [2022-07-21 15:50:17,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:50:17,262 INFO L413 NwaCegarLoop]: 1541 mSDtfsCounter, 3233 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 1964 mSolverCounterSat, 1568 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3298 SdHoareTripleChecker+Valid, 2012 SdHoareTripleChecker+Invalid, 3534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1568 IncrementalHoareTripleChecker+Valid, 1964 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-07-21 15:50:17,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3298 Valid, 2012 Invalid, 3534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1568 Valid, 1964 Invalid, 2 Unknown, 0 Unchecked, 7.6s Time] [2022-07-21 15:50:17,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2022-07-21 15:50:17,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1319. [2022-07-21 15:50:17,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 890 states have (on average 1.2808988764044944) internal successors, (1140), 914 states have internal predecessors, (1140), 319 states have call successors, (319), 101 states have call predecessors, (319), 100 states have return successors, (317), 316 states have call predecessors, (317), 317 states have call successors, (317) [2022-07-21 15:50:17,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1776 transitions. [2022-07-21 15:50:17,325 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1776 transitions. Word has length 129 [2022-07-21 15:50:17,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:50:17,325 INFO L495 AbstractCegarLoop]: Abstraction has 1319 states and 1776 transitions. [2022-07-21 15:50:17,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-21 15:50:17,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1776 transitions. [2022-07-21 15:50:17,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-21 15:50:17,327 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:50:17,328 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-21 15:50:17,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 15:50:17,328 INFO L420 AbstractCegarLoop]: === Iteration 16 === 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 23 more)] === [2022-07-21 15:50:17,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:50:17,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1304382107, now seen corresponding path program 1 times [2022-07-21 15:50:17,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:50:17,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564509230] [2022-07-21 15:50:17,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:50:17,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:50:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:17,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:50:17,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:17,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:50:17,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:17,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:50:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:17,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:50:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:17,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:50:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:17,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:50:17,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:17,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:50:17,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:17,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 15:50:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:17,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 15:50:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:17,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:50:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:17,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:50:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:17,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:50:17,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:17,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:50:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:17,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 15:50:17,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:17,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 15:50:17,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:17,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:50:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:17,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 15:50:17,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:17,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 15:50:17,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:17,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 15:50:17,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:17,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 15:50:17,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:17,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 15:50:17,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:17,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-21 15:50:17,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:50:17,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564509230] [2022-07-21 15:50:17,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564509230] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:50:17,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:50:17,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:50:17,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008563711] [2022-07-21 15:50:17,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:50:17,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:50:17,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:50:17,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:50:17,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:50:17,697 INFO L87 Difference]: Start difference. First operand 1319 states and 1776 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-21 15:50:20,853 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:50:24,115 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:50:25,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:50:25,065 INFO L93 Difference]: Finished difference Result 1319 states and 1776 transitions. [2022-07-21 15:50:25,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:50:25,066 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 135 [2022-07-21 15:50:25,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:50:25,070 INFO L225 Difference]: With dead ends: 1319 [2022-07-21 15:50:25,070 INFO L226 Difference]: Without dead ends: 1317 [2022-07-21 15:50:25,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:50:25,071 INFO L413 NwaCegarLoop]: 1539 mSDtfsCounter, 3227 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 1962 mSolverCounterSat, 1568 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3291 SdHoareTripleChecker+Valid, 2010 SdHoareTripleChecker+Invalid, 3532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1568 IncrementalHoareTripleChecker+Valid, 1962 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-07-21 15:50:25,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3291 Valid, 2010 Invalid, 3532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1568 Valid, 1962 Invalid, 2 Unknown, 0 Unchecked, 7.2s Time] [2022-07-21 15:50:25,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2022-07-21 15:50:25,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 1317. [2022-07-21 15:50:25,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1317 states, 889 states have (on average 1.2800899887514061) internal successors, (1138), 912 states have internal predecessors, (1138), 319 states have call successors, (319), 101 states have call predecessors, (319), 100 states have return successors, (317), 316 states have call predecessors, (317), 317 states have call successors, (317) [2022-07-21 15:50:25,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1774 transitions. [2022-07-21 15:50:25,135 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1774 transitions. Word has length 135 [2022-07-21 15:50:25,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:50:25,136 INFO L495 AbstractCegarLoop]: Abstraction has 1317 states and 1774 transitions. [2022-07-21 15:50:25,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-21 15:50:25,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1774 transitions. [2022-07-21 15:50:25,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-21 15:50:25,138 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:50:25,138 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-21 15:50:25,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-21 15:50:25,139 INFO L420 AbstractCegarLoop]: === Iteration 17 === 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 23 more)] === [2022-07-21 15:50:25,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:50:25,139 INFO L85 PathProgramCache]: Analyzing trace with hash -2112872886, now seen corresponding path program 1 times [2022-07-21 15:50:25,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:50:25,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527124874] [2022-07-21 15:50:25,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:50:25,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:50:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:25,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:50:25,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:25,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:50:25,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:25,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:50:25,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:25,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:50:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:25,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:50:25,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:25,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:50:25,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:25,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:50:25,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:25,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 15:50:25,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:25,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 15:50:25,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:25,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:50:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:25,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:50:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:25,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:50:25,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:25,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:50:25,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:25,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 15:50:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:25,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 15:50:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:25,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:50:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:25,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 15:50:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:25,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 15:50:25,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:25,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 15:50:25,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:25,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 15:50:25,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:25,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 15:50:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:25,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-21 15:50:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:25,456 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-21 15:50:25,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:50:25,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527124874] [2022-07-21 15:50:25,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527124874] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:50:25,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:50:25,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:50:25,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055284078] [2022-07-21 15:50:25,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:50:25,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:50:25,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:50:25,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:50:25,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:50:25,458 INFO L87 Difference]: Start difference. First operand 1317 states and 1774 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-21 15:50:29,100 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:50:32,185 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:50:33,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:50:33,164 INFO L93 Difference]: Finished difference Result 1317 states and 1774 transitions. [2022-07-21 15:50:33,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:50:33,165 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 141 [2022-07-21 15:50:33,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:50:33,169 INFO L225 Difference]: With dead ends: 1317 [2022-07-21 15:50:33,170 INFO L226 Difference]: Without dead ends: 1315 [2022-07-21 15:50:33,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:50:33,171 INFO L413 NwaCegarLoop]: 1537 mSDtfsCounter, 3221 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 1961 mSolverCounterSat, 1568 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3284 SdHoareTripleChecker+Valid, 2008 SdHoareTripleChecker+Invalid, 3530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1568 IncrementalHoareTripleChecker+Valid, 1961 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-07-21 15:50:33,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3284 Valid, 2008 Invalid, 3530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1568 Valid, 1961 Invalid, 1 Unknown, 0 Unchecked, 7.5s Time] [2022-07-21 15:50:33,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2022-07-21 15:50:33,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1315. [2022-07-21 15:50:33,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1315 states, 888 states have (on average 1.2792792792792793) internal successors, (1136), 910 states have internal predecessors, (1136), 319 states have call successors, (319), 101 states have call predecessors, (319), 100 states have return successors, (317), 316 states have call predecessors, (317), 317 states have call successors, (317) [2022-07-21 15:50:33,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1315 states and 1772 transitions. [2022-07-21 15:50:33,237 INFO L78 Accepts]: Start accepts. Automaton has 1315 states and 1772 transitions. Word has length 141 [2022-07-21 15:50:33,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:50:33,237 INFO L495 AbstractCegarLoop]: Abstraction has 1315 states and 1772 transitions. [2022-07-21 15:50:33,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-21 15:50:33,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 1772 transitions. [2022-07-21 15:50:33,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-21 15:50:33,240 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:50:33,240 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:50:33,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-21 15:50:33,240 INFO L420 AbstractCegarLoop]: === Iteration 18 === 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 23 more)] === [2022-07-21 15:50:33,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:50:33,241 INFO L85 PathProgramCache]: Analyzing trace with hash 163115201, now seen corresponding path program 1 times [2022-07-21 15:50:33,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:50:33,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713517516] [2022-07-21 15:50:33,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:50:33,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:50:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:33,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:50:33,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:33,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:50:33,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:33,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:50:33,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:33,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:50:33,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:33,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:50:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:33,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:50:33,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:33,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:50:33,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:33,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:50:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:33,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 15:50:33,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:33,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:50:33,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:33,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:50:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:33,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:50:33,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:33,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 15:50:33,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:33,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:50:33,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:33,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:50:33,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:33,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:50:33,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:33,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:50:33,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:33,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:50:33,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:33,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:50:33,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:33,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:50:33,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:33,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 15:50:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:33,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 15:50:33,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:33,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 15:50:33,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:33,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-21 15:50:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:33,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:50:33,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:33,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 15:50:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:33,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-21 15:50:33,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:33,806 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2022-07-21 15:50:33,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:50:33,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713517516] [2022-07-21 15:50:33,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713517516] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:50:33,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:50:33,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-21 15:50:33,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96737353] [2022-07-21 15:50:33,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:50:33,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 15:50:33,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:50:33,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 15:50:33,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-21 15:50:33,809 INFO L87 Difference]: Start difference. First operand 1315 states and 1772 transitions. Second operand has 12 states, 11 states have (on average 6.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (26), 6 states have call predecessors, (26), 3 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) [2022-07-21 15:50:37,396 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:50:46,666 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:50:48,614 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:50:49,622 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:50:52,111 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:50:58,688 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:51:00,723 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:51:02,753 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:51:04,781 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:51:05,839 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:51:07,881 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:51:09,910 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:51:11,947 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:51:15,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:51:15,183 INFO L93 Difference]: Finished difference Result 2791 states and 3983 transitions. [2022-07-21 15:51:15,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-21 15:51:15,183 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (26), 6 states have call predecessors, (26), 3 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) Word has length 169 [2022-07-21 15:51:15,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:51:15,193 INFO L225 Difference]: With dead ends: 2791 [2022-07-21 15:51:15,193 INFO L226 Difference]: Without dead ends: 1531 [2022-07-21 15:51:15,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=482, Unknown=0, NotChecked=0, Total=650 [2022-07-21 15:51:15,200 INFO L413 NwaCegarLoop]: 1462 mSDtfsCounter, 3126 mSDsluCounter, 1796 mSDsCounter, 0 mSdLazyCounter, 12625 mSolverCounterSat, 2374 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3126 SdHoareTripleChecker+Valid, 3258 SdHoareTripleChecker+Invalid, 15006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2374 IncrementalHoareTripleChecker+Valid, 12625 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.7s IncrementalHoareTripleChecker+Time [2022-07-21 15:51:15,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3126 Valid, 3258 Invalid, 15006 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2374 Valid, 12625 Invalid, 7 Unknown, 0 Unchecked, 40.7s Time] [2022-07-21 15:51:15,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2022-07-21 15:51:15,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1318. [2022-07-21 15:51:15,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1318 states, 890 states have (on average 1.2786516853932584) internal successors, (1138), 911 states have internal predecessors, (1138), 320 states have call successors, (320), 101 states have call predecessors, (320), 100 states have return successors, (318), 317 states have call predecessors, (318), 318 states have call successors, (318) [2022-07-21 15:51:15,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 1776 transitions. [2022-07-21 15:51:15,291 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 1776 transitions. Word has length 169 [2022-07-21 15:51:15,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:51:15,291 INFO L495 AbstractCegarLoop]: Abstraction has 1318 states and 1776 transitions. [2022-07-21 15:51:15,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (26), 6 states have call predecessors, (26), 3 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) [2022-07-21 15:51:15,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1776 transitions. [2022-07-21 15:51:15,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-21 15:51:15,294 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:51:15,294 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:51:15,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-21 15:51:15,295 INFO L420 AbstractCegarLoop]: === Iteration 19 === 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 23 more)] === [2022-07-21 15:51:15,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:51:15,295 INFO L85 PathProgramCache]: Analyzing trace with hash -245709024, now seen corresponding path program 1 times [2022-07-21 15:51:15,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:51:15,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309551636] [2022-07-21 15:51:15,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:51:15,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:51:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:15,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:51:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:15,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:51:15,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:15,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:51:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:15,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:51:15,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:15,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:51:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:15,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:51:15,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:15,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:51:15,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:15,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:51:15,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:15,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 15:51:15,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:15,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:51:15,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:15,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:51:15,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:15,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:51:15,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:15,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 15:51:15,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:15,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:51:15,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:15,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:51:15,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:15,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:51:15,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:15,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:51:15,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:15,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:51:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:15,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:51:15,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:15,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:51:15,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:15,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 15:51:15,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:15,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 15:51:15,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:15,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 15:51:15,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:15,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-21 15:51:15,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:15,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:51:15,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:15,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 15:51:15,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:15,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-21 15:51:15,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:15,711 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2022-07-21 15:51:15,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:51:15,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309551636] [2022-07-21 15:51:15,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309551636] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:51:15,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:51:15,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 15:51:15,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413666200] [2022-07-21 15:51:15,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:51:15,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 15:51:15,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:51:15,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 15:51:15,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-21 15:51:15,715 INFO L87 Difference]: Start difference. First operand 1318 states and 1776 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (26), 6 states have call predecessors, (26), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2022-07-21 15:51:19,374 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:51:24,357 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:51:26,392 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:51:29,163 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:51:35,122 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:51:37,155 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:51:39,186 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:51:41,231 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:51:42,431 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:51:44,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:51:44,815 INFO L93 Difference]: Finished difference Result 2811 states and 3886 transitions. [2022-07-21 15:51:44,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 15:51:44,816 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (26), 6 states have call predecessors, (26), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 169 [2022-07-21 15:51:44,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:51:44,824 INFO L225 Difference]: With dead ends: 2811 [2022-07-21 15:51:44,824 INFO L226 Difference]: Without dead ends: 1548 [2022-07-21 15:51:44,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2022-07-21 15:51:44,831 INFO L413 NwaCegarLoop]: 1476 mSDtfsCounter, 3145 mSDsluCounter, 1151 mSDsCounter, 0 mSdLazyCounter, 7796 mSolverCounterSat, 2301 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3145 SdHoareTripleChecker+Valid, 2627 SdHoareTripleChecker+Invalid, 10104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2301 IncrementalHoareTripleChecker+Valid, 7796 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.7s IncrementalHoareTripleChecker+Time [2022-07-21 15:51:44,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3145 Valid, 2627 Invalid, 10104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2301 Valid, 7796 Invalid, 7 Unknown, 0 Unchecked, 28.7s Time] [2022-07-21 15:51:44,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2022-07-21 15:51:44,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1334. [2022-07-21 15:51:44,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1334 states, 901 states have (on average 1.2785793562708103) internal successors, (1152), 922 states have internal predecessors, (1152), 324 states have call successors, (324), 102 states have call predecessors, (324), 101 states have return successors, (330), 321 states have call predecessors, (330), 322 states have call successors, (330) [2022-07-21 15:51:44,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1334 states and 1806 transitions. [2022-07-21 15:51:44,926 INFO L78 Accepts]: Start accepts. Automaton has 1334 states and 1806 transitions. Word has length 169 [2022-07-21 15:51:44,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:51:44,927 INFO L495 AbstractCegarLoop]: Abstraction has 1334 states and 1806 transitions. [2022-07-21 15:51:44,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (26), 6 states have call predecessors, (26), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2022-07-21 15:51:44,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1806 transitions. [2022-07-21 15:51:44,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-21 15:51:44,929 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:51:44,929 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:51:44,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-21 15:51:44,930 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 23 more)] === [2022-07-21 15:51:44,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:51:44,930 INFO L85 PathProgramCache]: Analyzing trace with hash 434349346, now seen corresponding path program 1 times [2022-07-21 15:51:44,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:51:44,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601136257] [2022-07-21 15:51:44,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:51:44,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:51:45,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:45,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:51:45,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:45,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:51:45,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:45,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:51:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:45,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:51:45,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:45,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:51:45,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:45,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:51:45,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:45,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:51:45,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:45,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:51:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:45,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 15:51:45,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:45,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:51:45,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:45,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:51:45,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:45,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:51:45,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:45,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 15:51:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:45,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:51:45,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:45,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:51:45,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:45,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:51:45,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:45,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:51:45,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:45,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:51:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:45,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:51:45,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:45,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:51:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:45,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 15:51:45,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:45,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 15:51:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:45,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 15:51:45,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:45,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-21 15:51:45,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:45,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:51:45,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:45,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 15:51:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:45,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-21 15:51:45,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:51:45,370 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2022-07-21 15:51:45,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:51:45,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601136257] [2022-07-21 15:51:45,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601136257] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:51:45,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:51:45,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 15:51:45,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589058796] [2022-07-21 15:51:45,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:51:45,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 15:51:45,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:51:45,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 15:51:45,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-21 15:51:45,373 INFO L87 Difference]: Start difference. First operand 1334 states and 1806 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (26), 7 states have call predecessors, (26), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-21 15:51:47,632 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:51:49,241 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:51:52,318 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:51:55,098 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:51:57,135 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:52:01,622 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:52:04,279 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:52:08,049 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:52:10,092 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []