./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 f4b24e32 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-?-f4b24e3 [2022-07-14 04:56:56,224 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 04:56:56,226 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 04:56:56,246 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 04:56:56,249 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 04:56:56,250 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 04:56:56,251 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 04:56:56,254 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 04:56:56,257 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 04:56:56,258 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 04:56:56,258 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 04:56:56,259 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 04:56:56,260 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 04:56:56,263 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 04:56:56,263 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 04:56:56,265 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 04:56:56,266 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 04:56:56,270 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 04:56:56,272 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 04:56:56,273 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 04:56:56,273 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 04:56:56,274 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 04:56:56,288 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 04:56:56,288 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 04:56:56,289 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 04:56:56,291 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 04:56:56,291 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 04:56:56,291 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 04:56:56,292 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 04:56:56,292 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 04:56:56,293 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 04:56:56,293 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 04:56:56,293 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 04:56:56,294 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 04:56:56,294 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 04:56:56,295 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 04:56:56,295 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 04:56:56,296 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 04:56:56,296 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 04:56:56,296 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 04:56:56,296 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 04:56:56,298 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 04:56:56,298 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-14 04:56:56,328 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 04:56:56,328 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 04:56:56,329 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 04:56:56,329 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 04:56:56,329 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 04:56:56,330 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 04:56:56,330 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 04:56:56,330 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 04:56:56,330 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 04:56:56,331 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 04:56:56,331 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 04:56:56,331 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 04:56:56,331 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 04:56:56,332 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 04:56:56,332 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 04:56:56,332 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 04:56:56,332 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 04:56:56,332 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 04:56:56,332 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 04:56:56,333 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 04:56:56,333 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 04:56:56,333 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 04:56:56,334 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 04:56:56,334 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 04:56:56,334 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 04:56:56,334 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 04:56:56,334 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 04:56:56,334 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-14 04:56:56,335 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-14 04:56:56,335 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 04:56:56,335 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-14 04:56:56,514 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 04:56:56,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 04:56:56,540 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 04:56:56,541 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 04:56:56,541 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 04:56:56,542 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-14 04:56:56,591 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5805ed7a7/965d8fb29ed5473daad0f876a7ec1939/FLAGaa9b11d93 [2022-07-14 04:56:57,280 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 04:56:57,281 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-14 04:56:57,317 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5805ed7a7/965d8fb29ed5473daad0f876a7ec1939/FLAGaa9b11d93 [2022-07-14 04:56:57,585 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5805ed7a7/965d8fb29ed5473daad0f876a7ec1939 [2022-07-14 04:56:57,588 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 04:56:57,588 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 04:56:57,590 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 04:56:57,591 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 04:56:57,593 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 04:56:57,593 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:56:57" (1/1) ... [2022-07-14 04:56:57,594 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40c59866 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:56:57, skipping insertion in model container [2022-07-14 04:56:57,595 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:56:57" (1/1) ... [2022-07-14 04:56:57,599 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 04:56:57,707 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 04:57:00,311 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,313 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,314 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,314 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,315 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,315 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,315 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,316 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,316 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,319 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,319 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,319 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,320 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,320 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,320 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,321 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,321 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,322 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,322 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,323 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,323 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,323 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,323 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,324 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,325 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,326 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,326 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,326 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,326 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,327 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,328 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,328 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,329 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,329 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,330 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,330 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,330 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,330 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,331 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,331 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,331 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,332 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,332 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,332 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,332 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,333 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,333 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,334 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,334 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,335 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,335 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,335 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,336 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,336 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,336 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,337 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,337 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,338 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,338 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,338 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,339 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,340 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,340 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,340 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,341 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,341 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,342 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,342 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,342 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,342 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,343 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,343 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,343 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,343 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,344 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,344 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,344 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,345 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,345 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,345 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,345 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,346 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,346 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,346 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,347 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,347 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,347 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,348 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 04:57:00,409 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 04:57:00,743 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,746 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,767 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,770 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,771 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[358223,358236] [2022-07-14 04:57:00,772 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,772 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,772 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,772 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,773 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[358997,359010] [2022-07-14 04:57:00,773 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[359139,359152] [2022-07-14 04:57:00,774 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[359288,359301] [2022-07-14 04:57:00,774 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[359427,359440] [2022-07-14 04:57:00,774 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[359582,359595] [2022-07-14 04:57:00,775 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[359742,359755] [2022-07-14 04:57:00,775 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[359893,359906] [2022-07-14 04:57:00,775 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[360044,360057] [2022-07-14 04:57:00,775 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[360196,360209] [2022-07-14 04:57:00,778 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[360345,360358] [2022-07-14 04:57:00,778 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[360493,360506] [2022-07-14 04:57:00,778 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[360650,360663] [2022-07-14 04:57:00,778 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[360799,360812] [2022-07-14 04:57:00,779 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[360955,360968] [2022-07-14 04:57:00,779 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[361108,361121] [2022-07-14 04:57:00,779 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[361254,361267] [2022-07-14 04:57:00,779 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[361397,361410] [2022-07-14 04:57:00,780 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[361549,361562] [2022-07-14 04:57:00,780 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[361695,361708] [2022-07-14 04:57:00,780 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[361840,361853] [2022-07-14 04:57:00,780 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[361994,362007] [2022-07-14 04:57:00,781 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[362145,362158] [2022-07-14 04:57:00,781 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[362300,362313] [2022-07-14 04:57:00,781 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[362452,362465] [2022-07-14 04:57:00,781 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[362607,362620] [2022-07-14 04:57:00,782 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[362771,362784] [2022-07-14 04:57:00,782 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[362927,362940] [2022-07-14 04:57:00,782 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[363091,363104] [2022-07-14 04:57:00,783 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[363233,363246] [2022-07-14 04:57:00,783 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[363391,363404] [2022-07-14 04:57:00,783 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[363558,363571] [2022-07-14 04:57:00,784 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[363717,363730] [2022-07-14 04:57:00,785 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[363876,363889] [2022-07-14 04:57:00,785 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[364025,364038] [2022-07-14 04:57:00,785 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[364172,364185] [2022-07-14 04:57:00,785 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[364311,364324] [2022-07-14 04:57:00,786 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[364474,364487] [2022-07-14 04:57:00,786 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[364640,364653] [2022-07-14 04:57:00,786 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[364804,364817] [2022-07-14 04:57:00,787 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[364969,364982] [2022-07-14 04:57:00,787 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[365134,365147] [2022-07-14 04:57:00,788 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[365300,365313] [2022-07-14 04:57:00,788 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[365465,365478] [2022-07-14 04:57:00,788 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[365632,365645] [2022-07-14 04:57:00,789 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[365792,365805] [2022-07-14 04:57:00,789 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[365954,365967] [2022-07-14 04:57:00,789 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[366113,366126] [2022-07-14 04:57:00,790 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[366259,366272] [2022-07-14 04:57:00,790 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[366402,366415] [2022-07-14 04:57:00,790 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[366546,366559] [2022-07-14 04:57:00,790 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[366689,366702] [2022-07-14 04:57:00,791 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[366833,366846] [2022-07-14 04:57:00,792 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[366974,366987] [2022-07-14 04:57:00,792 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[367112,367125] [2022-07-14 04:57:00,794 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[367270,367283] [2022-07-14 04:57:00,797 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[367429,367442] [2022-07-14 04:57:00,798 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[367585,367598] [2022-07-14 04:57:00,798 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[367734,367747] [2022-07-14 04:57:00,799 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[367886,367899] [2022-07-14 04:57:00,799 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[368037,368050] [2022-07-14 04:57:00,800 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[368186,368199] [2022-07-14 04:57:00,800 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[368338,368351] [2022-07-14 04:57:00,800 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i[368486,368499] [2022-07-14 04:57:00,804 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,804 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,805 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,805 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,805 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,805 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,806 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,807 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,807 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,808 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,808 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,808 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,808 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,808 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,809 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,809 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:57:00,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 04:57:00,947 INFO L208 MainTranslator]: Completed translation [2022-07-14 04:57:00,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:57:00 WrapperNode [2022-07-14 04:57:00,947 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 04:57:00,948 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 04:57:00,948 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 04:57:00,948 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 04:57:00,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:57:00" (1/1) ... [2022-07-14 04:57:01,044 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:57:00" (1/1) ... [2022-07-14 04:57:01,155 INFO L137 Inliner]: procedures = 637, calls = 3768, calls flagged for inlining = 247, calls inlined = 94, statements flattened = 2799 [2022-07-14 04:57:01,156 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 04:57:01,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 04:57:01,157 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 04:57:01,157 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 04:57:01,163 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:57:00" (1/1) ... [2022-07-14 04:57:01,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:57:00" (1/1) ... [2022-07-14 04:57:01,227 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:57:00" (1/1) ... [2022-07-14 04:57:01,227 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:57:00" (1/1) ... [2022-07-14 04:57:01,292 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:57:00" (1/1) ... [2022-07-14 04:57:01,303 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:57:00" (1/1) ... [2022-07-14 04:57:01,330 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:57:00" (1/1) ... [2022-07-14 04:57:01,357 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 04:57:01,359 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 04:57:01,359 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 04:57:01,359 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 04:57:01,360 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:57:00" (1/1) ... [2022-07-14 04:57:01,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 04:57:01,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:57:01,383 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-14 04:57:01,399 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-14 04:57:01,410 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-14 04:57:01,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-14 04:57:01,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-14 04:57:01,411 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-14 04:57:01,411 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-14 04:57:01,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-14 04:57:01,411 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~$Pointer$~X~int~TO~VOID [2022-07-14 04:57:01,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~$Pointer$~X~int~TO~VOID [2022-07-14 04:57:01,412 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-14 04:57:01,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-14 04:57:01,412 INFO L130 BoogieDeclarations]: Found specification of procedure vx_pcm_capture_close [2022-07-14 04:57:01,412 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_pcm_capture_close [2022-07-14 04:57:01,412 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-14 04:57:01,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-14 04:57:01,412 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-14 04:57:01,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-14 04:57:01,412 INFO L130 BoogieDeclarations]: Found specification of procedure vx_alloc_pipe [2022-07-14 04:57:01,413 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_alloc_pipe [2022-07-14 04:57:01,413 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~VOID [2022-07-14 04:57:01,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~VOID [2022-07-14 04:57:01,413 INFO L130 BoogieDeclarations]: Found specification of procedure snd_vx_outl [2022-07-14 04:57:01,413 INFO L138 BoogieDeclarations]: Found implementation of procedure snd_vx_outl [2022-07-14 04:57:01,413 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-14 04:57:01,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-14 04:57:01,413 INFO L130 BoogieDeclarations]: Found specification of procedure vx_set_differed_time [2022-07-14 04:57:01,413 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_set_differed_time [2022-07-14 04:57:01,414 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-14 04:57:01,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-14 04:57:01,414 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-14 04:57:01,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-14 04:57:01,414 INFO L130 BoogieDeclarations]: Found specification of procedure snd_vx_outb [2022-07-14 04:57:01,414 INFO L138 BoogieDeclarations]: Found implementation of procedure snd_vx_outb [2022-07-14 04:57:01,414 INFO L130 BoogieDeclarations]: Found specification of procedure vx_send_msg [2022-07-14 04:57:01,414 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_send_msg [2022-07-14 04:57:01,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 04:57:01,415 INFO L130 BoogieDeclarations]: Found specification of procedure snd_pcm_lib_get_vmalloc_page [2022-07-14 04:57:01,415 INFO L138 BoogieDeclarations]: Found implementation of procedure snd_pcm_lib_get_vmalloc_page [2022-07-14 04:57:01,415 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-14 04:57:01,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-14 04:57:01,415 INFO L130 BoogieDeclarations]: Found specification of procedure vx_send_irq_dsp [2022-07-14 04:57:01,415 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_send_irq_dsp [2022-07-14 04:57:01,415 INFO L130 BoogieDeclarations]: Found specification of procedure vx_set_pipe_cmd_params [2022-07-14 04:57:01,415 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_set_pipe_cmd_params [2022-07-14 04:57:01,415 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_lock_of_vx_core [2022-07-14 04:57:01,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_lock_of_vx_core [2022-07-14 04:57:01,416 INFO L130 BoogieDeclarations]: Found specification of procedure vx_adjust_audio_level [2022-07-14 04:57:01,416 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_adjust_audio_level [2022-07-14 04:57:01,416 INFO L130 BoogieDeclarations]: Found specification of procedure vx_change_clock_source [2022-07-14 04:57:01,416 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_change_clock_source [2022-07-14 04:57:01,416 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~int [2022-07-14 04:57:01,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~int [2022-07-14 04:57:01,416 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-14 04:57:01,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-14 04:57:01,417 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-14 04:57:01,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-14 04:57:01,417 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-14 04:57:01,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-14 04:57:01,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 04:57:01,418 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-14 04:57:01,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-14 04:57:01,418 INFO L130 BoogieDeclarations]: Found specification of procedure vx_transfer_end [2022-07-14 04:57:01,418 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_transfer_end [2022-07-14 04:57:01,418 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2022-07-14 04:57:01,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2022-07-14 04:57:01,418 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-14 04:57:01,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-14 04:57:01,418 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2022-07-14 04:57:01,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2022-07-14 04:57:01,419 INFO L130 BoogieDeclarations]: Found specification of procedure vx_read_status [2022-07-14 04:57:01,419 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_read_status [2022-07-14 04:57:01,419 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-14 04:57:01,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-14 04:57:01,422 INFO L130 BoogieDeclarations]: Found specification of procedure vx_sync_audio_source [2022-07-14 04:57:01,422 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_sync_audio_source [2022-07-14 04:57:01,422 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-14 04:57:01,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-14 04:57:01,422 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-14 04:57:01,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-14 04:57:01,422 INFO L130 BoogieDeclarations]: Found specification of procedure vx_stop_stream [2022-07-14 04:57:01,422 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_stop_stream [2022-07-14 04:57:01,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 04:57:01,423 INFO L130 BoogieDeclarations]: Found specification of procedure vx_conf_pipe [2022-07-14 04:57:01,423 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_conf_pipe [2022-07-14 04:57:01,424 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_calloc [2022-07-14 04:57:01,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_calloc [2022-07-14 04:57:01,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 04:57:01,424 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-14 04:57:01,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-14 04:57:01,424 INFO L130 BoogieDeclarations]: Found specification of procedure vx_query_hbuffer_size [2022-07-14 04:57:01,424 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_query_hbuffer_size [2022-07-14 04:57:01,424 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-07-14 04:57:01,424 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-07-14 04:57:01,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 04:57:01,425 INFO L130 BoogieDeclarations]: Found specification of procedure vx_pipe_can_start [2022-07-14 04:57:01,425 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_pipe_can_start [2022-07-14 04:57:01,425 INFO L130 BoogieDeclarations]: Found specification of procedure vx_pcm_capture_open [2022-07-14 04:57:01,425 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_pcm_capture_open [2022-07-14 04:57:01,425 INFO L130 BoogieDeclarations]: Found specification of procedure vx_set_codec_reg [2022-07-14 04:57:01,426 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_set_codec_reg [2022-07-14 04:57:01,426 INFO L130 BoogieDeclarations]: Found specification of procedure vx_set_clock [2022-07-14 04:57:01,426 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_set_clock [2022-07-14 04:57:01,426 INFO L130 BoogieDeclarations]: Found specification of procedure vx_notify_end_of_buffer [2022-07-14 04:57:01,426 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_notify_end_of_buffer [2022-07-14 04:57:01,426 INFO L130 BoogieDeclarations]: Found specification of procedure vx_set_monitor_level [2022-07-14 04:57:01,426 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_set_monitor_level [2022-07-14 04:57:01,426 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-14 04:57:01,426 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-14 04:57:01,426 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-14 04:57:01,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-14 04:57:01,427 INFO L130 BoogieDeclarations]: Found specification of procedure vx_stop_pipe [2022-07-14 04:57:01,427 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_stop_pipe [2022-07-14 04:57:01,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 04:57:01,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 04:57:01,427 INFO L130 BoogieDeclarations]: Found specification of procedure vx_send_irqa [2022-07-14 04:57:01,427 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_send_irqa [2022-07-14 04:57:01,427 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-14 04:57:01,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-14 04:57:01,428 INFO L130 BoogieDeclarations]: Found specification of procedure vx_free_pipe [2022-07-14 04:57:01,428 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_free_pipe [2022-07-14 04:57:01,428 INFO L130 BoogieDeclarations]: Found specification of procedure vx_set_stream_cmd_params [2022-07-14 04:57:01,428 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_set_stream_cmd_params [2022-07-14 04:57:01,428 INFO L130 BoogieDeclarations]: Found specification of procedure snd_pcm_hw_constraint_step [2022-07-14 04:57:01,428 INFO L138 BoogieDeclarations]: Found implementation of procedure snd_pcm_hw_constraint_step [2022-07-14 04:57:01,429 INFO L130 BoogieDeclarations]: Found specification of procedure vx_pcm_hw_params [2022-07-14 04:57:01,429 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_pcm_hw_params [2022-07-14 04:57:01,429 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_lock_of_vx_core [2022-07-14 04:57:01,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_lock_of_vx_core [2022-07-14 04:57:01,429 INFO L130 BoogieDeclarations]: Found specification of procedure vx_pcm_playback_open [2022-07-14 04:57:01,429 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_pcm_playback_open [2022-07-14 04:57:01,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-14 04:57:01,429 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-14 04:57:01,430 INFO L130 BoogieDeclarations]: Found specification of procedure vx_toggle_dac_mute [2022-07-14 04:57:01,430 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_toggle_dac_mute [2022-07-14 04:57:01,430 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-14 04:57:01,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-14 04:57:01,430 INFO L130 BoogieDeclarations]: Found specification of procedure vx_reset_chk [2022-07-14 04:57:01,430 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_reset_chk [2022-07-14 04:57:01,430 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-14 04:57:01,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-14 04:57:01,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 04:57:01,431 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-14 04:57:01,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-14 04:57:01,431 INFO L130 BoogieDeclarations]: Found specification of procedure vx_start_stream [2022-07-14 04:57:01,431 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_start_stream [2022-07-14 04:57:01,431 INFO L130 BoogieDeclarations]: Found specification of procedure vx_send_rih_nolock [2022-07-14 04:57:01,431 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_send_rih_nolock [2022-07-14 04:57:01,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 04:57:01,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 04:57:01,431 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-14 04:57:01,431 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-14 04:57:01,432 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-14 04:57:01,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-14 04:57:01,432 INFO L130 BoogieDeclarations]: Found specification of procedure vx_pcm_trigger [2022-07-14 04:57:01,432 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_pcm_trigger [2022-07-14 04:57:01,432 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-14 04:57:01,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-14 04:57:01,432 INFO L130 BoogieDeclarations]: Found specification of procedure vx_get_pipe_state [2022-07-14 04:57:01,432 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_get_pipe_state [2022-07-14 04:57:01,432 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-14 04:57:01,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-14 04:57:01,433 INFO L130 BoogieDeclarations]: Found specification of procedure vx_pcm_playback_close [2022-07-14 04:57:01,433 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_pcm_playback_close [2022-07-14 04:57:01,433 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-14 04:57:01,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-14 04:57:01,433 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-14 04:57:01,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-14 04:57:01,433 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-14 04:57:01,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-14 04:57:01,434 INFO L130 BoogieDeclarations]: Found specification of procedure vx_send_rih [2022-07-14 04:57:01,434 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_send_rih [2022-07-14 04:57:01,434 INFO L130 BoogieDeclarations]: Found specification of procedure vx_send_msg_nolock [2022-07-14 04:57:01,434 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_send_msg_nolock [2022-07-14 04:57:01,434 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-14 04:57:01,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-14 04:57:01,434 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-14 04:57:01,434 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-14 04:57:01,434 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-14 04:57:01,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-14 04:57:01,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 04:57:01,435 INFO L130 BoogieDeclarations]: Found specification of procedure vx_update_pipe_position [2022-07-14 04:57:01,435 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_update_pipe_position [2022-07-14 04:57:01,435 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-14 04:57:01,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-14 04:57:01,435 INFO L130 BoogieDeclarations]: Found specification of procedure vx_pcm_playback_transfer [2022-07-14 04:57:01,435 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_pcm_playback_transfer [2022-07-14 04:57:01,435 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-14 04:57:01,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-14 04:57:01,436 INFO L130 BoogieDeclarations]: Found specification of procedure vx_pcm_prepare [2022-07-14 04:57:01,436 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_pcm_prepare [2022-07-14 04:57:01,436 INFO L130 BoogieDeclarations]: Found specification of procedure vx_pcm_playback_transfer_chunk [2022-07-14 04:57:01,436 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_pcm_playback_transfer_chunk [2022-07-14 04:57:01,436 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-14 04:57:01,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-14 04:57:01,436 INFO L130 BoogieDeclarations]: Found specification of procedure vx_pcm_hw_free [2022-07-14 04:57:01,436 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_pcm_hw_free [2022-07-14 04:57:01,436 INFO L130 BoogieDeclarations]: Found specification of procedure frames_to_bytes [2022-07-14 04:57:01,437 INFO L138 BoogieDeclarations]: Found implementation of procedure frames_to_bytes [2022-07-14 04:57:01,437 INFO L130 BoogieDeclarations]: Found specification of procedure snd_vx_inb [2022-07-14 04:57:01,437 INFO L138 BoogieDeclarations]: Found implementation of procedure snd_vx_inb [2022-07-14 04:57:01,437 INFO L130 BoogieDeclarations]: Found specification of procedure snd_pcm_lib_ioctl [2022-07-14 04:57:01,437 INFO L138 BoogieDeclarations]: Found implementation of procedure snd_pcm_lib_ioctl [2022-07-14 04:57:01,437 INFO L130 BoogieDeclarations]: Found specification of procedure snd_vx_check_reg_bit [2022-07-14 04:57:01,437 INFO L138 BoogieDeclarations]: Found implementation of procedure snd_vx_check_reg_bit [2022-07-14 04:57:01,437 INFO L130 BoogieDeclarations]: Found specification of procedure vx_toggle_pipe [2022-07-14 04:57:01,437 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_toggle_pipe [2022-07-14 04:57:01,438 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-14 04:57:01,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-14 04:57:01,438 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-14 04:57:01,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-14 04:57:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure vx_set_internal_clock [2022-07-14 04:57:01,439 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_set_internal_clock [2022-07-14 04:57:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 04:57:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure vx_init_rmh [2022-07-14 04:57:01,439 INFO L138 BoogieDeclarations]: Found implementation of procedure vx_init_rmh [2022-07-14 04:57:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~int~TO~VOID [2022-07-14 04:57:01,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~int~TO~VOID [2022-07-14 04:57:01,865 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 04:57:01,869 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 04:57:01,986 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-14 04:57:08,151 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 04:57:08,168 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 04:57:08,168 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-14 04:57:08,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:57:08 BoogieIcfgContainer [2022-07-14 04:57:08,175 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 04:57:08,177 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 04:57:08,177 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 04:57:08,180 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 04:57:08,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 04:56:57" (1/3) ... [2022-07-14 04:57:08,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76428e12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 04:57:08, skipping insertion in model container [2022-07-14 04:57:08,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:57:00" (2/3) ... [2022-07-14 04:57:08,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76428e12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 04:57:08, skipping insertion in model container [2022-07-14 04:57:08,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:57:08" (3/3) ... [2022-07-14 04:57:08,184 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---sound--drivers--vx--snd-vx-lib.ko.cil.i [2022-07-14 04:57:08,195 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 04:57:08,196 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2022-07-14 04:57:08,266 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 04:57:08,271 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@68db4cd, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4d1d22ff [2022-07-14 04:57:08,271 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2022-07-14 04:57:08,279 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-14 04:57:08,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-14 04:57:08,288 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:57:08,289 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-14 04:57:08,289 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-14 04:57:08,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:57:08,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1561423034, now seen corresponding path program 1 times [2022-07-14 04:57:08,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:57:08,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131384621] [2022-07-14 04:57:08,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:57:08,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:57:08,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:08,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:57:08,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:08,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:57:08,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:08,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:57:08,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:08,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:57:08,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:08,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:57:08,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:08,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:57:08,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:08,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:57:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:08,914 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-14 04:57:08,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:57:08,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131384621] [2022-07-14 04:57:08,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131384621] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:57:08,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:57:08,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:57:08,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380173694] [2022-07-14 04:57:08,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:57:08,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:57:08,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:57:08,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:57:08,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:57:08,950 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-14 04:57:13,960 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-14 04:57:15,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:57:15,032 INFO L93 Difference]: Finished difference Result 2688 states and 3876 transitions. [2022-07-14 04:57:15,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:57:15,034 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-14 04:57:15,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:57:15,058 INFO L225 Difference]: With dead ends: 2688 [2022-07-14 04:57:15,059 INFO L226 Difference]: Without dead ends: 1347 [2022-07-14 04:57:15,069 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-14 04:57:15,071 INFO L413 NwaCegarLoop]: 1585 mSDtfsCounter, 3343 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 2005 mSolverCounterSat, 1576 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3423 SdHoareTripleChecker+Valid, 2072 SdHoareTripleChecker+Invalid, 3582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1576 IncrementalHoareTripleChecker+Valid, 2005 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-07-14 04:57:15,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3423 Valid, 2072 Invalid, 3582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1576 Valid, 2005 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2022-07-14 04:57:15,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2022-07-14 04:57:15,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1347. [2022-07-14 04:57:15,173 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-14 04:57:15,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1804 transitions. [2022-07-14 04:57:15,184 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1804 transitions. Word has length 49 [2022-07-14 04:57:15,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:57:15,185 INFO L495 AbstractCegarLoop]: Abstraction has 1347 states and 1804 transitions. [2022-07-14 04:57:15,185 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-14 04:57:15,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1804 transitions. [2022-07-14 04:57:15,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-14 04:57:15,187 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:57:15,188 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-14 04:57:15,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 04:57:15,188 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-14 04:57:15,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:57:15,189 INFO L85 PathProgramCache]: Analyzing trace with hash 497600241, now seen corresponding path program 1 times [2022-07-14 04:57:15,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:57:15,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493905907] [2022-07-14 04:57:15,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:57:15,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:57:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:15,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:57:15,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:15,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:57:15,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:15,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:57:15,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:15,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:57:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:15,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:57:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:15,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:57:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:15,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:57:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:15,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:57:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:15,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-14 04:57:15,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:57:15,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493905907] [2022-07-14 04:57:15,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493905907] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:57:15,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:57:15,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:57:15,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828302757] [2022-07-14 04:57:15,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:57:15,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:57:15,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:57:15,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:57:15,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:57:15,459 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-14 04:57:18,946 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-14 04:57:22,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:57:22,007 INFO L93 Difference]: Finished difference Result 1347 states and 1804 transitions. [2022-07-14 04:57:22,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:57:22,007 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-14 04:57:22,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:57:22,013 INFO L225 Difference]: With dead ends: 1347 [2022-07-14 04:57:22,013 INFO L226 Difference]: Without dead ends: 1345 [2022-07-14 04:57:22,014 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-14 04:57:22,015 INFO L413 NwaCegarLoop]: 1567 mSDtfsCounter, 3311 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 1991 mSolverCounterSat, 1568 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3388 SdHoareTripleChecker+Valid, 2038 SdHoareTripleChecker+Invalid, 3560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1568 IncrementalHoareTripleChecker+Valid, 1991 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:57:22,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3388 Valid, 2038 Invalid, 3560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1568 Valid, 1991 Invalid, 1 Unknown, 0 Unchecked, 6.4s Time] [2022-07-14 04:57:22,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2022-07-14 04:57:22,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1345. [2022-07-14 04:57:22,044 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-14 04:57:22,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 1802 transitions. [2022-07-14 04:57:22,050 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 1802 transitions. Word has length 55 [2022-07-14 04:57:22,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:57:22,051 INFO L495 AbstractCegarLoop]: Abstraction has 1345 states and 1802 transitions. [2022-07-14 04:57:22,051 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-14 04:57:22,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1802 transitions. [2022-07-14 04:57:22,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-14 04:57:22,052 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:57:22,052 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-14 04:57:22,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 04:57:22,053 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-14 04:57:22,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:57:22,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1892947023, now seen corresponding path program 1 times [2022-07-14 04:57:22,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:57:22,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386294658] [2022-07-14 04:57:22,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:57:22,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:57:22,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:22,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:57:22,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:22,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:57:22,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:22,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:57:22,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:22,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:57:22,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:22,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:57:22,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:22,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:57:22,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:22,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:57:22,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:22,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:57:22,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:22,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-14 04:57:22,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:22,318 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-14 04:57:22,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:57:22,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386294658] [2022-07-14 04:57:22,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386294658] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:57:22,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:57:22,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:57:22,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446866842] [2022-07-14 04:57:22,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:57:22,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:57:22,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:57:22,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:57:22,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:57:22,321 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-14 04:57:25,215 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-14 04:57:28,413 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-14 04:57:29,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:57:29,323 INFO L93 Difference]: Finished difference Result 1345 states and 1802 transitions. [2022-07-14 04:57:29,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:57:29,324 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-14 04:57:29,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:57:29,330 INFO L225 Difference]: With dead ends: 1345 [2022-07-14 04:57:29,330 INFO L226 Difference]: Without dead ends: 1343 [2022-07-14 04:57:29,331 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-14 04:57:29,335 INFO L413 NwaCegarLoop]: 1565 mSDtfsCounter, 3305 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 1988 mSolverCounterSat, 1568 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3381 SdHoareTripleChecker+Valid, 2036 SdHoareTripleChecker+Invalid, 3558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1568 IncrementalHoareTripleChecker+Valid, 1988 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-07-14 04:57:29,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3381 Valid, 2036 Invalid, 3558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1568 Valid, 1988 Invalid, 2 Unknown, 0 Unchecked, 6.9s Time] [2022-07-14 04:57:29,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2022-07-14 04:57:29,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1343. [2022-07-14 04:57:29,367 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-14 04:57:29,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1800 transitions. [2022-07-14 04:57:29,373 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1800 transitions. Word has length 61 [2022-07-14 04:57:29,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:57:29,373 INFO L495 AbstractCegarLoop]: Abstraction has 1343 states and 1800 transitions. [2022-07-14 04:57:29,373 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-14 04:57:29,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1800 transitions. [2022-07-14 04:57:29,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-14 04:57:29,374 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:57:29,374 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-14 04:57:29,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 04:57:29,375 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-14 04:57:29,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:57:29,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1202645261, now seen corresponding path program 1 times [2022-07-14 04:57:29,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:57:29,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602733050] [2022-07-14 04:57:29,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:57:29,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:57:29,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:29,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:57:29,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:29,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:57:29,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:29,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:57:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:29,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:57:29,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:29,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:57:29,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:29,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:57:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:29,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:57:29,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:29,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:57:29,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:29,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-14 04:57:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:29,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-14 04:57:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:29,645 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-14 04:57:29,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:57:29,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602733050] [2022-07-14 04:57:29,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602733050] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:57:29,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:57:29,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:57:29,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559083064] [2022-07-14 04:57:29,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:57:29,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:57:29,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:57:29,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:57:29,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:57:29,648 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-14 04:57:34,196 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-14 04:57:35,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:57:35,055 INFO L93 Difference]: Finished difference Result 1343 states and 1800 transitions. [2022-07-14 04:57:35,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:57:35,056 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-14 04:57:35,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:57:35,073 INFO L225 Difference]: With dead ends: 1343 [2022-07-14 04:57:35,073 INFO L226 Difference]: Without dead ends: 1341 [2022-07-14 04:57:35,074 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-14 04:57:35,075 INFO L413 NwaCegarLoop]: 1563 mSDtfsCounter, 3299 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 1987 mSolverCounterSat, 1568 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.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, 5.3s IncrementalHoareTripleChecker+Time [2022-07-14 04:57:35,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3374 Valid, 2034 Invalid, 3556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1568 Valid, 1987 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2022-07-14 04:57:35,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2022-07-14 04:57:35,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1341. [2022-07-14 04:57:35,107 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-14 04:57:35,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 1798 transitions. [2022-07-14 04:57:35,112 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 1798 transitions. Word has length 67 [2022-07-14 04:57:35,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:57:35,112 INFO L495 AbstractCegarLoop]: Abstraction has 1341 states and 1798 transitions. [2022-07-14 04:57:35,113 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-14 04:57:35,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1798 transitions. [2022-07-14 04:57:35,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-14 04:57:35,114 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:57:35,114 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-14 04:57:35,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 04:57:35,114 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-14 04:57:35,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:57:35,115 INFO L85 PathProgramCache]: Analyzing trace with hash -160386052, now seen corresponding path program 1 times [2022-07-14 04:57:35,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:57:35,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445723998] [2022-07-14 04:57:35,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:57:35,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:57:35,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:35,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:57:35,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:35,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:57:35,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:35,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:57:35,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:35,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:57:35,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:35,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:57:35,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:35,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:57:35,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:35,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:57:35,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:35,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:57:35,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:35,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-14 04:57:35,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:35,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-14 04:57:35,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:35,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-14 04:57:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:35,360 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-14 04:57:35,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:57:35,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445723998] [2022-07-14 04:57:35,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445723998] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:57:35,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:57:35,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:57:35,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548788908] [2022-07-14 04:57:35,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:57:35,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:57:35,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:57:35,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:57:35,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:57:35,363 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-14 04:57:37,130 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:57:41,367 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-14 04:57:42,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:57:42,224 INFO L93 Difference]: Finished difference Result 1341 states and 1798 transitions. [2022-07-14 04:57:42,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:57:42,224 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-14 04:57:42,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:57:42,230 INFO L225 Difference]: With dead ends: 1341 [2022-07-14 04:57:42,230 INFO L226 Difference]: Without dead ends: 1339 [2022-07-14 04:57:42,231 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-14 04:57:42,231 INFO L413 NwaCegarLoop]: 1561 mSDtfsCounter, 3293 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 1985 mSolverCounterSat, 1568 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3367 SdHoareTripleChecker+Valid, 2032 SdHoareTripleChecker+Invalid, 3554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1568 IncrementalHoareTripleChecker+Valid, 1985 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-07-14 04:57:42,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3367 Valid, 2032 Invalid, 3554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1568 Valid, 1985 Invalid, 1 Unknown, 0 Unchecked, 6.7s Time] [2022-07-14 04:57:42,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2022-07-14 04:57:42,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1339. [2022-07-14 04:57:42,281 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-14 04:57:42,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 1796 transitions. [2022-07-14 04:57:42,286 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 1796 transitions. Word has length 73 [2022-07-14 04:57:42,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:57:42,286 INFO L495 AbstractCegarLoop]: Abstraction has 1339 states and 1796 transitions. [2022-07-14 04:57:42,286 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-14 04:57:42,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 1796 transitions. [2022-07-14 04:57:42,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-14 04:57:42,291 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:57:42,291 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-14 04:57:42,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 04:57:42,291 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-14 04:57:42,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:57:42,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1154737015, now seen corresponding path program 1 times [2022-07-14 04:57:42,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:57:42,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349443897] [2022-07-14 04:57:42,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:57:42,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:57:42,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:42,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:57:42,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:42,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:57:42,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:42,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:57:42,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:42,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:57:42,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:42,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:57:42,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:42,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:57:42,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:42,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:57:42,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:42,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:57:42,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:42,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-14 04:57:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:42,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-14 04:57:42,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:42,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-14 04:57:42,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:42,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-14 04:57:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:42,499 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-14 04:57:42,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:57:42,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349443897] [2022-07-14 04:57:42,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349443897] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:57:42,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:57:42,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:57:42,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430083841] [2022-07-14 04:57:42,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:57:42,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:57:42,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:57:42,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:57:42,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:57:42,501 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-14 04:57:46,149 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-14 04:57:46,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:57:46,949 INFO L93 Difference]: Finished difference Result 1339 states and 1796 transitions. [2022-07-14 04:57:46,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:57:46,949 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-14 04:57:46,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:57:46,954 INFO L225 Difference]: With dead ends: 1339 [2022-07-14 04:57:46,954 INFO L226 Difference]: Without dead ends: 1337 [2022-07-14 04:57:46,954 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-14 04:57:46,955 INFO L413 NwaCegarLoop]: 1559 mSDtfsCounter, 3287 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 1984 mSolverCounterSat, 1568 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3360 SdHoareTripleChecker+Valid, 2030 SdHoareTripleChecker+Invalid, 3552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1568 IncrementalHoareTripleChecker+Valid, 1984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-14 04:57:46,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3360 Valid, 2030 Invalid, 3552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1568 Valid, 1984 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-07-14 04:57:46,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1337 states. [2022-07-14 04:57:46,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1337 to 1337. [2022-07-14 04:57:46,982 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-14 04:57:46,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1794 transitions. [2022-07-14 04:57:46,986 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1794 transitions. Word has length 79 [2022-07-14 04:57:46,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:57:46,986 INFO L495 AbstractCegarLoop]: Abstraction has 1337 states and 1794 transitions. [2022-07-14 04:57:46,987 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-14 04:57:46,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1794 transitions. [2022-07-14 04:57:46,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-14 04:57:46,999 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:57:46,999 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-14 04:57:46,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 04:57:47,000 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-14 04:57:47,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:57:47,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1225443709, now seen corresponding path program 1 times [2022-07-14 04:57:47,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:57:47,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981325754] [2022-07-14 04:57:47,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:57:47,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:57:47,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:47,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:57:47,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:47,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:57:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:47,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:57:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:47,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:57:47,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:47,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:57:47,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:47,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:57:47,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:47,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:57:47,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:47,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:57:47,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:47,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-14 04:57:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:47,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-14 04:57:47,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:47,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-14 04:57:47,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:47,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-14 04:57:47,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:47,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 04:57:47,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:47,232 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-14 04:57:47,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:57:47,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981325754] [2022-07-14 04:57:47,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981325754] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:57:47,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:57:47,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:57:47,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996166994] [2022-07-14 04:57:47,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:57:47,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:57:47,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:57:47,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:57:47,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:57:47,235 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-14 04:57:50,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-14 04:57:52,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:57:52,918 INFO L93 Difference]: Finished difference Result 1337 states and 1794 transitions. [2022-07-14 04:57:52,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:57:52,919 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-14 04:57:52,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:57:52,924 INFO L225 Difference]: With dead ends: 1337 [2022-07-14 04:57:52,924 INFO L226 Difference]: Without dead ends: 1335 [2022-07-14 04:57:52,925 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-14 04:57:52,925 INFO L413 NwaCegarLoop]: 1557 mSDtfsCounter, 3281 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 1981 mSolverCounterSat, 1568 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.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, 5.6s IncrementalHoareTripleChecker+Time [2022-07-14 04:57:52,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3353 Valid, 2028 Invalid, 3550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1568 Valid, 1981 Invalid, 1 Unknown, 0 Unchecked, 5.6s Time] [2022-07-14 04:57:52,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2022-07-14 04:57:52,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1335. [2022-07-14 04:57:52,956 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-14 04:57:52,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1335 states to 1335 states and 1792 transitions. [2022-07-14 04:57:52,960 INFO L78 Accepts]: Start accepts. Automaton has 1335 states and 1792 transitions. Word has length 85 [2022-07-14 04:57:52,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:57:52,961 INFO L495 AbstractCegarLoop]: Abstraction has 1335 states and 1792 transitions. [2022-07-14 04:57:52,961 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-14 04:57:52,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 1792 transitions. [2022-07-14 04:57:52,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-14 04:57:52,962 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:57:52,962 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-14 04:57:52,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 04:57:52,962 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-14 04:57:52,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:57:52,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1648352015, now seen corresponding path program 1 times [2022-07-14 04:57:52,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:57:52,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365428809] [2022-07-14 04:57:52,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:57:52,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:57:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:53,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:57:53,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:53,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:57:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:53,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:57:53,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:53,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:57:53,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:53,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:57:53,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:53,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:57:53,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:53,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:57:53,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:53,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:57:53,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:53,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-14 04:57:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:53,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-14 04:57:53,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:53,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-14 04:57:53,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:53,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-14 04:57:53,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:53,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 04:57:53,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:53,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-14 04:57:53,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:53,174 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 04:57:53,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:57:53,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365428809] [2022-07-14 04:57:53,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365428809] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:57:53,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:57:53,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:57:53,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423491331] [2022-07-14 04:57:53,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:57:53,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:57:53,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:57:53,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:57:53,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:57:53,176 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-14 04:57:56,233 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-14 04:57:59,265 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-14 04:58:00,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:58:00,182 INFO L93 Difference]: Finished difference Result 1335 states and 1792 transitions. [2022-07-14 04:58:00,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:58:00,183 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-14 04:58:00,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:58:00,187 INFO L225 Difference]: With dead ends: 1335 [2022-07-14 04:58:00,187 INFO L226 Difference]: Without dead ends: 1333 [2022-07-14 04:58:00,188 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-14 04:58:00,188 INFO L413 NwaCegarLoop]: 1555 mSDtfsCounter, 3279 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 1974 mSolverCounterSat, 1568 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3350 SdHoareTripleChecker+Valid, 2026 SdHoareTripleChecker+Invalid, 3544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1568 IncrementalHoareTripleChecker+Valid, 1974 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-07-14 04:58:00,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3350 Valid, 2026 Invalid, 3544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1568 Valid, 1974 Invalid, 2 Unknown, 0 Unchecked, 6.9s Time] [2022-07-14 04:58:00,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2022-07-14 04:58:00,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 1333. [2022-07-14 04:58:00,220 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-14 04:58:00,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1790 transitions. [2022-07-14 04:58:00,224 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1790 transitions. Word has length 91 [2022-07-14 04:58:00,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:58:00,224 INFO L495 AbstractCegarLoop]: Abstraction has 1333 states and 1790 transitions. [2022-07-14 04:58:00,224 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-14 04:58:00,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1790 transitions. [2022-07-14 04:58:00,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-14 04:58:00,225 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:58:00,225 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-14 04:58:00,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 04:58:00,226 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-14 04:58:00,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:58:00,226 INFO L85 PathProgramCache]: Analyzing trace with hash 776790548, now seen corresponding path program 1 times [2022-07-14 04:58:00,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:58:00,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628767161] [2022-07-14 04:58:00,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:58:00,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:58:00,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:00,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:58:00,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:00,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:58:00,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:00,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:58:00,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:00,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:58:00,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:00,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:58:00,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:00,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:58:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:00,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:58:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:00,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:58:00,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:00,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-14 04:58:00,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:00,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-14 04:58:00,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:00,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-14 04:58:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:00,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-14 04:58:00,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:00,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 04:58:00,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:00,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-14 04:58:00,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:00,449 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-14 04:58:00,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:58:00,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628767161] [2022-07-14 04:58:00,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628767161] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:58:00,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:58:00,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:58:00,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529121973] [2022-07-14 04:58:00,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:58:00,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:58:00,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:58:00,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:58:00,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:58:00,452 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-14 04:58:05,290 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-14 04:58:06,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:58:06,184 INFO L93 Difference]: Finished difference Result 1333 states and 1790 transitions. [2022-07-14 04:58:06,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:58:06,184 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-14 04:58:06,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:58:06,189 INFO L225 Difference]: With dead ends: 1333 [2022-07-14 04:58:06,189 INFO L226 Difference]: Without dead ends: 1331 [2022-07-14 04:58:06,189 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-14 04:58:06,190 INFO L413 NwaCegarLoop]: 1553 mSDtfsCounter, 3267 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 1977 mSolverCounterSat, 1568 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s 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, 5.6s IncrementalHoareTripleChecker+Time [2022-07-14 04:58:06,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3338 Valid, 2024 Invalid, 3546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1568 Valid, 1977 Invalid, 1 Unknown, 0 Unchecked, 5.6s Time] [2022-07-14 04:58:06,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2022-07-14 04:58:06,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1331. [2022-07-14 04:58:06,224 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-14 04:58:06,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 1788 transitions. [2022-07-14 04:58:06,228 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 1788 transitions. Word has length 93 [2022-07-14 04:58:06,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:58:06,228 INFO L495 AbstractCegarLoop]: Abstraction has 1331 states and 1788 transitions. [2022-07-14 04:58:06,228 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-14 04:58:06,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1788 transitions. [2022-07-14 04:58:06,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-14 04:58:06,230 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:58:06,230 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-14 04:58:06,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 04:58:06,231 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-14 04:58:06,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:58:06,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1686698121, now seen corresponding path program 1 times [2022-07-14 04:58:06,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:58:06,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779870519] [2022-07-14 04:58:06,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:58:06,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:58:06,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:06,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:58:06,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:06,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:58:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:06,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:58:06,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:06,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:58:06,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:06,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:58:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:06,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:58:06,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:06,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:58:06,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:06,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:58:06,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:06,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-14 04:58:06,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:06,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-14 04:58:06,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:06,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-14 04:58:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:06,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-14 04:58:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:06,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 04:58:06,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:06,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-14 04:58:06,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:06,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-14 04:58:06,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:06,447 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-14 04:58:06,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:58:06,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779870519] [2022-07-14 04:58:06,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779870519] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:58:06,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:58:06,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:58:06,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710116980] [2022-07-14 04:58:06,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:58:06,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:58:06,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:58:06,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:58:06,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:58:06,449 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-14 04:58:10,712 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-14 04:58:11,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:58:11,505 INFO L93 Difference]: Finished difference Result 1331 states and 1788 transitions. [2022-07-14 04:58:11,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:58:11,506 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-14 04:58:11,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:58:11,511 INFO L225 Difference]: With dead ends: 1331 [2022-07-14 04:58:11,511 INFO L226 Difference]: Without dead ends: 1329 [2022-07-14 04:58:11,511 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-14 04:58:11,512 INFO L413 NwaCegarLoop]: 1551 mSDtfsCounter, 3263 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 1975 mSolverCounterSat, 1568 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3333 SdHoareTripleChecker+Valid, 2022 SdHoareTripleChecker+Invalid, 3544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1568 IncrementalHoareTripleChecker+Valid, 1975 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-07-14 04:58:11,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3333 Valid, 2022 Invalid, 3544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1568 Valid, 1975 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2022-07-14 04:58:11,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2022-07-14 04:58:11,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1329. [2022-07-14 04:58:11,544 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-14 04:58:11,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 1786 transitions. [2022-07-14 04:58:11,547 INFO L78 Accepts]: Start accepts. Automaton has 1329 states and 1786 transitions. Word has length 99 [2022-07-14 04:58:11,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:58:11,548 INFO L495 AbstractCegarLoop]: Abstraction has 1329 states and 1786 transitions. [2022-07-14 04:58:11,548 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-14 04:58:11,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1786 transitions. [2022-07-14 04:58:11,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-14 04:58:11,551 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:58:11,551 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-14 04:58:11,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 04:58:11,552 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-14 04:58:11,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:58:11,552 INFO L85 PathProgramCache]: Analyzing trace with hash -945850592, now seen corresponding path program 1 times [2022-07-14 04:58:11,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:58:11,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942221256] [2022-07-14 04:58:11,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:58:11,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:58:11,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:11,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:58:11,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:11,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:58:11,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:11,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:58:11,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:11,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:58:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:11,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:58:11,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:11,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:58:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:11,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:58:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:11,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:58:11,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:11,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-14 04:58:11,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:11,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-14 04:58:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:11,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-14 04:58:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:11,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-14 04:58:11,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:11,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 04:58:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:11,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-14 04:58:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:11,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-14 04:58:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:11,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 04:58:11,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:11,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-14 04:58:11,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:58:11,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942221256] [2022-07-14 04:58:11,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942221256] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:58:11,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:58:11,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:58:11,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652565820] [2022-07-14 04:58:11,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:58:11,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:58:11,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:58:11,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:58:11,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:58:11,812 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-14 04:58:15,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:58:15,903 INFO L93 Difference]: Finished difference Result 1329 states and 1786 transitions. [2022-07-14 04:58:15,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:58:15,903 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-14 04:58:15,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:58:15,908 INFO L225 Difference]: With dead ends: 1329 [2022-07-14 04:58:15,908 INFO L226 Difference]: Without dead ends: 1327 [2022-07-14 04:58:15,909 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-14 04:58:15,909 INFO L413 NwaCegarLoop]: 1549 mSDtfsCounter, 3257 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 1974 mSolverCounterSat, 1568 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3326 SdHoareTripleChecker+Valid, 2020 SdHoareTripleChecker+Invalid, 3542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1568 IncrementalHoareTripleChecker+Valid, 1974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-14 04:58:15,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3326 Valid, 2020 Invalid, 3542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1568 Valid, 1974 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-07-14 04:58:15,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states. [2022-07-14 04:58:15,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 1327. [2022-07-14 04:58:15,963 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-14 04:58:15,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1327 states and 1784 transitions. [2022-07-14 04:58:15,968 INFO L78 Accepts]: Start accepts. Automaton has 1327 states and 1784 transitions. Word has length 105 [2022-07-14 04:58:15,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:58:15,968 INFO L495 AbstractCegarLoop]: Abstraction has 1327 states and 1784 transitions. [2022-07-14 04:58:15,969 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-14 04:58:15,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 1784 transitions. [2022-07-14 04:58:15,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-14 04:58:15,970 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:58:15,970 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-14 04:58:15,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 04:58:15,970 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-14 04:58:15,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:58:15,971 INFO L85 PathProgramCache]: Analyzing trace with hash 271687204, now seen corresponding path program 1 times [2022-07-14 04:58:15,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:58:15,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829918660] [2022-07-14 04:58:15,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:58:15,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:58:16,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:16,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:58:16,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:16,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:58:16,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:16,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:58:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:16,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:58:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:16,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:58:16,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:16,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:58:16,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:16,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:58:16,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:16,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:58:16,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:16,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-14 04:58:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:16,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-14 04:58:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:16,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-14 04:58:16,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:16,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-14 04:58:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:16,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 04:58:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:16,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-14 04:58:16,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:16,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-14 04:58:16,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:16,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 04:58:16,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:16,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-14 04:58:16,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:16,158 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-14 04:58:16,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:58:16,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829918660] [2022-07-14 04:58:16,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829918660] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:58:16,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:58:16,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:58:16,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504138313] [2022-07-14 04:58:16,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:58:16,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:58:16,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:58:16,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:58:16,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:58:16,160 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-14 04:58:20,746 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-14 04:58:21,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:58:21,559 INFO L93 Difference]: Finished difference Result 1327 states and 1784 transitions. [2022-07-14 04:58:21,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:58:21,560 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-14 04:58:21,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:58:21,565 INFO L225 Difference]: With dead ends: 1327 [2022-07-14 04:58:21,565 INFO L226 Difference]: Without dead ends: 1325 [2022-07-14 04:58:21,565 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-14 04:58:21,565 INFO L413 NwaCegarLoop]: 1547 mSDtfsCounter, 3251 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 1971 mSolverCounterSat, 1568 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s 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.3s IncrementalHoareTripleChecker+Time [2022-07-14 04:58:21,566 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.3s Time] [2022-07-14 04:58:21,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2022-07-14 04:58:21,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 1325. [2022-07-14 04:58:21,600 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-14 04:58:21,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1782 transitions. [2022-07-14 04:58:21,603 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1782 transitions. Word has length 111 [2022-07-14 04:58:21,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:58:21,604 INFO L495 AbstractCegarLoop]: Abstraction has 1325 states and 1782 transitions. [2022-07-14 04:58:21,604 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-14 04:58:21,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1782 transitions. [2022-07-14 04:58:21,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-14 04:58:21,605 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:58:21,606 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-14 04:58:21,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 04:58:21,606 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-14 04:58:21,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:58:21,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1218114242, now seen corresponding path program 1 times [2022-07-14 04:58:21,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:58:21,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853587790] [2022-07-14 04:58:21,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:58:21,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:58:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:21,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:58:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:21,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:58:21,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:21,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:58:21,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:21,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:58:21,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:21,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:58:21,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:21,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:58:21,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:21,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:58:21,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:21,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:58:21,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:21,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-14 04:58:21,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:21,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-14 04:58:21,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:21,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-14 04:58:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:21,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-14 04:58:21,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:21,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 04:58:21,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:21,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-14 04:58:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:21,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-14 04:58:21,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:21,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 04:58:21,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:21,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-14 04:58:21,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:21,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-14 04:58:21,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:21,829 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-14 04:58:21,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:58:21,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853587790] [2022-07-14 04:58:21,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853587790] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:58:21,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:58:21,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:58:21,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124892594] [2022-07-14 04:58:21,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:58:21,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:58:21,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:58:21,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:58:21,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:58:21,831 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-14 04:58:24,272 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:58:27,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:58:27,101 INFO L93 Difference]: Finished difference Result 1325 states and 1782 transitions. [2022-07-14 04:58:27,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:58:27,101 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-14 04:58:27,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:58:27,105 INFO L225 Difference]: With dead ends: 1325 [2022-07-14 04:58:27,106 INFO L226 Difference]: Without dead ends: 1323 [2022-07-14 04:58:27,106 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-14 04:58:27,106 INFO L413 NwaCegarLoop]: 1545 mSDtfsCounter, 3245 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 1970 mSolverCounterSat, 1568 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3312 SdHoareTripleChecker+Valid, 2016 SdHoareTripleChecker+Invalid, 3538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1568 IncrementalHoareTripleChecker+Valid, 1970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:58:27,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3312 Valid, 2016 Invalid, 3538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1568 Valid, 1970 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-07-14 04:58:27,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2022-07-14 04:58:27,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1323. [2022-07-14 04:58:27,158 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-14 04:58:27,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1323 states and 1780 transitions. [2022-07-14 04:58:27,162 INFO L78 Accepts]: Start accepts. Automaton has 1323 states and 1780 transitions. Word has length 117 [2022-07-14 04:58:27,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:58:27,162 INFO L495 AbstractCegarLoop]: Abstraction has 1323 states and 1780 transitions. [2022-07-14 04:58:27,162 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-14 04:58:27,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1780 transitions. [2022-07-14 04:58:27,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-14 04:58:27,163 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:58:27,164 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-14 04:58:27,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 04:58:27,164 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-14 04:58:27,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:58:27,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1396288369, now seen corresponding path program 1 times [2022-07-14 04:58:27,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:58:27,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83938734] [2022-07-14 04:58:27,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:58:27,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:58:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:27,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:58:27,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:27,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:58:27,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:27,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:58:27,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:27,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:58:27,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:27,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:58:27,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:27,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:58:27,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:27,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:58:27,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:27,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:58:27,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:27,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-14 04:58:27,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:27,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-14 04:58:27,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:27,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-14 04:58:27,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:27,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-14 04:58:27,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:27,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 04:58:27,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:27,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-14 04:58:27,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:27,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-14 04:58:27,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:27,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 04:58:27,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:27,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-14 04:58:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:27,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-14 04:58:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:27,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 04:58:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:27,371 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-14 04:58:27,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:58:27,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83938734] [2022-07-14 04:58:27,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83938734] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:58:27,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:58:27,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:58:27,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496354206] [2022-07-14 04:58:27,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:58:27,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:58:27,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:58:27,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:58:27,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:58:27,373 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-14 04:58:31,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:58:31,648 INFO L93 Difference]: Finished difference Result 1323 states and 1780 transitions. [2022-07-14 04:58:31,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:58:31,649 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-14 04:58:31,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:58:31,655 INFO L225 Difference]: With dead ends: 1323 [2022-07-14 04:58:31,655 INFO L226 Difference]: Without dead ends: 1321 [2022-07-14 04:58:31,656 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-14 04:58:31,657 INFO L413 NwaCegarLoop]: 1543 mSDtfsCounter, 3239 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 1968 mSolverCounterSat, 1568 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3305 SdHoareTripleChecker+Valid, 2014 SdHoareTripleChecker+Invalid, 3536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1568 IncrementalHoareTripleChecker+Valid, 1968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:58:31,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3305 Valid, 2014 Invalid, 3536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1568 Valid, 1968 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-07-14 04:58:31,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2022-07-14 04:58:31,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1321. [2022-07-14 04:58:31,706 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-14 04:58:31,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1778 transitions. [2022-07-14 04:58:31,709 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1778 transitions. Word has length 123 [2022-07-14 04:58:31,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:58:31,710 INFO L495 AbstractCegarLoop]: Abstraction has 1321 states and 1778 transitions. [2022-07-14 04:58:31,710 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-14 04:58:31,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1778 transitions. [2022-07-14 04:58:31,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-14 04:58:31,711 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:58:31,711 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-14 04:58:31,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-14 04:58:31,712 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-14 04:58:31,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:58:31,712 INFO L85 PathProgramCache]: Analyzing trace with hash -508454391, now seen corresponding path program 1 times [2022-07-14 04:58:31,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:58:31,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440255783] [2022-07-14 04:58:31,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:58:31,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:58:31,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:31,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:58:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:31,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:58:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:31,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:58:31,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:31,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:58:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:31,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:58:31,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:31,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:58:31,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:31,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:58:31,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:31,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:58:31,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:31,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-14 04:58:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:31,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-14 04:58:31,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:31,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-14 04:58:31,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:31,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-14 04:58:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:31,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 04:58:31,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:31,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-14 04:58:31,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:31,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-14 04:58:31,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:31,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 04:58:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:31,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-14 04:58:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:31,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-14 04:58:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:31,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 04:58:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:31,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-14 04:58:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:31,983 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-14 04:58:31,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:58:31,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440255783] [2022-07-14 04:58:31,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440255783] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:58:31,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:58:31,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:58:31,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329802936] [2022-07-14 04:58:31,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:58:31,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:58:31,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:58:31,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:58:31,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:58:31,985 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-14 04:58:35,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:58:35,886 INFO L93 Difference]: Finished difference Result 1321 states and 1778 transitions. [2022-07-14 04:58:35,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:58:35,887 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-14 04:58:35,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:58:35,891 INFO L225 Difference]: With dead ends: 1321 [2022-07-14 04:58:35,891 INFO L226 Difference]: Without dead ends: 1319 [2022-07-14 04:58:35,892 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-14 04:58:35,892 INFO L413 NwaCegarLoop]: 1541 mSDtfsCounter, 3233 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 1966 mSolverCounterSat, 1568 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3298 SdHoareTripleChecker+Valid, 2012 SdHoareTripleChecker+Invalid, 3534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1568 IncrementalHoareTripleChecker+Valid, 1966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-14 04:58:35,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3298 Valid, 2012 Invalid, 3534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1568 Valid, 1966 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-07-14 04:58:35,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2022-07-14 04:58:35,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1319. [2022-07-14 04:58:35,931 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-14 04:58:35,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1776 transitions. [2022-07-14 04:58:35,935 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1776 transitions. Word has length 129 [2022-07-14 04:58:35,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:58:35,935 INFO L495 AbstractCegarLoop]: Abstraction has 1319 states and 1776 transitions. [2022-07-14 04:58:35,935 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-14 04:58:35,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1776 transitions. [2022-07-14 04:58:35,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-14 04:58:35,937 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:58:35,937 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-14 04:58:35,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 04:58:35,937 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-14 04:58:35,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:58:35,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1304382107, now seen corresponding path program 1 times [2022-07-14 04:58:35,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:58:35,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285578163] [2022-07-14 04:58:35,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:58:35,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:58:35,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:36,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:58:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:36,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:58:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:36,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:58:36,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:36,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:58:36,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:36,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:58:36,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:36,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:58:36,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:36,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:58:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:36,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:58:36,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:36,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-14 04:58:36,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:36,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-14 04:58:36,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:36,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-14 04:58:36,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:36,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-14 04:58:36,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:36,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 04:58:36,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:36,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-14 04:58:36,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:36,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-14 04:58:36,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:36,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 04:58:36,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:36,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-14 04:58:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:36,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-14 04:58:36,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:36,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 04:58:36,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:36,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-14 04:58:36,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:36,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-14 04:58:36,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:36,150 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-14 04:58:36,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:58:36,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285578163] [2022-07-14 04:58:36,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285578163] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:58:36,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:58:36,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:58:36,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422124576] [2022-07-14 04:58:36,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:58:36,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:58:36,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:58:36,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:58:36,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:58:36,154 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-14 04:58:39,134 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-14 04:58:41,779 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:58:42,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:58:42,595 INFO L93 Difference]: Finished difference Result 1319 states and 1776 transitions. [2022-07-14 04:58:42,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:58:42,595 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-14 04:58:42,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:58:42,600 INFO L225 Difference]: With dead ends: 1319 [2022-07-14 04:58:42,600 INFO L226 Difference]: Without dead ends: 1317 [2022-07-14 04:58:42,601 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-14 04:58:42,601 INFO L413 NwaCegarLoop]: 1539 mSDtfsCounter, 3227 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 1963 mSolverCounterSat, 1568 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3291 SdHoareTripleChecker+Valid, 2010 SdHoareTripleChecker+Invalid, 3532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1568 IncrementalHoareTripleChecker+Valid, 1963 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-07-14 04:58:42,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3291 Valid, 2010 Invalid, 3532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1568 Valid, 1963 Invalid, 1 Unknown, 0 Unchecked, 6.3s Time] [2022-07-14 04:58:42,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2022-07-14 04:58:42,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 1317. [2022-07-14 04:58:42,639 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-14 04:58:42,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1774 transitions. [2022-07-14 04:58:42,642 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1774 transitions. Word has length 135 [2022-07-14 04:58:42,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:58:42,643 INFO L495 AbstractCegarLoop]: Abstraction has 1317 states and 1774 transitions. [2022-07-14 04:58:42,643 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-14 04:58:42,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1774 transitions. [2022-07-14 04:58:42,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-14 04:58:42,644 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:58:42,644 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-14 04:58:42,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-14 04:58:42,645 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-14 04:58:42,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:58:42,645 INFO L85 PathProgramCache]: Analyzing trace with hash -2112872886, now seen corresponding path program 1 times [2022-07-14 04:58:42,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:58:42,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044715498] [2022-07-14 04:58:42,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:58:42,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:58:42,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:42,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:58:42,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:42,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:58:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:42,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:58:42,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:42,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:58:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:42,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:58:42,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:42,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:58:42,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:42,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:58:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:42,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:58:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:42,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-14 04:58:42,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:42,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-14 04:58:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:42,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-14 04:58:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:42,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-14 04:58:42,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:42,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 04:58:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:42,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-14 04:58:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:42,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-14 04:58:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:42,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 04:58:42,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:42,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-14 04:58:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:42,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-14 04:58:42,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:42,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 04:58:42,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:42,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-14 04:58:42,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:42,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-14 04:58:42,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:42,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-14 04:58:42,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:42,877 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-14 04:58:42,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:58:42,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044715498] [2022-07-14 04:58:42,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044715498] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:58:42,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:58:42,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:58:42,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190369388] [2022-07-14 04:58:42,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:58:42,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:58:42,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:58:42,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:58:42,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:58:42,879 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-14 04:58:45,315 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:58:48,466 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-14 04:58:49,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:58:49,367 INFO L93 Difference]: Finished difference Result 1317 states and 1774 transitions. [2022-07-14 04:58:49,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:58:49,368 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-14 04:58:49,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:58:49,372 INFO L225 Difference]: With dead ends: 1317 [2022-07-14 04:58:49,372 INFO L226 Difference]: Without dead ends: 1315 [2022-07-14 04:58:49,372 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-14 04:58:49,373 INFO L413 NwaCegarLoop]: 1537 mSDtfsCounter, 3221 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 1961 mSolverCounterSat, 1568 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s 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, 6.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:58:49,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3284 Valid, 2008 Invalid, 3530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1568 Valid, 1961 Invalid, 1 Unknown, 0 Unchecked, 6.4s Time] [2022-07-14 04:58:49,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2022-07-14 04:58:49,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1315. [2022-07-14 04:58:49,412 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-14 04:58:49,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1315 states and 1772 transitions. [2022-07-14 04:58:49,415 INFO L78 Accepts]: Start accepts. Automaton has 1315 states and 1772 transitions. Word has length 141 [2022-07-14 04:58:49,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:58:49,416 INFO L495 AbstractCegarLoop]: Abstraction has 1315 states and 1772 transitions. [2022-07-14 04:58:49,416 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-14 04:58:49,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 1772 transitions. [2022-07-14 04:58:49,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-14 04:58:49,419 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:58:49,419 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-14 04:58:49,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-14 04:58:49,419 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-14 04:58:49,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:58:49,420 INFO L85 PathProgramCache]: Analyzing trace with hash 163115201, now seen corresponding path program 1 times [2022-07-14 04:58:49,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:58:49,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328010672] [2022-07-14 04:58:49,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:58:49,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:58:49,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:49,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:58:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:49,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:58:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:49,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:58:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:49,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:58:49,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:49,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:58:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:49,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:58:49,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:49,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:58:49,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:49,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:58:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:49,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 04:58:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:49,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:58:49,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:49,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:58:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:49,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:58:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:49,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-14 04:58:49,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:49,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:58:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:49,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:58:49,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:49,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:58:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:49,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:58:49,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:49,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:58:49,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:49,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:58:49,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:49,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:58:49,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:49,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 04:58:49,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:49,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 04:58:49,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:49,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-14 04:58:49,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:49,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-14 04:58:49,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:49,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:58:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:49,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 04:58:49,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:49,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 04:58:49,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:49,872 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-14 04:58:49,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:58:49,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328010672] [2022-07-14 04:58:49,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328010672] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:58:49,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:58:49,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-14 04:58:49,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279182148] [2022-07-14 04:58:49,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:58:49,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 04:58:49,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:58:49,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 04:58:49,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-14 04:58:49,875 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-14 04:58:54,114 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:58:55,574 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:59:00,118 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:59:03,073 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-14 04:59:05,105 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-14 04:59:07,137 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-14 04:59:15,035 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:59:17,069 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-14 04:59:19,107 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-14 04:59:21,136 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-14 04:59:23,168 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-14 04:59:25,200 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-14 04:59:27,230 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-14 04:59:29,261 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-14 04:59:31,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:59:31,968 INFO L93 Difference]: Finished difference Result 2791 states and 3983 transitions. [2022-07-14 04:59:31,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-14 04:59:31,968 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-14 04:59:31,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:59:31,974 INFO L225 Difference]: With dead ends: 2791 [2022-07-14 04:59:31,975 INFO L226 Difference]: Without dead ends: 1531 [2022-07-14 04:59:31,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=482, Unknown=0, NotChecked=0, Total=650 [2022-07-14 04:59:31,979 INFO L413 NwaCegarLoop]: 1463 mSDtfsCounter, 3126 mSDsluCounter, 1796 mSDsCounter, 0 mSdLazyCounter, 12596 mSolverCounterSat, 2382 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3126 SdHoareTripleChecker+Valid, 3259 SdHoareTripleChecker+Invalid, 14988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2382 IncrementalHoareTripleChecker+Valid, 12596 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.6s IncrementalHoareTripleChecker+Time [2022-07-14 04:59:31,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3126 Valid, 3259 Invalid, 14988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2382 Valid, 12596 Invalid, 10 Unknown, 0 Unchecked, 41.6s Time] [2022-07-14 04:59:31,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2022-07-14 04:59:32,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1318. [2022-07-14 04:59:32,031 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-14 04:59:32,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 1776 transitions. [2022-07-14 04:59:32,035 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 1776 transitions. Word has length 169 [2022-07-14 04:59:32,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:59:32,035 INFO L495 AbstractCegarLoop]: Abstraction has 1318 states and 1776 transitions. [2022-07-14 04:59:32,035 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-14 04:59:32,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1776 transitions. [2022-07-14 04:59:32,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-14 04:59:32,037 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:59:32,037 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-14 04:59:32,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-14 04:59:32,037 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-14 04:59:32,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:59:32,038 INFO L85 PathProgramCache]: Analyzing trace with hash -245709024, now seen corresponding path program 1 times [2022-07-14 04:59:32,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:59:32,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590715767] [2022-07-14 04:59:32,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:59:32,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:59:32,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:32,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:59:32,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:32,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:59:32,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:32,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:59:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:32,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:59:32,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:32,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:59:32,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:32,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:59:32,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:32,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:59:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:32,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:59:32,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:32,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 04:59:32,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:32,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:59:32,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:32,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:59:32,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:32,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:59:32,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:32,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-14 04:59:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:32,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:59:32,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:32,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:59:32,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:32,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:59:32,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:32,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:59:32,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:32,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:59:32,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:32,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:59:32,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:32,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:59:32,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:32,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 04:59:32,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:32,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 04:59:32,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:32,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-14 04:59:32,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:32,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-14 04:59:32,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:32,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:59:32,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:32,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 04:59:32,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:32,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 04:59:32,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:32,349 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-14 04:59:32,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:59:32,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590715767] [2022-07-14 04:59:32,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590715767] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:59:32,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:59:32,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 04:59:32,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099532043] [2022-07-14 04:59:32,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:59:32,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 04:59:32,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:59:32,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 04:59:32,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-14 04:59:32,353 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-14 04:59:37,613 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-14 04:59:40,410 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:59:44,164 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-14 04:59:49,237 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-14 04:59:51,286 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:59:53,320 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-14 04:59:55,356 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-14 04:59:56,704 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:59:58,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:59:58,902 INFO L93 Difference]: Finished difference Result 2811 states and 3886 transitions. [2022-07-14 04:59:58,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 04:59:58,902 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-14 04:59:58,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:59:58,911 INFO L225 Difference]: With dead ends: 2811 [2022-07-14 04:59:58,911 INFO L226 Difference]: Without dead ends: 1548 [2022-07-14 04:59:58,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2022-07-14 04:59:58,917 INFO L413 NwaCegarLoop]: 1475 mSDtfsCounter, 3145 mSDsluCounter, 1151 mSDsCounter, 0 mSdLazyCounter, 7744 mSolverCounterSat, 2318 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3145 SdHoareTripleChecker+Valid, 2626 SdHoareTripleChecker+Invalid, 10067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2318 IncrementalHoareTripleChecker+Valid, 7744 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.2s IncrementalHoareTripleChecker+Time [2022-07-14 04:59:58,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3145 Valid, 2626 Invalid, 10067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2318 Valid, 7744 Invalid, 5 Unknown, 0 Unchecked, 26.2s Time] [2022-07-14 04:59:58,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2022-07-14 04:59:59,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1334. [2022-07-14 04:59:59,029 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-14 04:59:59,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1334 states and 1806 transitions. [2022-07-14 04:59:59,034 INFO L78 Accepts]: Start accepts. Automaton has 1334 states and 1806 transitions. Word has length 169 [2022-07-14 04:59:59,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:59:59,034 INFO L495 AbstractCegarLoop]: Abstraction has 1334 states and 1806 transitions. [2022-07-14 04:59:59,035 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-14 04:59:59,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1806 transitions. [2022-07-14 04:59:59,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-14 04:59:59,037 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:59:59,037 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-14 04:59:59,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-14 04:59:59,038 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-14 04:59:59,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:59:59,038 INFO L85 PathProgramCache]: Analyzing trace with hash 434349346, now seen corresponding path program 1 times [2022-07-14 04:59:59,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:59:59,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304919848] [2022-07-14 04:59:59,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:59:59,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:59:59,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:59,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:59:59,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:59,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:59:59,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:59,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:59:59,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:59,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:59:59,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:59,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:59:59,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:59,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:59:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:59,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:59:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:59,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:59:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:59,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 04:59:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:59,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:59:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:59,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:59:59,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:59,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:59:59,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:59,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-14 04:59:59,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:59,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:59:59,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:59,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:59:59,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:59,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:59:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:59,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:59:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:59,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:59:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:59,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:59:59,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:59,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:59:59,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:59,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 04:59:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:59,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 04:59:59,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:59,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-14 04:59:59,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:59,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-14 04:59:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:59,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:59:59,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:59,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 04:59:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:59,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 04:59:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:59:59,452 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-14 04:59:59,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:59:59,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304919848] [2022-07-14 04:59:59,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304919848] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:59:59,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:59:59,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 04:59:59,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255215858] [2022-07-14 04:59:59,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:59:59,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 04:59:59,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:59:59,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 04:59:59,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-14 04:59:59,455 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-14 05:00:02,711 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 05:00:06,277 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-14 05:00:08,322 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 05:00:09,387 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-14 05:00:18,395 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-14 05:00:20,442 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 05:00:22,484 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-14 05:00:24,523 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-14 05:00:27,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:00:27,392 INFO L93 Difference]: Finished difference Result 1934 states and 2802 transitions. [2022-07-14 05:00:27,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-14 05:00:27,393 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 169 [2022-07-14 05:00:27,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:00:27,400 INFO L225 Difference]: With dead ends: 1934 [2022-07-14 05:00:27,400 INFO L226 Difference]: Without dead ends: 1932 [2022-07-14 05:00:27,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=320, Unknown=0, NotChecked=0, Total=462 [2022-07-14 05:00:27,401 INFO L413 NwaCegarLoop]: 1648 mSDtfsCounter, 4861 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 7903 mSolverCounterSat, 3362 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4928 SdHoareTripleChecker+Valid, 2584 SdHoareTripleChecker+Invalid, 11271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3362 IncrementalHoareTripleChecker+Valid, 7903 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.6s IncrementalHoareTripleChecker+Time [2022-07-14 05:00:27,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4928 Valid, 2584 Invalid, 11271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3362 Valid, 7903 Invalid, 6 Unknown, 0 Unchecked, 27.6s Time] [2022-07-14 05:00:27,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1932 states. [2022-07-14 05:00:27,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1932 to 1702. [2022-07-14 05:00:27,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1702 states, 1154 states have (on average 1.3050259965337956) internal successors, (1506), 1187 states have internal predecessors, (1506), 411 states have call successors, (411), 129 states have call predecessors, (411), 129 states have return successors, (501), 399 states have call predecessors, (501), 409 states have call successors, (501) [2022-07-14 05:00:27,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 2418 transitions. [2022-07-14 05:00:27,504 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 2418 transitions. Word has length 169 [2022-07-14 05:00:27,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:00:27,504 INFO L495 AbstractCegarLoop]: Abstraction has 1702 states and 2418 transitions. [2022-07-14 05:00:27,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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-14 05:00:27,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 2418 transitions. [2022-07-14 05:00:27,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-14 05:00:27,506 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:00:27,506 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:00:27,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-14 05:00:27,506 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-07-14 05:00:27,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:00:27,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1418614130, now seen corresponding path program 1 times [2022-07-14 05:00:27,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:00:27,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415548109] [2022-07-14 05:00:27,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:00:27,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:00:27,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:27,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 05:00:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:27,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 05:00:27,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:27,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 05:00:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:27,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 05:00:27,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:27,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 05:00:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:27,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 05:00:27,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:27,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 05:00:27,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:27,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 05:00:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:27,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-14 05:00:27,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:27,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-14 05:00:27,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:27,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-14 05:00:27,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:27,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-14 05:00:27,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:27,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 05:00:27,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:27,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-14 05:00:27,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:27,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-14 05:00:27,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:27,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 05:00:27,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:27,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-14 05:00:27,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:27,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-14 05:00:27,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:27,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 05:00:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:27,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-14 05:00:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:27,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-14 05:00:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:27,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-14 05:00:27,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:27,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 05:00:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:27,708 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-14 05:00:27,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:00:27,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415548109] [2022-07-14 05:00:27,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415548109] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:00:27,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:00:27,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 05:00:27,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342826807] [2022-07-14 05:00:27,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:00:27,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 05:00:27,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:00:27,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 05:00:27,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:00:27,710 INFO L87 Difference]: Start difference. First operand 1702 states and 2418 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-14 05:00:32,012 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-14 05:00:32,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:00:32,938 INFO L93 Difference]: Finished difference Result 1702 states and 2418 transitions. [2022-07-14 05:00:32,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 05:00:32,938 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 147 [2022-07-14 05:00:32,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:00:32,945 INFO L225 Difference]: With dead ends: 1702 [2022-07-14 05:00:32,945 INFO L226 Difference]: Without dead ends: 1700 [2022-07-14 05:00:32,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 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-14 05:00:32,946 INFO L413 NwaCegarLoop]: 1535 mSDtfsCounter, 3215 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 1959 mSolverCounterSat, 1568 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3277 SdHoareTripleChecker+Valid, 2006 SdHoareTripleChecker+Invalid, 3528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1568 IncrementalHoareTripleChecker+Valid, 1959 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:00:32,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3277 Valid, 2006 Invalid, 3528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1568 Valid, 1959 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2022-07-14 05:00:32,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2022-07-14 05:00:33,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1700. [2022-07-14 05:00:33,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1700 states, 1153 states have (on average 1.3044232437120555) internal successors, (1504), 1185 states have internal predecessors, (1504), 411 states have call successors, (411), 129 states have call predecessors, (411), 129 states have return successors, (501), 399 states have call predecessors, (501), 409 states have call successors, (501) [2022-07-14 05:00:33,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 2416 transitions. [2022-07-14 05:00:33,021 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 2416 transitions. Word has length 147 [2022-07-14 05:00:33,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:00:33,021 INFO L495 AbstractCegarLoop]: Abstraction has 1700 states and 2416 transitions. [2022-07-14 05:00:33,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-14 05:00:33,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 2416 transitions. [2022-07-14 05:00:33,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-14 05:00:33,023 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:00:33,023 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:00:33,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-14 05:00:33,024 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-07-14 05:00:33,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:00:33,024 INFO L85 PathProgramCache]: Analyzing trace with hash 421683805, now seen corresponding path program 1 times [2022-07-14 05:00:33,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:00:33,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477151069] [2022-07-14 05:00:33,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:00:33,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:00:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:33,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 05:00:33,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:33,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 05:00:33,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:33,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 05:00:33,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:33,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 05:00:33,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:33,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 05:00:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:33,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 05:00:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:33,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 05:00:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:33,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 05:00:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:33,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-14 05:00:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:33,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-14 05:00:33,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:33,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-14 05:00:33,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:33,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-14 05:00:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:33,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 05:00:33,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:33,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-14 05:00:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:33,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-14 05:00:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:33,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 05:00:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:33,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-14 05:00:33,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:33,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-14 05:00:33,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:33,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 05:00:33,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:33,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-14 05:00:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:33,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-14 05:00:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:33,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-14 05:00:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:33,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 05:00:33,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:33,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-14 05:00:33,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:33,273 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-14 05:00:33,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:00:33,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477151069] [2022-07-14 05:00:33,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477151069] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:00:33,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:00:33,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 05:00:33,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508862481] [2022-07-14 05:00:33,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:00:33,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 05:00:33,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:00:33,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 05:00:33,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:00:33,275 INFO L87 Difference]: Start difference. First operand 1700 states and 2416 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-14 05:00:36,106 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-14 05:00:39,366 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-14 05:00:40,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:00:40,330 INFO L93 Difference]: Finished difference Result 1700 states and 2416 transitions. [2022-07-14 05:00:40,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 05:00:40,330 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 153 [2022-07-14 05:00:40,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:00:40,337 INFO L225 Difference]: With dead ends: 1700 [2022-07-14 05:00:40,337 INFO L226 Difference]: Without dead ends: 1698 [2022-07-14 05:00:40,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 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-14 05:00:40,338 INFO L413 NwaCegarLoop]: 1533 mSDtfsCounter, 3209 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 1956 mSolverCounterSat, 1568 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3270 SdHoareTripleChecker+Valid, 2004 SdHoareTripleChecker+Invalid, 3526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1568 IncrementalHoareTripleChecker+Valid, 1956 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-07-14 05:00:40,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3270 Valid, 2004 Invalid, 3526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1568 Valid, 1956 Invalid, 2 Unknown, 0 Unchecked, 6.9s Time] [2022-07-14 05:00:40,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2022-07-14 05:00:40,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 1698. [2022-07-14 05:00:40,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1698 states, 1152 states have (on average 1.3038194444444444) internal successors, (1502), 1183 states have internal predecessors, (1502), 411 states have call successors, (411), 129 states have call predecessors, (411), 129 states have return successors, (501), 399 states have call predecessors, (501), 409 states have call successors, (501) [2022-07-14 05:00:40,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1698 states and 2414 transitions. [2022-07-14 05:00:40,415 INFO L78 Accepts]: Start accepts. Automaton has 1698 states and 2414 transitions. Word has length 153 [2022-07-14 05:00:40,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:00:40,416 INFO L495 AbstractCegarLoop]: Abstraction has 1698 states and 2414 transitions. [2022-07-14 05:00:40,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-14 05:00:40,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1698 states and 2414 transitions. [2022-07-14 05:00:40,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-07-14 05:00:40,418 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:00:40,418 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:00:40,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-14 05:00:40,418 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-07-14 05:00:40,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:00:40,419 INFO L85 PathProgramCache]: Analyzing trace with hash 2118220630, now seen corresponding path program 1 times [2022-07-14 05:00:40,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:00:40,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973728011] [2022-07-14 05:00:40,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:00:40,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:00:40,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:40,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 05:00:40,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:40,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 05:00:40,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:40,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 05:00:40,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:40,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 05:00:40,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:40,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 05:00:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:40,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 05:00:40,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:40,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 05:00:40,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:40,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 05:00:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:40,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-14 05:00:40,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:40,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-14 05:00:40,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:40,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-14 05:00:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:40,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-14 05:00:40,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:40,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 05:00:40,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:40,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-14 05:00:40,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:40,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-14 05:00:40,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:40,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 05:00:40,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:40,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-14 05:00:40,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:40,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-14 05:00:40,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:40,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 05:00:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:40,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-14 05:00:40,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:40,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-14 05:00:40,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:40,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-14 05:00:40,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:40,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 05:00:40,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:40,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-14 05:00:40,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:40,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-14 05:00:40,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:40,659 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-14 05:00:40,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:00:40,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973728011] [2022-07-14 05:00:40,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973728011] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:00:40,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:00:40,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 05:00:40,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814941529] [2022-07-14 05:00:40,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:00:40,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 05:00:40,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:00:40,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 05:00:40,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:00:40,662 INFO L87 Difference]: Start difference. First operand 1698 states and 2414 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-14 05:00:43,825 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-14 05:00:46,970 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-14 05:00:47,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:00:47,862 INFO L93 Difference]: Finished difference Result 1698 states and 2414 transitions. [2022-07-14 05:00:47,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 05:00:47,863 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 159 [2022-07-14 05:00:47,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:00:47,868 INFO L225 Difference]: With dead ends: 1698 [2022-07-14 05:00:47,868 INFO L226 Difference]: Without dead ends: 1696 [2022-07-14 05:00:47,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 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-14 05:00:47,869 INFO L413 NwaCegarLoop]: 1531 mSDtfsCounter, 3203 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 1954 mSolverCounterSat, 1568 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3263 SdHoareTripleChecker+Valid, 2002 SdHoareTripleChecker+Invalid, 3524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1568 IncrementalHoareTripleChecker+Valid, 1954 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:00:47,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3263 Valid, 2002 Invalid, 3524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1568 Valid, 1954 Invalid, 2 Unknown, 0 Unchecked, 7.1s Time] [2022-07-14 05:00:47,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1696 states. [2022-07-14 05:00:47,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1696 to 1696. [2022-07-14 05:00:47,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1696 states, 1151 states have (on average 1.3032145960034753) internal successors, (1500), 1181 states have internal predecessors, (1500), 411 states have call successors, (411), 129 states have call predecessors, (411), 129 states have return successors, (501), 399 states have call predecessors, (501), 409 states have call successors, (501) [2022-07-14 05:00:47,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 2412 transitions. [2022-07-14 05:00:47,942 INFO L78 Accepts]: Start accepts. Automaton has 1696 states and 2412 transitions. Word has length 159 [2022-07-14 05:00:47,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:00:47,942 INFO L495 AbstractCegarLoop]: Abstraction has 1696 states and 2412 transitions. [2022-07-14 05:00:47,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-14 05:00:47,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 2412 transitions. [2022-07-14 05:00:47,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-07-14 05:00:47,945 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:00:47,945 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:00:47,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-14 05:00:47,945 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-07-14 05:00:47,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:00:47,946 INFO L85 PathProgramCache]: Analyzing trace with hash -689696139, now seen corresponding path program 1 times [2022-07-14 05:00:47,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:00:47,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203575885] [2022-07-14 05:00:47,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:00:47,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:00:48,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:48,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 05:00:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:48,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 05:00:48,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:48,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 05:00:48,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:48,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 05:00:48,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:48,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 05:00:48,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:48,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 05:00:48,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:48,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 05:00:48,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:48,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 05:00:48,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:48,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 05:00:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:48,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 05:00:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:48,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 05:00:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:48,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 05:00:48,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:48,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-14 05:00:48,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:48,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 05:00:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:48,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 05:00:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:48,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 05:00:48,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:48,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 05:00:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:48,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 05:00:48,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:48,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 05:00:48,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:48,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 05:00:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:48,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 05:00:48,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:48,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 05:00:48,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:48,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-14 05:00:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:48,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-14 05:00:48,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:48,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 05:00:48,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:48,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 05:00:48,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:48,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 05:00:48,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:48,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-14 05:00:48,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:48,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 05:00:48,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:48,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-14 05:00:48,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:00:48,353 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-14 05:00:48,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:00:48,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203575885] [2022-07-14 05:00:48,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203575885] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:00:48,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:00:48,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-14 05:00:48,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229344685] [2022-07-14 05:00:48,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:00:48,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 05:00:48,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:00:48,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 05:00:48,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-07-14 05:00:48,355 INFO L87 Difference]: Start difference. First operand 1696 states and 2412 transitions. Second operand has 12 states, 11 states have (on average 6.818181818181818) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (29), 9 states have call predecessors, (29), 2 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-14 05:00:57,661 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-14 05:00:58,815 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 05:01:01,272 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-14 05:01:03,319 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []