./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e19ca921 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.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 5574142529d95f295134c1dccd4c5dbe0383ae5c309e7dc50fd933e5702659ed --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 16:06:25,341 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 16:06:25,367 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 16:06:25,405 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 16:06:25,405 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 16:06:25,408 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 16:06:25,409 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 16:06:25,411 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 16:06:25,413 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 16:06:25,414 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 16:06:25,415 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 16:06:25,416 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 16:06:25,416 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 16:06:25,421 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 16:06:25,422 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 16:06:25,424 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 16:06:25,425 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 16:06:25,426 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 16:06:25,427 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 16:06:25,432 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 16:06:25,433 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 16:06:25,434 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 16:06:25,435 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 16:06:25,436 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 16:06:25,441 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 16:06:25,442 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 16:06:25,442 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 16:06:25,443 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 16:06:25,444 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 16:06:25,444 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 16:06:25,444 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 16:06:25,445 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 16:06:25,447 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 16:06:25,448 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 16:06:25,449 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 16:06:25,449 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 16:06:25,449 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 16:06:25,450 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 16:06:25,450 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 16:06:25,450 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 16:06:25,451 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 16:06:25,452 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-22 16:06:25,472 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 16:06:25,473 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 16:06:25,473 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 16:06:25,473 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 16:06:25,474 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 16:06:25,474 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 16:06:25,475 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 16:06:25,475 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 16:06:25,475 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 16:06:25,475 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 16:06:25,476 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 16:06:25,476 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 16:06:25,476 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-22 16:06:25,476 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 16:06:25,477 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-22 16:06:25,477 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-22 16:06:25,477 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 16:06:25,477 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-22 16:06:25,477 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 16:06:25,477 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 16:06:25,478 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 16:06:25,478 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 16:06:25,478 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 16:06:25,478 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 16:06:25,478 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-22 16:06:25,478 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 16:06:25,478 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-22 16:06:25,480 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-22 16:06:25,480 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-22 16:06:25,480 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-22 16:06:25,480 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 16:06:25,480 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 -> 5574142529d95f295134c1dccd4c5dbe0383ae5c309e7dc50fd933e5702659ed [2021-12-22 16:06:25,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 16:06:25,700 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 16:06:25,702 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 16:06:25,703 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 16:06:25,703 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 16:06:25,704 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i [2021-12-22 16:06:25,763 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92d5f6cb9/07c610d7fc9d4006a27f02d40d9b5870/FLAG7ec3b5b9f [2021-12-22 16:06:26,355 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 16:06:26,356 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i [2021-12-22 16:06:26,399 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92d5f6cb9/07c610d7fc9d4006a27f02d40d9b5870/FLAG7ec3b5b9f [2021-12-22 16:06:26,562 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92d5f6cb9/07c610d7fc9d4006a27f02d40d9b5870 [2021-12-22 16:06:26,564 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 16:06:26,566 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 16:06:26,567 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 16:06:26,567 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 16:06:26,572 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 16:06:26,572 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 04:06:26" (1/1) ... [2021-12-22 16:06:26,573 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21b318d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:06:26, skipping insertion in model container [2021-12-22 16:06:26,574 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 04:06:26" (1/1) ... [2021-12-22 16:06:26,579 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 16:06:26,675 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 16:06:28,354 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273031,273044] [2021-12-22 16:06:28,356 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273176,273189] [2021-12-22 16:06:28,357 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273322,273335] [2021-12-22 16:06:28,357 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273487,273500] [2021-12-22 16:06:28,357 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273645,273658] [2021-12-22 16:06:28,358 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273803,273816] [2021-12-22 16:06:28,358 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273961,273974] [2021-12-22 16:06:28,359 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274121,274134] [2021-12-22 16:06:28,359 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274280,274293] [2021-12-22 16:06:28,359 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274419,274432] [2021-12-22 16:06:28,360 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274561,274574] [2021-12-22 16:06:28,360 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274710,274723] [2021-12-22 16:06:28,365 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274849,274862] [2021-12-22 16:06:28,366 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275004,275017] [2021-12-22 16:06:28,367 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275164,275177] [2021-12-22 16:06:28,367 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275315,275328] [2021-12-22 16:06:28,368 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275466,275479] [2021-12-22 16:06:28,372 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275618,275631] [2021-12-22 16:06:28,373 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275767,275780] [2021-12-22 16:06:28,374 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275915,275928] [2021-12-22 16:06:28,375 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276072,276085] [2021-12-22 16:06:28,375 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276221,276234] [2021-12-22 16:06:28,375 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276377,276390] [2021-12-22 16:06:28,376 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276530,276543] [2021-12-22 16:06:28,377 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276676,276689] [2021-12-22 16:06:28,378 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276819,276832] [2021-12-22 16:06:28,378 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276971,276984] [2021-12-22 16:06:28,378 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277117,277130] [2021-12-22 16:06:28,379 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277262,277275] [2021-12-22 16:06:28,380 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277416,277429] [2021-12-22 16:06:28,381 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277567,277580] [2021-12-22 16:06:28,381 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277722,277735] [2021-12-22 16:06:28,381 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277874,277887] [2021-12-22 16:06:28,382 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278029,278042] [2021-12-22 16:06:28,383 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278193,278206] [2021-12-22 16:06:28,383 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278349,278362] [2021-12-22 16:06:28,383 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278513,278526] [2021-12-22 16:06:28,383 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278655,278668] [2021-12-22 16:06:28,384 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278813,278826] [2021-12-22 16:06:28,384 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278980,278993] [2021-12-22 16:06:28,384 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279139,279152] [2021-12-22 16:06:28,385 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279298,279311] [2021-12-22 16:06:28,385 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279447,279460] [2021-12-22 16:06:28,385 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279594,279607] [2021-12-22 16:06:28,385 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279733,279746] [2021-12-22 16:06:28,386 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279896,279909] [2021-12-22 16:06:28,386 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280062,280075] [2021-12-22 16:06:28,387 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280226,280239] [2021-12-22 16:06:28,387 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280391,280404] [2021-12-22 16:06:28,388 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280556,280569] [2021-12-22 16:06:28,388 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280722,280735] [2021-12-22 16:06:28,388 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280887,280900] [2021-12-22 16:06:28,389 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281054,281067] [2021-12-22 16:06:28,389 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281214,281227] [2021-12-22 16:06:28,389 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281376,281389] [2021-12-22 16:06:28,390 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281535,281548] [2021-12-22 16:06:28,391 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281681,281694] [2021-12-22 16:06:28,391 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281824,281837] [2021-12-22 16:06:28,391 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281968,281981] [2021-12-22 16:06:28,392 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282111,282124] [2021-12-22 16:06:28,392 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282255,282268] [2021-12-22 16:06:28,392 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282396,282409] [2021-12-22 16:06:28,393 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282534,282547] [2021-12-22 16:06:28,393 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282692,282705] [2021-12-22 16:06:28,393 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282851,282864] [2021-12-22 16:06:28,394 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283007,283020] [2021-12-22 16:06:28,394 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283156,283169] [2021-12-22 16:06:28,394 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283308,283321] [2021-12-22 16:06:28,395 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283459,283472] [2021-12-22 16:06:28,395 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283608,283621] [2021-12-22 16:06:28,395 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283760,283773] [2021-12-22 16:06:28,395 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283908,283921] [2021-12-22 16:06:28,396 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284061,284074] [2021-12-22 16:06:28,396 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284212,284225] [2021-12-22 16:06:28,396 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284362,284375] [2021-12-22 16:06:28,396 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284509,284522] [2021-12-22 16:06:28,397 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284660,284673] [2021-12-22 16:06:28,397 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284811,284824] [2021-12-22 16:06:28,397 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284959,284972] [2021-12-22 16:06:28,398 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285125,285138] [2021-12-22 16:06:28,398 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285294,285307] [2021-12-22 16:06:28,398 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285461,285474] [2021-12-22 16:06:28,399 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285629,285642] [2021-12-22 16:06:28,399 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285779,285792] [2021-12-22 16:06:28,399 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285926,285939] [2021-12-22 16:06:28,399 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286087,286100] [2021-12-22 16:06:28,400 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286257,286270] [2021-12-22 16:06:28,400 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286419,286432] [2021-12-22 16:06:28,405 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 16:06:28,421 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 16:06:28,606 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273031,273044] [2021-12-22 16:06:28,607 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273176,273189] [2021-12-22 16:06:28,608 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273322,273335] [2021-12-22 16:06:28,608 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273487,273500] [2021-12-22 16:06:28,609 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273645,273658] [2021-12-22 16:06:28,610 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273803,273816] [2021-12-22 16:06:28,610 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273961,273974] [2021-12-22 16:06:28,611 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274121,274134] [2021-12-22 16:06:28,614 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274280,274293] [2021-12-22 16:06:28,616 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274419,274432] [2021-12-22 16:06:28,616 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274561,274574] [2021-12-22 16:06:28,616 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274710,274723] [2021-12-22 16:06:28,617 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274849,274862] [2021-12-22 16:06:28,617 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275004,275017] [2021-12-22 16:06:28,617 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275164,275177] [2021-12-22 16:06:28,618 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275315,275328] [2021-12-22 16:06:28,618 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275466,275479] [2021-12-22 16:06:28,618 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275618,275631] [2021-12-22 16:06:28,618 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275767,275780] [2021-12-22 16:06:28,619 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275915,275928] [2021-12-22 16:06:28,620 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276072,276085] [2021-12-22 16:06:28,621 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276221,276234] [2021-12-22 16:06:28,622 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276377,276390] [2021-12-22 16:06:28,622 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276530,276543] [2021-12-22 16:06:28,622 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276676,276689] [2021-12-22 16:06:28,622 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276819,276832] [2021-12-22 16:06:28,623 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276971,276984] [2021-12-22 16:06:28,623 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277117,277130] [2021-12-22 16:06:28,623 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277262,277275] [2021-12-22 16:06:28,624 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277416,277429] [2021-12-22 16:06:28,624 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277567,277580] [2021-12-22 16:06:28,624 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277722,277735] [2021-12-22 16:06:28,624 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277874,277887] [2021-12-22 16:06:28,625 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278029,278042] [2021-12-22 16:06:28,625 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278193,278206] [2021-12-22 16:06:28,626 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278349,278362] [2021-12-22 16:06:28,626 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278513,278526] [2021-12-22 16:06:28,626 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278655,278668] [2021-12-22 16:06:28,627 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278813,278826] [2021-12-22 16:06:28,628 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278980,278993] [2021-12-22 16:06:28,629 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279139,279152] [2021-12-22 16:06:28,629 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279298,279311] [2021-12-22 16:06:28,629 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279447,279460] [2021-12-22 16:06:28,629 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279594,279607] [2021-12-22 16:06:28,630 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279733,279746] [2021-12-22 16:06:28,630 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279896,279909] [2021-12-22 16:06:28,630 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280062,280075] [2021-12-22 16:06:28,631 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280226,280239] [2021-12-22 16:06:28,631 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280391,280404] [2021-12-22 16:06:28,632 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280556,280569] [2021-12-22 16:06:28,632 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280722,280735] [2021-12-22 16:06:28,632 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280887,280900] [2021-12-22 16:06:28,632 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281054,281067] [2021-12-22 16:06:28,633 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281214,281227] [2021-12-22 16:06:28,633 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281376,281389] [2021-12-22 16:06:28,633 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281535,281548] [2021-12-22 16:06:28,634 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281681,281694] [2021-12-22 16:06:28,634 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281824,281837] [2021-12-22 16:06:28,634 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281968,281981] [2021-12-22 16:06:28,635 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282111,282124] [2021-12-22 16:06:28,635 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282255,282268] [2021-12-22 16:06:28,636 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282396,282409] [2021-12-22 16:06:28,637 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282534,282547] [2021-12-22 16:06:28,639 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282692,282705] [2021-12-22 16:06:28,640 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282851,282864] [2021-12-22 16:06:28,640 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283007,283020] [2021-12-22 16:06:28,640 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283156,283169] [2021-12-22 16:06:28,642 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283308,283321] [2021-12-22 16:06:28,642 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283459,283472] [2021-12-22 16:06:28,642 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283608,283621] [2021-12-22 16:06:28,642 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283760,283773] [2021-12-22 16:06:28,648 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283908,283921] [2021-12-22 16:06:28,652 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284061,284074] [2021-12-22 16:06:28,652 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284212,284225] [2021-12-22 16:06:28,652 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284362,284375] [2021-12-22 16:06:28,652 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284509,284522] [2021-12-22 16:06:28,653 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284660,284673] [2021-12-22 16:06:28,661 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284811,284824] [2021-12-22 16:06:28,662 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284959,284972] [2021-12-22 16:06:28,663 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285125,285138] [2021-12-22 16:06:28,663 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285294,285307] [2021-12-22 16:06:28,664 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285461,285474] [2021-12-22 16:06:28,664 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285629,285642] [2021-12-22 16:06:28,664 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285779,285792] [2021-12-22 16:06:28,665 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285926,285939] [2021-12-22 16:06:28,665 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286087,286100] [2021-12-22 16:06:28,665 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286257,286270] [2021-12-22 16:06:28,665 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286419,286432] [2021-12-22 16:06:28,668 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 16:06:28,818 INFO L208 MainTranslator]: Completed translation [2021-12-22 16:06:28,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:06:28 WrapperNode [2021-12-22 16:06:28,819 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 16:06:28,820 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 16:06:28,820 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 16:06:28,820 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 16:06:28,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:06:28" (1/1) ... [2021-12-22 16:06:28,897 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:06:28" (1/1) ... [2021-12-22 16:06:28,968 INFO L137 Inliner]: procedures = 526, calls = 1327, calls flagged for inlining = 223, calls inlined = 134, statements flattened = 2372 [2021-12-22 16:06:28,969 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 16:06:28,969 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 16:06:28,969 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 16:06:28,969 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 16:06:28,975 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:06:28" (1/1) ... [2021-12-22 16:06:28,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:06:28" (1/1) ... [2021-12-22 16:06:28,984 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:06:28" (1/1) ... [2021-12-22 16:06:28,985 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:06:28" (1/1) ... [2021-12-22 16:06:29,047 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:06:28" (1/1) ... [2021-12-22 16:06:29,053 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:06:28" (1/1) ... [2021-12-22 16:06:29,061 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:06:28" (1/1) ... [2021-12-22 16:06:29,075 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 16:06:29,076 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 16:06:29,076 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 16:06:29,077 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 16:06:29,077 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:06:28" (1/1) ... [2021-12-22 16:06:29,082 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 16:06:29,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:06:29,099 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) [2021-12-22 16:06:29,117 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 [2021-12-22 16:06:29,141 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2021-12-22 16:06:29,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2021-12-22 16:06:29,142 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-12-22 16:06:29,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-12-22 16:06:29,142 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-12-22 16:06:29,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-12-22 16:06:29,142 INFO L130 BoogieDeclarations]: Found specification of procedure __might_sleep [2021-12-22 16:06:29,142 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_sleep [2021-12-22 16:06:29,143 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2021-12-22 16:06:29,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2021-12-22 16:06:29,143 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2021-12-22 16:06:29,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2021-12-22 16:06:29,143 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2021-12-22 16:06:29,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2021-12-22 16:06:29,143 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_read_buffer_lock_of_lego_usb_tower [2021-12-22 16:06:29,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_read_buffer_lock_of_lego_usb_tower [2021-12-22 16:06:29,143 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2021-12-22 16:06:29,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2021-12-22 16:06:29,144 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2021-12-22 16:06:29,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2021-12-22 16:06:29,144 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2021-12-22 16:06:29,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2021-12-22 16:06:29,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-22 16:06:29,144 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2021-12-22 16:06:29,144 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2021-12-22 16:06:29,144 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2021-12-22 16:06:29,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2021-12-22 16:06:29,145 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2021-12-22 16:06:29,145 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2021-12-22 16:06:29,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-12-22 16:06:29,145 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2021-12-22 16:06:29,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2021-12-22 16:06:29,145 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2021-12-22 16:06:29,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2021-12-22 16:06:29,145 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irq_112 [2021-12-22 16:06:29,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irq_112 [2021-12-22 16:06:29,145 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-12-22 16:06:29,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-12-22 16:06:29,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-22 16:06:29,146 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2021-12-22 16:06:29,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2021-12-22 16:06:29,146 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2021-12-22 16:06:29,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2021-12-22 16:06:29,146 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2021-12-22 16:06:29,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2021-12-22 16:06:29,146 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2021-12-22 16:06:29,147 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2021-12-22 16:06:29,147 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2021-12-22 16:06:29,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2021-12-22 16:06:29,147 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait_event [2021-12-22 16:06:29,147 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait_event [2021-12-22 16:06:29,147 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2021-12-22 16:06:29,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2021-12-22 16:06:29,147 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_open_disc_mutex [2021-12-22 16:06:29,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_open_disc_mutex [2021-12-22 16:06:29,147 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_lock_of_lego_usb_tower [2021-12-22 16:06:29,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_lock_of_lego_usb_tower [2021-12-22 16:06:29,148 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-12-22 16:06:29,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-12-22 16:06:29,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-22 16:06:29,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 16:06:29,148 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2021-12-22 16:06:29,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2021-12-22 16:06:29,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-22 16:06:29,184 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2021-12-22 16:06:29,184 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2021-12-22 16:06:29,184 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2021-12-22 16:06:29,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2021-12-22 16:06:29,184 INFO L130 BoogieDeclarations]: Found specification of procedure usb_control_msg [2021-12-22 16:06:29,184 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_control_msg [2021-12-22 16:06:29,184 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2021-12-22 16:06:29,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2021-12-22 16:06:29,184 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2021-12-22 16:06:29,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2021-12-22 16:06:29,184 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2021-12-22 16:06:29,185 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2021-12-22 16:06:29,185 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_open_disc_mutex [2021-12-22 16:06:29,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_open_disc_mutex [2021-12-22 16:06:29,185 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_timeout [2021-12-22 16:06:29,185 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_timeout [2021-12-22 16:06:29,185 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2021-12-22 16:06:29,185 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2021-12-22 16:06:29,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 16:06:29,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 16:06:29,185 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2021-12-22 16:06:29,185 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2021-12-22 16:06:29,185 INFO L130 BoogieDeclarations]: Found specification of procedure tower_disconnect [2021-12-22 16:06:29,185 INFO L138 BoogieDeclarations]: Found implementation of procedure tower_disconnect [2021-12-22 16:06:29,185 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-12-22 16:06:29,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-12-22 16:06:29,185 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2021-12-22 16:06:29,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2021-12-22 16:06:29,185 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_maxp [2021-12-22 16:06:29,185 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_maxp [2021-12-22 16:06:29,189 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2021-12-22 16:06:29,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2021-12-22 16:06:29,189 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_free_urb [2021-12-22 16:06:29,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_free_urb [2021-12-22 16:06:29,189 INFO L130 BoogieDeclarations]: Found specification of procedure poll_wait [2021-12-22 16:06:29,189 INFO L138 BoogieDeclarations]: Found implementation of procedure poll_wait [2021-12-22 16:06:29,190 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2021-12-22 16:06:29,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2021-12-22 16:06:29,190 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_lock_of_lego_usb_tower [2021-12-22 16:06:29,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_lock_of_lego_usb_tower [2021-12-22 16:06:29,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-22 16:06:29,190 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2021-12-22 16:06:29,190 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2021-12-22 16:06:29,190 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2021-12-22 16:06:29,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2021-12-22 16:06:29,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-22 16:06:29,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-22 16:06:29,191 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2021-12-22 16:06:29,191 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2021-12-22 16:06:29,191 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2021-12-22 16:06:29,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2021-12-22 16:06:29,191 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2021-12-22 16:06:29,191 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2021-12-22 16:06:29,192 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2021-12-22 16:06:29,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2021-12-22 16:06:29,192 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_lock_of_lego_usb_tower [2021-12-22 16:06:29,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_lock_of_lego_usb_tower [2021-12-22 16:06:29,192 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2021-12-22 16:06:29,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2021-12-22 16:06:29,193 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_alloc_urb [2021-12-22 16:06:29,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_alloc_urb [2021-12-22 16:06:29,193 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-12-22 16:06:29,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-12-22 16:06:29,193 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2021-12-22 16:06:29,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2021-12-22 16:06:29,194 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2021-12-22 16:06:29,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2021-12-22 16:06:29,194 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2021-12-22 16:06:29,194 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2021-12-22 16:06:29,194 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-12-22 16:06:29,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-12-22 16:06:29,194 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_int_urb [2021-12-22 16:06:29,194 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_int_urb [2021-12-22 16:06:29,194 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_read_buffer_lock_of_lego_usb_tower [2021-12-22 16:06:29,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_read_buffer_lock_of_lego_usb_tower [2021-12-22 16:06:29,195 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-12-22 16:06:29,195 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-12-22 16:06:29,195 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2021-12-22 16:06:29,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2021-12-22 16:06:29,195 INFO L130 BoogieDeclarations]: Found specification of procedure tower_delete [2021-12-22 16:06:29,195 INFO L138 BoogieDeclarations]: Found implementation of procedure tower_delete [2021-12-22 16:06:29,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-22 16:06:29,195 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2021-12-22 16:06:29,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2021-12-22 16:06:29,196 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2021-12-22 16:06:29,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2021-12-22 16:06:29,196 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2021-12-22 16:06:29,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2021-12-22 16:06:29,196 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2021-12-22 16:06:29,196 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2021-12-22 16:06:29,196 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2021-12-22 16:06:29,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2021-12-22 16:06:29,197 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-12-22 16:06:29,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-12-22 16:06:29,197 INFO L130 BoogieDeclarations]: Found specification of procedure tower_check_for_read_packet [2021-12-22 16:06:29,197 INFO L138 BoogieDeclarations]: Found implementation of procedure tower_check_for_read_packet [2021-12-22 16:06:29,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-22 16:06:29,197 INFO L130 BoogieDeclarations]: Found specification of procedure tower_abort_transfers [2021-12-22 16:06:29,197 INFO L138 BoogieDeclarations]: Found implementation of procedure tower_abort_transfers [2021-12-22 16:06:29,197 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_irq_111 [2021-12-22 16:06:29,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_irq_111 [2021-12-22 16:06:29,780 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 16:06:29,786 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 16:06:29,976 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-12-22 16:06:31,957 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 16:06:31,967 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 16:06:31,968 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-22 16:06:31,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 04:06:31 BoogieIcfgContainer [2021-12-22 16:06:31,970 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 16:06:31,971 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 16:06:31,971 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 16:06:31,974 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 16:06:31,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 04:06:26" (1/3) ... [2021-12-22 16:06:31,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@232b3944 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 04:06:31, skipping insertion in model container [2021-12-22 16:06:31,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:06:28" (2/3) ... [2021-12-22 16:06:31,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@232b3944 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 04:06:31, skipping insertion in model container [2021-12-22 16:06:31,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 04:06:31" (3/3) ... [2021-12-22 16:06:31,976 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i [2021-12-22 16:06:31,980 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 16:06:31,980 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2021-12-22 16:06:32,015 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 16:06:32,020 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-22 16:06:32,020 INFO L340 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2021-12-22 16:06:32,044 INFO L276 IsEmpty]: Start isEmpty. Operand has 988 states, 642 states have (on average 1.2819314641744548) internal successors, (823), 687 states have internal predecessors, (823), 240 states have call successors, (240), 76 states have call predecessors, (240), 75 states have return successors, (235), 232 states have call predecessors, (235), 235 states have call successors, (235) [2021-12-22 16:06:32,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-22 16:06:32,050 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:06:32,050 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:06:32,051 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-12-22 16:06:32,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:06:32,055 INFO L85 PathProgramCache]: Analyzing trace with hash 248613159, now seen corresponding path program 1 times [2021-12-22 16:06:32,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:06:32,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532986947] [2021-12-22 16:06:32,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:06:32,061 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:06:32,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:32,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 16:06:32,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:32,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 16:06:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:32,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 16:06:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:32,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 16:06:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:32,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 16:06:32,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:32,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 16:06:32,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:32,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-22 16:06:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:32,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:06:32,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:32,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-22 16:06:32,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:32,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-22 16:06:32,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:32,664 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-22 16:06:32,664 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:06:32,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532986947] [2021-12-22 16:06:32,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532986947] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:06:32,665 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:06:32,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 16:06:32,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360704098] [2021-12-22 16:06:32,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:06:32,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:06:32,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:06:32,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:06:32,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:06:32,690 INFO L87 Difference]: Start difference. First operand has 988 states, 642 states have (on average 1.2819314641744548) internal successors, (823), 687 states have internal predecessors, (823), 240 states have call successors, (240), 76 states have call predecessors, (240), 75 states have return successors, (235), 232 states have call predecessors, (235), 235 states have call successors, (235) Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 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) [2021-12-22 16:06:34,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:06:34,813 INFO L93 Difference]: Finished difference Result 1927 states and 2626 transitions. [2021-12-22 16:06:34,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:06:34,815 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 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 71 [2021-12-22 16:06:34,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:06:34,835 INFO L225 Difference]: With dead ends: 1927 [2021-12-22 16:06:34,835 INFO L226 Difference]: Without dead ends: 970 [2021-12-22 16:06:34,844 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:06:34,846 INFO L933 BasicCegarLoop]: 1213 mSDtfsCounter, 1656 mSDsluCounter, 1740 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 670 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1834 SdHoareTripleChecker+Valid, 2953 SdHoareTripleChecker+Invalid, 1493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 670 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-12-22 16:06:34,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1834 Valid, 2953 Invalid, 1493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [670 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-12-22 16:06:34,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2021-12-22 16:06:34,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 970. [2021-12-22 16:06:34,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 632 states have (on average 1.2294303797468353) internal successors, (777), 672 states have internal predecessors, (777), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2021-12-22 16:06:34,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1245 transitions. [2021-12-22 16:06:34,929 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1245 transitions. Word has length 71 [2021-12-22 16:06:34,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:06:34,931 INFO L470 AbstractCegarLoop]: Abstraction has 970 states and 1245 transitions. [2021-12-22 16:06:34,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 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) [2021-12-22 16:06:34,932 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1245 transitions. [2021-12-22 16:06:34,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-12-22 16:06:34,934 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:06:34,934 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:06:34,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-22 16:06:34,935 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-12-22 16:06:34,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:06:34,936 INFO L85 PathProgramCache]: Analyzing trace with hash 544752548, now seen corresponding path program 1 times [2021-12-22 16:06:34,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:06:34,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159837396] [2021-12-22 16:06:34,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:06:34,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:06:34,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:35,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 16:06:35,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:35,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 16:06:35,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:35,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 16:06:35,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:35,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 16:06:35,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:35,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 16:06:35,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:35,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 16:06:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:35,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-22 16:06:35,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:35,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:06:35,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:35,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-22 16:06:35,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:35,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-22 16:06:35,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:35,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-22 16:06:35,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:35,128 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-22 16:06:35,128 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:06:35,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159837396] [2021-12-22 16:06:35,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159837396] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:06:35,129 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:06:35,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 16:06:35,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622089129] [2021-12-22 16:06:35,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:06:35,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:06:35,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:06:35,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:06:35,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:06:35,132 INFO L87 Difference]: Start difference. First operand 970 states and 1245 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 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) [2021-12-22 16:06:36,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:06:36,936 INFO L93 Difference]: Finished difference Result 970 states and 1245 transitions. [2021-12-22 16:06:36,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:06:36,937 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 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 77 [2021-12-22 16:06:36,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:06:36,942 INFO L225 Difference]: With dead ends: 970 [2021-12-22 16:06:36,942 INFO L226 Difference]: Without dead ends: 968 [2021-12-22 16:06:36,943 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:06:36,944 INFO L933 BasicCegarLoop]: 1193 mSDtfsCounter, 1622 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1797 SdHoareTripleChecker+Valid, 2911 SdHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-12-22 16:06:36,944 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1797 Valid, 2911 Invalid, 1471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-12-22 16:06:36,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2021-12-22 16:06:36,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 968. [2021-12-22 16:06:36,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 631 states have (on average 1.2282091917591125) internal successors, (775), 670 states have internal predecessors, (775), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2021-12-22 16:06:36,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1243 transitions. [2021-12-22 16:06:36,979 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1243 transitions. Word has length 77 [2021-12-22 16:06:36,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:06:36,979 INFO L470 AbstractCegarLoop]: Abstraction has 968 states and 1243 transitions. [2021-12-22 16:06:36,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 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) [2021-12-22 16:06:36,979 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1243 transitions. [2021-12-22 16:06:36,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-22 16:06:36,981 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:06:36,982 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:06:36,982 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-22 16:06:36,982 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-12-22 16:06:36,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:06:36,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1429765362, now seen corresponding path program 1 times [2021-12-22 16:06:36,983 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:06:36,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962556014] [2021-12-22 16:06:36,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:06:36,983 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:06:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:37,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 16:06:37,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:37,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 16:06:37,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:37,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 16:06:37,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:37,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 16:06:37,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:37,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 16:06:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:37,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 16:06:37,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:37,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-22 16:06:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:37,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:06:37,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:37,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-22 16:06:37,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:37,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-22 16:06:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:37,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-22 16:06:37,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:37,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-22 16:06:37,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:37,181 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-22 16:06:37,181 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:06:37,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962556014] [2021-12-22 16:06:37,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962556014] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:06:37,185 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:06:37,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 16:06:37,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110888048] [2021-12-22 16:06:37,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:06:37,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:06:37,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:06:37,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:06:37,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:06:37,187 INFO L87 Difference]: Start difference. First operand 968 states and 1243 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 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) [2021-12-22 16:06:38,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:06:38,803 INFO L93 Difference]: Finished difference Result 968 states and 1243 transitions. [2021-12-22 16:06:38,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:06:38,804 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 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 83 [2021-12-22 16:06:38,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:06:38,819 INFO L225 Difference]: With dead ends: 968 [2021-12-22 16:06:38,820 INFO L226 Difference]: Without dead ends: 966 [2021-12-22 16:06:38,821 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:06:38,823 INFO L933 BasicCegarLoop]: 1191 mSDtfsCounter, 1616 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1790 SdHoareTripleChecker+Valid, 2909 SdHoareTripleChecker+Invalid, 1469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-12-22 16:06:38,824 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1790 Valid, 2909 Invalid, 1469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-12-22 16:06:38,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2021-12-22 16:06:38,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 966. [2021-12-22 16:06:38,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 630 states have (on average 1.226984126984127) internal successors, (773), 668 states have internal predecessors, (773), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2021-12-22 16:06:38,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1241 transitions. [2021-12-22 16:06:38,910 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1241 transitions. Word has length 83 [2021-12-22 16:06:38,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:06:38,911 INFO L470 AbstractCegarLoop]: Abstraction has 966 states and 1241 transitions. [2021-12-22 16:06:38,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 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) [2021-12-22 16:06:38,911 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1241 transitions. [2021-12-22 16:06:38,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-12-22 16:06:38,912 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:06:38,913 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:06:38,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-22 16:06:38,913 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-12-22 16:06:38,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:06:38,913 INFO L85 PathProgramCache]: Analyzing trace with hash -454572405, now seen corresponding path program 1 times [2021-12-22 16:06:38,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:06:38,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647390857] [2021-12-22 16:06:38,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:06:38,914 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:06:38,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:38,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 16:06:38,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:39,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 16:06:39,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:39,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 16:06:39,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:39,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 16:06:39,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:39,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 16:06:39,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:39,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 16:06:39,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:39,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-22 16:06:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:39,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:06:39,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:39,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-22 16:06:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:39,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-22 16:06:39,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:39,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-22 16:06:39,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:39,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-22 16:06:39,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:39,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-22 16:06:39,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:39,075 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-22 16:06:39,076 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:06:39,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647390857] [2021-12-22 16:06:39,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647390857] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:06:39,076 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:06:39,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 16:06:39,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265989020] [2021-12-22 16:06:39,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:06:39,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:06:39,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:06:39,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:06:39,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:06:39,078 INFO L87 Difference]: Start difference. First operand 966 states and 1241 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 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) [2021-12-22 16:06:40,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:06:40,677 INFO L93 Difference]: Finished difference Result 966 states and 1241 transitions. [2021-12-22 16:06:40,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:06:40,678 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 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 89 [2021-12-22 16:06:40,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:06:40,682 INFO L225 Difference]: With dead ends: 966 [2021-12-22 16:06:40,682 INFO L226 Difference]: Without dead ends: 964 [2021-12-22 16:06:40,683 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:06:40,683 INFO L933 BasicCegarLoop]: 1189 mSDtfsCounter, 1610 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1783 SdHoareTripleChecker+Valid, 2907 SdHoareTripleChecker+Invalid, 1467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-12-22 16:06:40,683 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1783 Valid, 2907 Invalid, 1467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-12-22 16:06:40,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2021-12-22 16:06:40,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 964. [2021-12-22 16:06:40,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 629 states have (on average 1.2257551669316376) internal successors, (771), 666 states have internal predecessors, (771), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2021-12-22 16:06:40,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1239 transitions. [2021-12-22 16:06:40,735 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1239 transitions. Word has length 89 [2021-12-22 16:06:40,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:06:40,751 INFO L470 AbstractCegarLoop]: Abstraction has 964 states and 1239 transitions. [2021-12-22 16:06:40,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 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) [2021-12-22 16:06:40,751 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1239 transitions. [2021-12-22 16:06:40,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-12-22 16:06:40,757 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:06:40,757 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:06:40,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-22 16:06:40,757 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-12-22 16:06:40,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:06:40,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1517419958, now seen corresponding path program 1 times [2021-12-22 16:06:40,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:06:40,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205536639] [2021-12-22 16:06:40,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:06:40,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:06:40,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:40,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 16:06:40,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:40,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 16:06:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:40,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 16:06:40,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:40,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 16:06:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:40,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 16:06:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:40,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 16:06:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:40,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-22 16:06:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:40,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:06:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:40,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-22 16:06:40,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:40,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-22 16:06:40,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:40,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-22 16:06:40,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:40,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-22 16:06:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:40,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-22 16:06:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:40,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-22 16:06:40,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:40,934 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-22 16:06:40,934 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:06:40,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205536639] [2021-12-22 16:06:40,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205536639] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:06:40,935 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:06:40,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 16:06:40,935 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970386123] [2021-12-22 16:06:40,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:06:40,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:06:40,936 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:06:40,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:06:40,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:06:40,936 INFO L87 Difference]: Start difference. First operand 964 states and 1239 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 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) [2021-12-22 16:06:42,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:06:42,562 INFO L93 Difference]: Finished difference Result 964 states and 1239 transitions. [2021-12-22 16:06:42,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:06:42,563 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 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 95 [2021-12-22 16:06:42,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:06:42,567 INFO L225 Difference]: With dead ends: 964 [2021-12-22 16:06:42,567 INFO L226 Difference]: Without dead ends: 962 [2021-12-22 16:06:42,568 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:06:42,568 INFO L933 BasicCegarLoop]: 1187 mSDtfsCounter, 1604 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1776 SdHoareTripleChecker+Valid, 2905 SdHoareTripleChecker+Invalid, 1465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-12-22 16:06:42,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1776 Valid, 2905 Invalid, 1465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-12-22 16:06:42,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2021-12-22 16:06:42,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2021-12-22 16:06:42,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 628 states have (on average 1.2245222929936306) internal successors, (769), 664 states have internal predecessors, (769), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2021-12-22 16:06:42,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1237 transitions. [2021-12-22 16:06:42,596 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1237 transitions. Word has length 95 [2021-12-22 16:06:42,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:06:42,597 INFO L470 AbstractCegarLoop]: Abstraction has 962 states and 1237 transitions. [2021-12-22 16:06:42,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 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) [2021-12-22 16:06:42,597 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1237 transitions. [2021-12-22 16:06:42,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-12-22 16:06:42,598 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:06:42,599 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:06:42,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-22 16:06:42,599 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-12-22 16:06:42,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:06:42,599 INFO L85 PathProgramCache]: Analyzing trace with hash 179646454, now seen corresponding path program 1 times [2021-12-22 16:06:42,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:06:42,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652557769] [2021-12-22 16:06:42,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:06:42,600 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:06:42,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:42,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 16:06:42,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:42,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 16:06:42,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:42,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 16:06:42,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:42,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 16:06:42,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:42,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 16:06:42,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:42,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 16:06:42,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:42,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-22 16:06:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:42,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:06:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:42,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-22 16:06:42,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:42,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-22 16:06:42,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:42,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-22 16:06:42,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:42,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-22 16:06:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:42,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-22 16:06:42,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:42,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-22 16:06:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:42,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-22 16:06:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:42,823 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-22 16:06:42,823 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:06:42,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652557769] [2021-12-22 16:06:42,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652557769] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:06:42,823 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:06:42,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 16:06:42,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979849154] [2021-12-22 16:06:42,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:06:42,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:06:42,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:06:42,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:06:42,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:06:42,825 INFO L87 Difference]: Start difference. First operand 962 states and 1237 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 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) [2021-12-22 16:06:44,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:06:44,552 INFO L93 Difference]: Finished difference Result 962 states and 1237 transitions. [2021-12-22 16:06:44,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:06:44,553 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 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 101 [2021-12-22 16:06:44,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:06:44,557 INFO L225 Difference]: With dead ends: 962 [2021-12-22 16:06:44,558 INFO L226 Difference]: Without dead ends: 960 [2021-12-22 16:06:44,558 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:06:44,559 INFO L933 BasicCegarLoop]: 1185 mSDtfsCounter, 1598 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1769 SdHoareTripleChecker+Valid, 2903 SdHoareTripleChecker+Invalid, 1463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-12-22 16:06:44,559 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1769 Valid, 2903 Invalid, 1463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-12-22 16:06:44,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2021-12-22 16:06:44,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 960. [2021-12-22 16:06:44,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 627 states have (on average 1.223285486443381) internal successors, (767), 662 states have internal predecessors, (767), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2021-12-22 16:06:44,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1235 transitions. [2021-12-22 16:06:44,614 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1235 transitions. Word has length 101 [2021-12-22 16:06:44,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:06:44,615 INFO L470 AbstractCegarLoop]: Abstraction has 960 states and 1235 transitions. [2021-12-22 16:06:44,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 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) [2021-12-22 16:06:44,615 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1235 transitions. [2021-12-22 16:06:44,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-12-22 16:06:44,616 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:06:44,617 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:06:44,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-22 16:06:44,618 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-12-22 16:06:44,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:06:44,618 INFO L85 PathProgramCache]: Analyzing trace with hash -862139684, now seen corresponding path program 1 times [2021-12-22 16:06:44,618 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:06:44,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037726050] [2021-12-22 16:06:44,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:06:44,619 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:06:44,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:44,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 16:06:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:44,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 16:06:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:44,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 16:06:44,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:44,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 16:06:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:44,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 16:06:44,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:44,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 16:06:44,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:44,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-22 16:06:44,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:44,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:06:44,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:44,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-22 16:06:44,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:44,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-22 16:06:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:44,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-22 16:06:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:44,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-22 16:06:44,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:44,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-22 16:06:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:44,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-22 16:06:44,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:44,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-22 16:06:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:44,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-22 16:06:44,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:44,893 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-22 16:06:44,893 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:06:44,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037726050] [2021-12-22 16:06:44,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037726050] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:06:44,894 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:06:44,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 16:06:44,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114279958] [2021-12-22 16:06:44,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:06:44,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:06:44,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:06:44,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:06:44,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:06:44,895 INFO L87 Difference]: Start difference. First operand 960 states and 1235 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 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) [2021-12-22 16:06:46,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:06:46,440 INFO L93 Difference]: Finished difference Result 960 states and 1235 transitions. [2021-12-22 16:06:46,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:06:46,441 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 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 107 [2021-12-22 16:06:46,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:06:46,446 INFO L225 Difference]: With dead ends: 960 [2021-12-22 16:06:46,446 INFO L226 Difference]: Without dead ends: 958 [2021-12-22 16:06:46,447 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:06:46,448 INFO L933 BasicCegarLoop]: 1183 mSDtfsCounter, 1592 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1762 SdHoareTripleChecker+Valid, 2901 SdHoareTripleChecker+Invalid, 1461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-12-22 16:06:46,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1762 Valid, 2901 Invalid, 1461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-12-22 16:06:46,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2021-12-22 16:06:46,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 958. [2021-12-22 16:06:46,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 626 states have (on average 1.2220447284345048) internal successors, (765), 660 states have internal predecessors, (765), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2021-12-22 16:06:46,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1233 transitions. [2021-12-22 16:06:46,493 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1233 transitions. Word has length 107 [2021-12-22 16:06:46,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:06:46,494 INFO L470 AbstractCegarLoop]: Abstraction has 958 states and 1233 transitions. [2021-12-22 16:06:46,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 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) [2021-12-22 16:06:46,495 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1233 transitions. [2021-12-22 16:06:46,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-12-22 16:06:46,496 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:06:46,496 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:06:46,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-22 16:06:46,497 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-12-22 16:06:46,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:06:46,497 INFO L85 PathProgramCache]: Analyzing trace with hash 215029627, now seen corresponding path program 1 times [2021-12-22 16:06:46,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:06:46,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959676733] [2021-12-22 16:06:46,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:06:46,498 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:06:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:46,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 16:06:46,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:46,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 16:06:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:46,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 16:06:46,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:46,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 16:06:46,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:46,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 16:06:46,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:46,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 16:06:46,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:46,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-22 16:06:46,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:46,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:06:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:46,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-22 16:06:46,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:46,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-22 16:06:46,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:46,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-22 16:06:46,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:46,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-22 16:06:46,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:46,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-22 16:06:46,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:46,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-22 16:06:46,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:46,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-22 16:06:46,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:46,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-22 16:06:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:46,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-22 16:06:46,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:46,720 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-22 16:06:46,720 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:06:46,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959676733] [2021-12-22 16:06:46,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959676733] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:06:46,720 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:06:46,720 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 16:06:46,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111204652] [2021-12-22 16:06:46,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:06:46,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:06:46,721 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:06:46,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:06:46,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:06:46,722 INFO L87 Difference]: Start difference. First operand 958 states and 1233 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 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) [2021-12-22 16:06:48,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:06:48,266 INFO L93 Difference]: Finished difference Result 958 states and 1233 transitions. [2021-12-22 16:06:48,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:06:48,267 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 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 113 [2021-12-22 16:06:48,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:06:48,271 INFO L225 Difference]: With dead ends: 958 [2021-12-22 16:06:48,271 INFO L226 Difference]: Without dead ends: 956 [2021-12-22 16:06:48,271 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:06:48,272 INFO L933 BasicCegarLoop]: 1181 mSDtfsCounter, 1590 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1759 SdHoareTripleChecker+Valid, 2899 SdHoareTripleChecker+Invalid, 1455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-12-22 16:06:48,272 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1759 Valid, 2899 Invalid, 1455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-12-22 16:06:48,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2021-12-22 16:06:48,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 956. [2021-12-22 16:06:48,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 625 states have (on average 1.2208) internal successors, (763), 658 states have internal predecessors, (763), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2021-12-22 16:06:48,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1231 transitions. [2021-12-22 16:06:48,301 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1231 transitions. Word has length 113 [2021-12-22 16:06:48,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:06:48,302 INFO L470 AbstractCegarLoop]: Abstraction has 956 states and 1231 transitions. [2021-12-22 16:06:48,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 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) [2021-12-22 16:06:48,302 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1231 transitions. [2021-12-22 16:06:48,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-12-22 16:06:48,303 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:06:48,303 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:06:48,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-22 16:06:48,304 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-12-22 16:06:48,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:06:48,304 INFO L85 PathProgramCache]: Analyzing trace with hash 485176158, now seen corresponding path program 1 times [2021-12-22 16:06:48,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:06:48,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140932897] [2021-12-22 16:06:48,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:06:48,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:06:48,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:48,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 16:06:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:48,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 16:06:48,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:48,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 16:06:48,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:48,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 16:06:48,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:48,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 16:06:48,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:48,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 16:06:48,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:48,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-22 16:06:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:48,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:06:48,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:48,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-22 16:06:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:48,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-22 16:06:48,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:48,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-22 16:06:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:48,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-22 16:06:48,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:48,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-22 16:06:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:48,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-22 16:06:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:48,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-22 16:06:48,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:48,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-22 16:06:48,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:48,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-22 16:06:48,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:48,479 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-22 16:06:48,479 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:06:48,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140932897] [2021-12-22 16:06:48,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140932897] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:06:48,480 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:06:48,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 16:06:48,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481885790] [2021-12-22 16:06:48,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:06:48,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:06:48,481 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:06:48,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:06:48,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:06:48,482 INFO L87 Difference]: Start difference. First operand 956 states and 1231 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 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) [2021-12-22 16:06:50,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:06:50,005 INFO L93 Difference]: Finished difference Result 956 states and 1231 transitions. [2021-12-22 16:06:50,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:06:50,005 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 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 115 [2021-12-22 16:06:50,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:06:50,009 INFO L225 Difference]: With dead ends: 956 [2021-12-22 16:06:50,009 INFO L226 Difference]: Without dead ends: 954 [2021-12-22 16:06:50,010 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:06:50,010 INFO L933 BasicCegarLoop]: 1179 mSDtfsCounter, 1578 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1747 SdHoareTripleChecker+Valid, 2897 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-12-22 16:06:50,010 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1747 Valid, 2897 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-12-22 16:06:50,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2021-12-22 16:06:50,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 954. [2021-12-22 16:06:50,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 624 states have (on average 1.2195512820512822) internal successors, (761), 656 states have internal predecessors, (761), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2021-12-22 16:06:50,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1229 transitions. [2021-12-22 16:06:50,044 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1229 transitions. Word has length 115 [2021-12-22 16:06:50,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:06:50,044 INFO L470 AbstractCegarLoop]: Abstraction has 954 states and 1229 transitions. [2021-12-22 16:06:50,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 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) [2021-12-22 16:06:50,044 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1229 transitions. [2021-12-22 16:06:50,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-12-22 16:06:50,045 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:06:50,046 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:06:50,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-22 16:06:50,046 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-12-22 16:06:50,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:06:50,046 INFO L85 PathProgramCache]: Analyzing trace with hash 907436211, now seen corresponding path program 1 times [2021-12-22 16:06:50,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:06:50,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55312569] [2021-12-22 16:06:50,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:06:50,047 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:06:50,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:50,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 16:06:50,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:50,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 16:06:50,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:50,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 16:06:50,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:50,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 16:06:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:50,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 16:06:50,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:50,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 16:06:50,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:50,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-22 16:06:50,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:50,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:06:50,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:50,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-22 16:06:50,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:50,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-22 16:06:50,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:50,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-22 16:06:50,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:50,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-22 16:06:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:50,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-22 16:06:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:50,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-22 16:06:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:50,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-22 16:06:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:50,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-22 16:06:50,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:50,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-22 16:06:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:50,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-22 16:06:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:50,241 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-22 16:06:50,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:06:50,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55312569] [2021-12-22 16:06:50,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55312569] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:06:50,241 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:06:50,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 16:06:50,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385435355] [2021-12-22 16:06:50,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:06:50,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:06:50,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:06:50,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:06:50,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:06:50,243 INFO L87 Difference]: Start difference. First operand 954 states and 1229 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 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) [2021-12-22 16:06:51,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:06:51,785 INFO L93 Difference]: Finished difference Result 954 states and 1229 transitions. [2021-12-22 16:06:51,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:06:51,785 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 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 121 [2021-12-22 16:06:51,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:06:51,789 INFO L225 Difference]: With dead ends: 954 [2021-12-22 16:06:51,789 INFO L226 Difference]: Without dead ends: 952 [2021-12-22 16:06:51,789 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:06:51,790 INFO L933 BasicCegarLoop]: 1177 mSDtfsCounter, 1574 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1742 SdHoareTripleChecker+Valid, 2895 SdHoareTripleChecker+Invalid, 1455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-12-22 16:06:51,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1742 Valid, 2895 Invalid, 1455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-12-22 16:06:51,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2021-12-22 16:06:51,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 952. [2021-12-22 16:06:51,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 623 states have (on average 1.218298555377207) internal successors, (759), 654 states have internal predecessors, (759), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2021-12-22 16:06:51,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1227 transitions. [2021-12-22 16:06:51,819 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1227 transitions. Word has length 121 [2021-12-22 16:06:51,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:06:51,820 INFO L470 AbstractCegarLoop]: Abstraction has 952 states and 1227 transitions. [2021-12-22 16:06:51,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 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) [2021-12-22 16:06:51,820 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1227 transitions. [2021-12-22 16:06:51,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-12-22 16:06:51,821 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:06:51,822 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:06:51,822 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-22 16:06:51,822 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-12-22 16:06:51,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:06:51,822 INFO L85 PathProgramCache]: Analyzing trace with hash -289800848, now seen corresponding path program 1 times [2021-12-22 16:06:51,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:06:51,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414384366] [2021-12-22 16:06:51,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:06:51,823 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:06:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:51,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 16:06:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:51,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 16:06:51,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:51,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 16:06:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:51,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 16:06:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:51,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-22 16:06:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:51,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:06:51,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:51,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 16:06:51,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:51,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 16:06:51,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:51,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-22 16:06:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:52,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:06:52,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:52,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 16:06:52,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:52,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 16:06:52,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:52,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-22 16:06:52,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:52,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:06:52,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:52,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 16:06:52,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:52,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 16:06:52,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:52,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-22 16:06:52,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:52,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:06:52,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:52,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 16:06:52,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:52,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 16:06:52,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:52,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-22 16:06:52,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:52,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:06:52,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:52,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 16:06:52,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:52,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 16:06:52,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:52,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-22 16:06:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:52,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-22 16:06:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:52,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-12-22 16:06:52,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:52,112 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2021-12-22 16:06:52,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:06:52,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414384366] [2021-12-22 16:06:52,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414384366] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:06:52,112 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:06:52,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 16:06:52,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823973582] [2021-12-22 16:06:52,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:06:52,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 16:06:52,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:06:52,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 16:06:52,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-22 16:06:52,114 INFO L87 Difference]: Start difference. First operand 952 states and 1227 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-22 16:06:54,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:06:54,776 INFO L93 Difference]: Finished difference Result 1878 states and 2427 transitions. [2021-12-22 16:06:54,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 16:06:54,777 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 164 [2021-12-22 16:06:54,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:06:54,781 INFO L225 Difference]: With dead ends: 1878 [2021-12-22 16:06:54,782 INFO L226 Difference]: Without dead ends: 965 [2021-12-22 16:06:54,785 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2021-12-22 16:06:54,785 INFO L933 BasicCegarLoop]: 1171 mSDtfsCounter, 1892 mSDsluCounter, 3453 mSDsCounter, 0 mSdLazyCounter, 2169 mSolverCounterSat, 954 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2074 SdHoareTripleChecker+Valid, 4624 SdHoareTripleChecker+Invalid, 3123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 954 IncrementalHoareTripleChecker+Valid, 2169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2021-12-22 16:06:54,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2074 Valid, 4624 Invalid, 3123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [954 Valid, 2169 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2021-12-22 16:06:54,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2021-12-22 16:06:54,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 952. [2021-12-22 16:06:54,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 623 states have (on average 1.21669341894061) internal successors, (758), 654 states have internal predecessors, (758), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2021-12-22 16:06:54,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1226 transitions. [2021-12-22 16:06:54,887 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1226 transitions. Word has length 164 [2021-12-22 16:06:54,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:06:54,888 INFO L470 AbstractCegarLoop]: Abstraction has 952 states and 1226 transitions. [2021-12-22 16:06:54,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-22 16:06:54,888 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1226 transitions. [2021-12-22 16:06:54,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-12-22 16:06:54,890 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:06:54,890 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:06:54,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-22 16:06:54,890 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-12-22 16:06:54,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:06:54,891 INFO L85 PathProgramCache]: Analyzing trace with hash -289741266, now seen corresponding path program 1 times [2021-12-22 16:06:54,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:06:54,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723360934] [2021-12-22 16:06:54,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:06:54,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:06:54,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:55,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 16:06:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:55,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 16:06:55,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:55,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 16:06:55,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:55,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 16:06:55,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:55,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-22 16:06:55,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:55,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:06:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:55,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 16:06:55,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:55,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 16:06:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:55,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-22 16:06:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:55,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:06:55,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:55,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 16:06:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:55,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 16:06:55,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:55,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-22 16:06:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:55,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:06:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:55,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 16:06:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:55,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 16:06:55,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:55,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-22 16:06:55,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:55,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:06:55,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:55,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 16:06:55,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:55,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 16:06:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:55,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-22 16:06:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:55,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:06:55,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:55,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 16:06:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:55,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 16:06:55,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:55,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-22 16:06:55,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:55,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-22 16:06:55,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:55,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-12-22 16:06:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:55,186 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2021-12-22 16:06:55,186 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:06:55,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723360934] [2021-12-22 16:06:55,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723360934] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:06:55,187 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:06:55,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 16:06:55,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743811513] [2021-12-22 16:06:55,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:06:55,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 16:06:55,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:06:55,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 16:06:55,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-22 16:06:55,188 INFO L87 Difference]: Start difference. First operand 952 states and 1226 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2021-12-22 16:06:57,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:06:57,523 INFO L93 Difference]: Finished difference Result 965 states and 1247 transitions. [2021-12-22 16:06:57,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-22 16:06:57,524 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 164 [2021-12-22 16:06:57,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:06:57,528 INFO L225 Difference]: With dead ends: 965 [2021-12-22 16:06:57,528 INFO L226 Difference]: Without dead ends: 963 [2021-12-22 16:06:57,528 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-12-22 16:06:57,529 INFO L933 BasicCegarLoop]: 1171 mSDtfsCounter, 967 mSDsluCounter, 3024 mSDsCounter, 0 mSdLazyCounter, 1373 mSolverCounterSat, 848 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 967 SdHoareTripleChecker+Valid, 4195 SdHoareTripleChecker+Invalid, 2221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 848 IncrementalHoareTripleChecker+Valid, 1373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:06:57,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [967 Valid, 4195 Invalid, 2221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [848 Valid, 1373 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2021-12-22 16:06:57,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2021-12-22 16:06:57,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 950. [2021-12-22 16:06:57,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 622 states have (on average 1.2154340836012862) internal successors, (756), 652 states have internal predecessors, (756), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2021-12-22 16:06:57,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1224 transitions. [2021-12-22 16:06:57,593 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1224 transitions. Word has length 164 [2021-12-22 16:06:57,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:06:57,594 INFO L470 AbstractCegarLoop]: Abstraction has 950 states and 1224 transitions. [2021-12-22 16:06:57,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2021-12-22 16:06:57,594 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1224 transitions. [2021-12-22 16:06:57,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-12-22 16:06:57,595 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:06:57,595 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:06:57,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-22 16:06:57,595 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-12-22 16:06:57,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:06:57,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1029929949, now seen corresponding path program 1 times [2021-12-22 16:06:57,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:06:57,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933410777] [2021-12-22 16:06:57,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:06:57,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:06:57,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:57,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 16:06:57,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:57,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 16:06:57,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:57,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 16:06:57,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:57,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 16:06:57,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:57,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 16:06:57,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:57,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 16:06:57,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:57,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-22 16:06:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:57,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:06:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:57,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-22 16:06:57,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:57,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-22 16:06:57,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:57,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-22 16:06:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:57,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-22 16:06:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:57,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-22 16:06:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:57,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-22 16:06:57,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:57,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-22 16:06:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:57,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-22 16:06:57,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:57,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-22 16:06:57,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:57,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-22 16:06:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:57,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-22 16:06:57,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:57,801 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-22 16:06:57,802 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:06:57,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933410777] [2021-12-22 16:06:57,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933410777] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:06:57,802 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:06:57,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 16:06:57,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608577103] [2021-12-22 16:06:57,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:06:57,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:06:57,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:06:57,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:06:57,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:06:57,804 INFO L87 Difference]: Start difference. First operand 950 states and 1224 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 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) [2021-12-22 16:06:59,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:06:59,171 INFO L93 Difference]: Finished difference Result 950 states and 1224 transitions. [2021-12-22 16:06:59,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:06:59,171 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 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 127 [2021-12-22 16:06:59,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:06:59,175 INFO L225 Difference]: With dead ends: 950 [2021-12-22 16:06:59,175 INFO L226 Difference]: Without dead ends: 948 [2021-12-22 16:06:59,175 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:06:59,176 INFO L933 BasicCegarLoop]: 1172 mSDtfsCounter, 1559 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1726 SdHoareTripleChecker+Valid, 2890 SdHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-22 16:06:59,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1726 Valid, 2890 Invalid, 1450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-12-22 16:06:59,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2021-12-22 16:06:59,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 948. [2021-12-22 16:06:59,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 621 states have (on average 1.214170692431562) internal successors, (754), 650 states have internal predecessors, (754), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2021-12-22 16:06:59,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1222 transitions. [2021-12-22 16:06:59,251 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1222 transitions. Word has length 127 [2021-12-22 16:06:59,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:06:59,253 INFO L470 AbstractCegarLoop]: Abstraction has 948 states and 1222 transitions. [2021-12-22 16:06:59,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 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) [2021-12-22 16:06:59,254 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1222 transitions. [2021-12-22 16:06:59,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-12-22 16:06:59,255 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:06:59,255 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:06:59,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-22 16:06:59,256 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-12-22 16:06:59,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:06:59,256 INFO L85 PathProgramCache]: Analyzing trace with hash 2095809396, now seen corresponding path program 1 times [2021-12-22 16:06:59,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:06:59,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903747131] [2021-12-22 16:06:59,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:06:59,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:06:59,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:59,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 16:06:59,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:59,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 16:06:59,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:59,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 16:06:59,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:59,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 16:06:59,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:59,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-22 16:06:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:59,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:06:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:59,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 16:06:59,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:59,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 16:06:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:59,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-22 16:06:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:59,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:06:59,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:59,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 16:06:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:59,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 16:06:59,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:59,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-22 16:06:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:59,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:06:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:59,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 16:06:59,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:59,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 16:06:59,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:59,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-22 16:06:59,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:59,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:06:59,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:59,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 16:06:59,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:59,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 16:06:59,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:59,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-22 16:06:59,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:59,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:06:59,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:59,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 16:06:59,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:59,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 16:06:59,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:59,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-22 16:06:59,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:59,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-22 16:06:59,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:59,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-12-22 16:06:59,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:59,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:06:59,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:06:59,528 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2021-12-22 16:06:59,528 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:06:59,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903747131] [2021-12-22 16:06:59,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903747131] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:06:59,528 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:06:59,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 16:06:59,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924575207] [2021-12-22 16:06:59,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:06:59,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:06:59,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:06:59,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:06:59,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:06:59,530 INFO L87 Difference]: Start difference. First operand 948 states and 1222 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-22 16:07:01,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:07:01,045 INFO L93 Difference]: Finished difference Result 1866 states and 2413 transitions. [2021-12-22 16:07:01,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:07:01,046 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 171 [2021-12-22 16:07:01,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:07:01,051 INFO L225 Difference]: With dead ends: 1866 [2021-12-22 16:07:01,062 INFO L226 Difference]: Without dead ends: 957 [2021-12-22 16:07:01,066 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-22 16:07:01,066 INFO L933 BasicCegarLoop]: 1166 mSDtfsCounter, 1853 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 949 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2033 SdHoareTripleChecker+Valid, 2483 SdHoareTripleChecker+Invalid, 1588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 949 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-12-22 16:07:01,067 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2033 Valid, 2483 Invalid, 1588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [949 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-12-22 16:07:01,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2021-12-22 16:07:01,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 944. [2021-12-22 16:07:01,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 618 states have (on average 1.2119741100323624) internal successors, (749), 646 states have internal predecessors, (749), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2021-12-22 16:07:01,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1217 transitions. [2021-12-22 16:07:01,117 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1217 transitions. Word has length 171 [2021-12-22 16:07:01,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:07:01,118 INFO L470 AbstractCegarLoop]: Abstraction has 944 states and 1217 transitions. [2021-12-22 16:07:01,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-22 16:07:01,119 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1217 transitions. [2021-12-22 16:07:01,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-12-22 16:07:01,120 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:07:01,121 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:07:01,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-22 16:07:01,121 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-12-22 16:07:01,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:07:01,122 INFO L85 PathProgramCache]: Analyzing trace with hash 664932848, now seen corresponding path program 1 times [2021-12-22 16:07:01,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:07:01,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754875567] [2021-12-22 16:07:01,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:07:01,122 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:07:01,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:01,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 16:07:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:01,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 16:07:01,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:01,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 16:07:01,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:01,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 16:07:01,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:01,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 16:07:01,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:01,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 16:07:01,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:01,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-22 16:07:01,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:01,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:07:01,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:01,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-22 16:07:01,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:01,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-22 16:07:01,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:01,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-22 16:07:01,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:01,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-22 16:07:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:01,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-22 16:07:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:01,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-22 16:07:01,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:01,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-22 16:07:01,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:01,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-22 16:07:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:01,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-22 16:07:01,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:01,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-22 16:07:01,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:01,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-22 16:07:01,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:01,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-22 16:07:01,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:01,313 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-22 16:07:01,313 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:07:01,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754875567] [2021-12-22 16:07:01,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754875567] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:07:01,314 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:07:01,314 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 16:07:01,314 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643537925] [2021-12-22 16:07:01,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:07:01,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:07:01,315 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:07:01,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:07:01,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:07:01,316 INFO L87 Difference]: Start difference. First operand 944 states and 1217 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 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) [2021-12-22 16:07:02,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:07:02,625 INFO L93 Difference]: Finished difference Result 944 states and 1217 transitions. [2021-12-22 16:07:02,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:07:02,626 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 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 133 [2021-12-22 16:07:02,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:07:02,630 INFO L225 Difference]: With dead ends: 944 [2021-12-22 16:07:02,630 INFO L226 Difference]: Without dead ends: 942 [2021-12-22 16:07:02,632 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:07:02,633 INFO L933 BasicCegarLoop]: 1165 mSDtfsCounter, 1538 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1704 SdHoareTripleChecker+Valid, 2883 SdHoareTripleChecker+Invalid, 1443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:07:02,633 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1704 Valid, 2883 Invalid, 1443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-22 16:07:02,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2021-12-22 16:07:02,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 942. [2021-12-22 16:07:02,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 617 states have (on average 1.2106969205834683) internal successors, (747), 644 states have internal predecessors, (747), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2021-12-22 16:07:02,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1215 transitions. [2021-12-22 16:07:02,678 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1215 transitions. Word has length 133 [2021-12-22 16:07:02,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:07:02,679 INFO L470 AbstractCegarLoop]: Abstraction has 942 states and 1215 transitions. [2021-12-22 16:07:02,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 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) [2021-12-22 16:07:02,679 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1215 transitions. [2021-12-22 16:07:02,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-12-22 16:07:02,681 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:07:02,681 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 7, 7, 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] [2021-12-22 16:07:02,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-22 16:07:02,681 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-12-22 16:07:02,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:07:02,682 INFO L85 PathProgramCache]: Analyzing trace with hash -793485747, now seen corresponding path program 1 times [2021-12-22 16:07:02,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:07:02,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714674495] [2021-12-22 16:07:02,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:07:02,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:07:02,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:02,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 16:07:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:02,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 16:07:02,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:02,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 16:07:02,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:02,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 16:07:02,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:02,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 16:07:02,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:02,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 16:07:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:02,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-22 16:07:02,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:02,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:07:02,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:02,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-22 16:07:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:02,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-22 16:07:02,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:02,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-22 16:07:02,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:02,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-22 16:07:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:02,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:07:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:02,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 16:07:02,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:02,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 16:07:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:02,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-22 16:07:02,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:02,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:07:02,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:02,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 16:07:02,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:02,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 16:07:02,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:02,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-12-22 16:07:02,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:02,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:07:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:02,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 16:07:02,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:02,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 16:07:02,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:02,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-22 16:07:02,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:02,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-22 16:07:02,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:02,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-12-22 16:07:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:02,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:07:02,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:02,955 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2021-12-22 16:07:02,955 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:07:02,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714674495] [2021-12-22 16:07:02,956 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714674495] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:07:02,957 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:07:02,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 16:07:02,957 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38577307] [2021-12-22 16:07:02,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:07:02,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 16:07:02,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:07:02,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 16:07:02,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-22 16:07:02,959 INFO L87 Difference]: Start difference. First operand 942 states and 1215 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2021-12-22 16:07:05,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:07:05,954 INFO L93 Difference]: Finished difference Result 1900 states and 2489 transitions. [2021-12-22 16:07:05,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 16:07:05,955 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 167 [2021-12-22 16:07:05,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:07:05,972 INFO L225 Difference]: With dead ends: 1900 [2021-12-22 16:07:05,987 INFO L226 Difference]: Without dead ends: 1232 [2021-12-22 16:07:05,990 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-12-22 16:07:06,015 INFO L933 BasicCegarLoop]: 1290 mSDtfsCounter, 1418 mSDsluCounter, 5075 mSDsCounter, 0 mSdLazyCounter, 2375 mSolverCounterSat, 1233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1418 SdHoareTripleChecker+Valid, 6365 SdHoareTripleChecker+Invalid, 3608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1233 IncrementalHoareTripleChecker+Valid, 2375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2021-12-22 16:07:06,015 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1418 Valid, 6365 Invalid, 3608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1233 Valid, 2375 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2021-12-22 16:07:06,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2021-12-22 16:07:06,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 947. [2021-12-22 16:07:06,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 621 states have (on average 1.209339774557166) internal successors, (751), 648 states have internal predecessors, (751), 235 states have call successors, (235), 75 states have call predecessors, (235), 75 states have return successors, (236), 231 states have call predecessors, (236), 233 states have call successors, (236) [2021-12-22 16:07:06,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1222 transitions. [2021-12-22 16:07:06,233 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1222 transitions. Word has length 167 [2021-12-22 16:07:06,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:07:06,234 INFO L470 AbstractCegarLoop]: Abstraction has 947 states and 1222 transitions. [2021-12-22 16:07:06,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2021-12-22 16:07:06,234 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1222 transitions. [2021-12-22 16:07:06,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-12-22 16:07:06,236 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:07:06,236 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:07:06,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-22 16:07:06,236 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-12-22 16:07:06,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:07:06,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1553023, now seen corresponding path program 1 times [2021-12-22 16:07:06,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:07:06,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491493016] [2021-12-22 16:07:06,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:07:06,238 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:07:06,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:06,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 16:07:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:06,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 16:07:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:06,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 16:07:06,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:06,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 16:07:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:06,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 16:07:06,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:06,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 16:07:06,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:06,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-22 16:07:06,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:06,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:07:06,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:06,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-22 16:07:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:06,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-22 16:07:06,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:06,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-22 16:07:06,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:06,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-22 16:07:06,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:06,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-22 16:07:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:06,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-22 16:07:06,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:06,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-22 16:07:06,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:06,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-22 16:07:06,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:06,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-22 16:07:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:06,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-22 16:07:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:06,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-22 16:07:06,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:06,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-22 16:07:06,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:06,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-22 16:07:06,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:06,710 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-22 16:07:06,710 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:07:06,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491493016] [2021-12-22 16:07:06,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491493016] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:07:06,710 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:07:06,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 16:07:06,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640210322] [2021-12-22 16:07:06,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:07:06,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:07:06,725 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:07:06,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:07:06,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:07:06,725 INFO L87 Difference]: Start difference. First operand 947 states and 1222 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 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) [2021-12-22 16:07:08,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:07:08,316 INFO L93 Difference]: Finished difference Result 947 states and 1222 transitions. [2021-12-22 16:07:08,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:07:08,317 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 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 139 [2021-12-22 16:07:08,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:07:08,321 INFO L225 Difference]: With dead ends: 947 [2021-12-22 16:07:08,321 INFO L226 Difference]: Without dead ends: 945 [2021-12-22 16:07:08,321 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:07:08,321 INFO L933 BasicCegarLoop]: 1163 mSDtfsCounter, 1532 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1697 SdHoareTripleChecker+Valid, 2881 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-12-22 16:07:08,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1697 Valid, 2881 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-12-22 16:07:08,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2021-12-22 16:07:08,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 945. [2021-12-22 16:07:08,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 620 states have (on average 1.2080645161290322) internal successors, (749), 646 states have internal predecessors, (749), 235 states have call successors, (235), 75 states have call predecessors, (235), 75 states have return successors, (236), 231 states have call predecessors, (236), 233 states have call successors, (236) [2021-12-22 16:07:08,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1220 transitions. [2021-12-22 16:07:08,387 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1220 transitions. Word has length 139 [2021-12-22 16:07:08,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:07:08,388 INFO L470 AbstractCegarLoop]: Abstraction has 945 states and 1220 transitions. [2021-12-22 16:07:08,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 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) [2021-12-22 16:07:08,389 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1220 transitions. [2021-12-22 16:07:08,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-12-22 16:07:08,390 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:07:08,390 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:07:08,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-22 16:07:08,390 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-12-22 16:07:08,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:07:08,391 INFO L85 PathProgramCache]: Analyzing trace with hash 155827134, now seen corresponding path program 1 times [2021-12-22 16:07:08,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:07:08,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285330807] [2021-12-22 16:07:08,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:07:08,391 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:07:08,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:08,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 16:07:08,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:08,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 16:07:08,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:08,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 16:07:08,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:08,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 16:07:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:08,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 16:07:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:08,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 16:07:08,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:08,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-22 16:07:08,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:08,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:07:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:08,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-22 16:07:08,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:08,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-22 16:07:08,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:08,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-22 16:07:08,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:08,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-22 16:07:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:08,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-22 16:07:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:08,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-22 16:07:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:08,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-22 16:07:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:08,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-22 16:07:08,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:08,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-22 16:07:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:08,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-22 16:07:08,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:08,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-22 16:07:08,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:08,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-22 16:07:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:08,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-22 16:07:08,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:08,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-22 16:07:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:08,573 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-22 16:07:08,573 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:07:08,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285330807] [2021-12-22 16:07:08,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285330807] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:07:08,573 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:07:08,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 16:07:08,573 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429902418] [2021-12-22 16:07:08,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:07:08,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:07:08,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:07:08,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:07:08,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:07:08,575 INFO L87 Difference]: Start difference. First operand 945 states and 1220 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 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) [2021-12-22 16:07:10,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:07:10,043 INFO L93 Difference]: Finished difference Result 945 states and 1220 transitions. [2021-12-22 16:07:10,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:07:10,044 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 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 145 [2021-12-22 16:07:10,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:07:10,047 INFO L225 Difference]: With dead ends: 945 [2021-12-22 16:07:10,047 INFO L226 Difference]: Without dead ends: 943 [2021-12-22 16:07:10,048 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:07:10,048 INFO L933 BasicCegarLoop]: 1161 mSDtfsCounter, 1526 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1690 SdHoareTripleChecker+Valid, 2879 SdHoareTripleChecker+Invalid, 1439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-12-22 16:07:10,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1690 Valid, 2879 Invalid, 1439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-12-22 16:07:10,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2021-12-22 16:07:10,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 943. [2021-12-22 16:07:10,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 619 states have (on average 1.2067851373182552) internal successors, (747), 644 states have internal predecessors, (747), 235 states have call successors, (235), 75 states have call predecessors, (235), 75 states have return successors, (236), 231 states have call predecessors, (236), 233 states have call successors, (236) [2021-12-22 16:07:10,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1218 transitions. [2021-12-22 16:07:10,093 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1218 transitions. Word has length 145 [2021-12-22 16:07:10,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:07:10,094 INFO L470 AbstractCegarLoop]: Abstraction has 943 states and 1218 transitions. [2021-12-22 16:07:10,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 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) [2021-12-22 16:07:10,094 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1218 transitions. [2021-12-22 16:07:10,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-12-22 16:07:10,095 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:07:10,095 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 7, 7, 4, 4, 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] [2021-12-22 16:07:10,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-22 16:07:10,096 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-12-22 16:07:10,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:07:10,096 INFO L85 PathProgramCache]: Analyzing trace with hash -190426035, now seen corresponding path program 1 times [2021-12-22 16:07:10,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:07:10,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280265584] [2021-12-22 16:07:10,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:07:10,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:07:10,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:10,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 16:07:10,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:10,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 16:07:10,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:10,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 16:07:10,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:10,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 16:07:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:10,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 16:07:10,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:10,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 16:07:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:10,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-22 16:07:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:10,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:07:10,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:10,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-22 16:07:10,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:10,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-22 16:07:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:10,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-22 16:07:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:10,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-22 16:07:10,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:10,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:07:10,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:10,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 16:07:10,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:10,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 16:07:10,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:10,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-22 16:07:10,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:10,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:07:10,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:10,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 16:07:10,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:10,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 16:07:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:10,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-12-22 16:07:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:10,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:07:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:10,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 16:07:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:10,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 16:07:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:10,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-22 16:07:10,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:10,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-22 16:07:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:10,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-12-22 16:07:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:10,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:07:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:10,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-22 16:07:10,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:10,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 16:07:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:10,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 16:07:10,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:10,357 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2021-12-22 16:07:10,357 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:07:10,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280265584] [2021-12-22 16:07:10,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280265584] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:07:10,358 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:07:10,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 16:07:10,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654815894] [2021-12-22 16:07:10,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:07:10,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 16:07:10,360 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:07:10,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 16:07:10,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-22 16:07:10,360 INFO L87 Difference]: Start difference. First operand 943 states and 1218 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (26), 6 states have call predecessors, (26), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2021-12-22 16:07:12,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:07:12,770 INFO L93 Difference]: Finished difference Result 1056 states and 1337 transitions. [2021-12-22 16:07:12,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-22 16:07:12,771 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (26), 6 states have call predecessors, (26), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 183 [2021-12-22 16:07:12,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:07:12,775 INFO L225 Difference]: With dead ends: 1056 [2021-12-22 16:07:12,775 INFO L226 Difference]: Without dead ends: 1054 [2021-12-22 16:07:12,776 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2021-12-22 16:07:12,776 INFO L933 BasicCegarLoop]: 1190 mSDtfsCounter, 1876 mSDsluCounter, 3119 mSDsCounter, 0 mSdLazyCounter, 1561 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2029 SdHoareTripleChecker+Valid, 4309 SdHoareTripleChecker+Invalid, 2577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:07:12,776 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2029 Valid, 4309 Invalid, 2577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1561 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-12-22 16:07:12,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2021-12-22 16:07:12,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1037. [2021-12-22 16:07:12,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 682 states have (on average 1.2023460410557185) internal successors, (820), 707 states have internal predecessors, (820), 247 states have call successors, (247), 94 states have call predecessors, (247), 94 states have return successors, (248), 243 states have call predecessors, (248), 245 states have call successors, (248) [2021-12-22 16:07:12,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1315 transitions. [2021-12-22 16:07:12,859 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1315 transitions. Word has length 183 [2021-12-22 16:07:12,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:07:12,860 INFO L470 AbstractCegarLoop]: Abstraction has 1037 states and 1315 transitions. [2021-12-22 16:07:12,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (26), 6 states have call predecessors, (26), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2021-12-22 16:07:12,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1315 transitions. [2021-12-22 16:07:12,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-12-22 16:07:12,861 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:07:12,862 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:07:12,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-22 16:07:12,862 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-12-22 16:07:12,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:07:12,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1747305839, now seen corresponding path program 1 times [2021-12-22 16:07:12,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:07:12,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437876603] [2021-12-22 16:07:12,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:07:12,862 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:07:12,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:12,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 16:07:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:12,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 16:07:12,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:12,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 16:07:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:12,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 16:07:12,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:12,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 16:07:12,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:12,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 16:07:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:12,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-22 16:07:12,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:12,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:07:12,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:12,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-22 16:07:12,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:12,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-22 16:07:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:12,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-22 16:07:12,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:13,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-22 16:07:13,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:13,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-22 16:07:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:13,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-22 16:07:13,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:13,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-22 16:07:13,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:13,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-22 16:07:13,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:13,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-22 16:07:13,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:13,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-22 16:07:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:13,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-22 16:07:13,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:13,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-22 16:07:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:13,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-22 16:07:13,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:13,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-22 16:07:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:13,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-22 16:07:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:13,055 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-22 16:07:13,056 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:07:13,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437876603] [2021-12-22 16:07:13,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437876603] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:07:13,056 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:07:13,056 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 16:07:13,056 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595163488] [2021-12-22 16:07:13,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:07:13,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:07:13,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:07:13,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:07:13,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:07:13,058 INFO L87 Difference]: Start difference. First operand 1037 states and 1315 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 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) [2021-12-22 16:07:14,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:07:14,658 INFO L93 Difference]: Finished difference Result 1037 states and 1315 transitions. [2021-12-22 16:07:14,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:07:14,659 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 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 151 [2021-12-22 16:07:14,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:07:14,663 INFO L225 Difference]: With dead ends: 1037 [2021-12-22 16:07:14,663 INFO L226 Difference]: Without dead ends: 1035 [2021-12-22 16:07:14,663 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:07:14,664 INFO L933 BasicCegarLoop]: 1159 mSDtfsCounter, 1520 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1683 SdHoareTripleChecker+Valid, 2877 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-12-22 16:07:14,664 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1683 Valid, 2877 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-12-22 16:07:14,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2021-12-22 16:07:14,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1035. [2021-12-22 16:07:14,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 681 states have (on average 1.2011747430249633) internal successors, (818), 705 states have internal predecessors, (818), 247 states have call successors, (247), 94 states have call predecessors, (247), 94 states have return successors, (248), 243 states have call predecessors, (248), 245 states have call successors, (248) [2021-12-22 16:07:14,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1313 transitions. [2021-12-22 16:07:14,743 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1313 transitions. Word has length 151 [2021-12-22 16:07:14,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:07:14,743 INFO L470 AbstractCegarLoop]: Abstraction has 1035 states and 1313 transitions. [2021-12-22 16:07:14,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 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) [2021-12-22 16:07:14,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1313 transitions. [2021-12-22 16:07:14,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2021-12-22 16:07:14,746 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:07:14,746 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2021-12-22 16:07:14,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-22 16:07:14,747 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-12-22 16:07:14,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:07:14,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1924683292, now seen corresponding path program 1 times [2021-12-22 16:07:14,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:07:14,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123792394] [2021-12-22 16:07:14,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:07:14,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:07:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:14,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 16:07:14,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:14,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 16:07:14,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:14,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 16:07:14,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:14,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 16:07:14,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:14,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-22 16:07:14,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:14,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:07:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:14,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 16:07:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:14,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 16:07:14,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:14,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-22 16:07:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:15,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:07:15,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:15,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 16:07:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:15,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 16:07:15,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:15,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-22 16:07:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:15,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:07:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:15,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 16:07:15,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:15,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 16:07:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:15,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-22 16:07:15,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:15,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:07:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:15,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 16:07:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:15,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 16:07:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:15,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-22 16:07:15,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:15,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:07:15,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:15,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 16:07:15,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:15,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 16:07:15,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:15,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-22 16:07:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:15,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-22 16:07:15,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:15,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-12-22 16:07:15,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:15,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:07:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:15,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:07:15,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:15,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:07:15,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:15,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-22 16:07:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:15,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 16:07:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:15,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:07:15,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:15,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-22 16:07:15,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:15,124 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2021-12-22 16:07:15,125 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:07:15,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123792394] [2021-12-22 16:07:15,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123792394] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:07:15,125 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:07:15,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 16:07:15,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603063289] [2021-12-22 16:07:15,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:07:15,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:07:15,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:07:15,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:07:15,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:07:15,127 INFO L87 Difference]: Start difference. First operand 1035 states and 1313 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (22), 4 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-12-22 16:07:16,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:07:16,884 INFO L93 Difference]: Finished difference Result 1945 states and 2449 transitions. [2021-12-22 16:07:16,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 16:07:16,885 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (22), 4 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 199 [2021-12-22 16:07:16,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:07:16,892 INFO L225 Difference]: With dead ends: 1945 [2021-12-22 16:07:16,892 INFO L226 Difference]: Without dead ends: 1042 [2021-12-22 16:07:16,898 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-22 16:07:16,899 INFO L933 BasicCegarLoop]: 966 mSDtfsCounter, 1832 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 954 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2018 SdHoareTripleChecker+Valid, 2230 SdHoareTripleChecker+Invalid, 1812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 954 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-12-22 16:07:16,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2018 Valid, 2230 Invalid, 1812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [954 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-12-22 16:07:16,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2021-12-22 16:07:16,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1031. [2021-12-22 16:07:16,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1031 states, 678 states have (on average 1.1991150442477876) internal successors, (813), 701 states have internal predecessors, (813), 247 states have call successors, (247), 94 states have call predecessors, (247), 94 states have return successors, (248), 243 states have call predecessors, (248), 245 states have call successors, (248) [2021-12-22 16:07:16,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1308 transitions. [2021-12-22 16:07:16,948 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1308 transitions. Word has length 199 [2021-12-22 16:07:16,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:07:16,949 INFO L470 AbstractCegarLoop]: Abstraction has 1031 states and 1308 transitions. [2021-12-22 16:07:16,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (22), 4 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-12-22 16:07:16,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1308 transitions. [2021-12-22 16:07:16,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-12-22 16:07:16,950 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:07:16,950 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:07:16,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-22 16:07:16,951 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-12-22 16:07:16,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:07:16,951 INFO L85 PathProgramCache]: Analyzing trace with hash 794045404, now seen corresponding path program 1 times [2021-12-22 16:07:16,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:07:16,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501284825] [2021-12-22 16:07:16,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:07:16,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:07:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:17,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 16:07:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:17,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 16:07:17,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:17,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 16:07:17,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:17,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 16:07:17,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:17,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 16:07:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:17,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 16:07:17,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:17,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-22 16:07:17,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:17,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:07:17,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:17,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-22 16:07:17,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:17,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-22 16:07:17,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:17,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-22 16:07:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:17,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-22 16:07:17,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:17,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-22 16:07:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:17,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-22 16:07:17,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:17,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-22 16:07:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:17,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-22 16:07:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:17,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-22 16:07:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:17,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-22 16:07:17,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:17,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-22 16:07:17,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:17,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-22 16:07:17,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:17,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-22 16:07:17,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:17,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-22 16:07:17,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:17,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-22 16:07:17,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:17,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-12-22 16:07:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:17,127 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-22 16:07:17,127 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:07:17,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501284825] [2021-12-22 16:07:17,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501284825] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:07:17,128 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:07:17,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 16:07:17,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823050199] [2021-12-22 16:07:17,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:07:17,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:07:17,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:07:17,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:07:17,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:07:17,130 INFO L87 Difference]: Start difference. First operand 1031 states and 1308 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 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) [2021-12-22 16:07:18,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:07:18,545 INFO L93 Difference]: Finished difference Result 1031 states and 1308 transitions. [2021-12-22 16:07:18,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:07:18,546 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 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 157 [2021-12-22 16:07:18,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:07:18,550 INFO L225 Difference]: With dead ends: 1031 [2021-12-22 16:07:18,550 INFO L226 Difference]: Without dead ends: 1029 [2021-12-22 16:07:18,551 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:07:18,552 INFO L933 BasicCegarLoop]: 1152 mSDtfsCounter, 1509 mSDsluCounter, 1704 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1671 SdHoareTripleChecker+Valid, 2856 SdHoareTripleChecker+Invalid, 1434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-22 16:07:18,552 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1671 Valid, 2856 Invalid, 1434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-12-22 16:07:18,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2021-12-22 16:07:18,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1029. [2021-12-22 16:07:18,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 677 states have (on average 1.1979320531757756) internal successors, (811), 699 states have internal predecessors, (811), 247 states have call successors, (247), 94 states have call predecessors, (247), 94 states have return successors, (248), 243 states have call predecessors, (248), 245 states have call successors, (248) [2021-12-22 16:07:18,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1306 transitions. [2021-12-22 16:07:18,601 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1306 transitions. Word has length 157 [2021-12-22 16:07:18,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:07:18,601 INFO L470 AbstractCegarLoop]: Abstraction has 1029 states and 1306 transitions. [2021-12-22 16:07:18,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 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) [2021-12-22 16:07:18,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1306 transitions. [2021-12-22 16:07:18,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2021-12-22 16:07:18,604 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:07:18,604 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:07:18,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-22 16:07:18,605 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-12-22 16:07:18,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:07:18,605 INFO L85 PathProgramCache]: Analyzing trace with hash -8470101, now seen corresponding path program 1 times [2021-12-22 16:07:18,605 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:07:18,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187759524] [2021-12-22 16:07:18,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:07:18,606 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:07:18,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:18,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 16:07:18,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:18,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 16:07:18,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:18,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 16:07:18,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:18,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 16:07:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:18,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-22 16:07:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:18,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:07:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:18,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 16:07:18,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:18,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 16:07:18,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:18,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-22 16:07:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:18,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:07:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:18,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 16:07:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:18,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 16:07:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:18,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-22 16:07:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:18,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:07:18,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:18,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 16:07:18,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:18,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 16:07:18,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:18,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-22 16:07:18,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:18,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:07:18,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:18,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 16:07:18,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:18,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 16:07:18,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:18,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-22 16:07:18,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:18,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:07:18,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:18,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 16:07:18,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:18,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 16:07:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:18,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-22 16:07:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:18,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-22 16:07:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:18,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-12-22 16:07:18,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:18,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:07:18,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:18,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:07:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:18,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:07:18,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:18,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-22 16:07:18,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:18,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 16:07:18,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:18,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:07:18,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:18,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-22 16:07:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:18,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-22 16:07:18,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:18,864 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2021-12-22 16:07:18,864 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:07:18,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187759524] [2021-12-22 16:07:18,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187759524] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:07:18,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549070388] [2021-12-22 16:07:18,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:07:18,865 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:07:18,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:07:18,879 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 16:07:18,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-22 16:07:19,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:19,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 2061 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-22 16:07:19,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:07:19,870 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2021-12-22 16:07:19,871 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:07:19,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549070388] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:07:19,871 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 16:07:19,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2021-12-22 16:07:19,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187965837] [2021-12-22 16:07:19,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:07:19,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 16:07:19,873 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:07:19,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 16:07:19,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-12-22 16:07:19,873 INFO L87 Difference]: Start difference. First operand 1029 states and 1306 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-12-22 16:07:19,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:07:19,936 INFO L93 Difference]: Finished difference Result 1975 states and 2484 transitions. [2021-12-22 16:07:19,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 16:07:19,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 205 [2021-12-22 16:07:19,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:07:19,940 INFO L225 Difference]: With dead ends: 1975 [2021-12-22 16:07:19,940 INFO L226 Difference]: Without dead ends: 1081 [2021-12-22 16:07:19,942 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-12-22 16:07:19,942 INFO L933 BasicCegarLoop]: 1261 mSDtfsCounter, 1136 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1136 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 16:07:19,943 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1136 Valid, 1328 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 16:07:19,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2021-12-22 16:07:19,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1078. [2021-12-22 16:07:19,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 706 states have (on average 1.1912181303116147) internal successors, (841), 731 states have internal predecessors, (841), 262 states have call successors, (262), 100 states have call predecessors, (262), 100 states have return successors, (263), 256 states have call predecessors, (263), 260 states have call successors, (263) [2021-12-22 16:07:19,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1366 transitions. [2021-12-22 16:07:19,992 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1366 transitions. Word has length 205 [2021-12-22 16:07:19,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:07:19,993 INFO L470 AbstractCegarLoop]: Abstraction has 1078 states and 1366 transitions. [2021-12-22 16:07:19,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-12-22 16:07:19,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1366 transitions. [2021-12-22 16:07:19,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-12-22 16:07:19,994 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:07:19,995 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:07:20,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-22 16:07:20,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-12-22 16:07:20,201 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-12-22 16:07:20,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:07:20,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1444426604, now seen corresponding path program 1 times [2021-12-22 16:07:20,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:07:20,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315877827] [2021-12-22 16:07:20,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:07:20,217 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:07:20,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:20,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 16:07:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:20,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 16:07:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:20,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 16:07:20,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:20,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 16:07:20,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:20,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 16:07:20,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:20,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 16:07:20,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:20,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-22 16:07:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:20,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:07:20,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:20,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-22 16:07:20,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:20,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-22 16:07:20,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:20,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-22 16:07:20,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:20,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-22 16:07:20,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:20,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-22 16:07:20,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:20,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-22 16:07:20,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:20,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-22 16:07:20,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:20,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-22 16:07:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:20,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-22 16:07:20,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:20,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-22 16:07:20,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:20,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-22 16:07:20,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:20,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-22 16:07:20,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:20,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-22 16:07:20,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:20,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-22 16:07:20,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:20,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-22 16:07:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:20,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-12-22 16:07:20,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:20,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-12-22 16:07:20,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:20,467 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-22 16:07:20,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:07:20,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315877827] [2021-12-22 16:07:20,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315877827] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:07:20,468 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:07:20,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 16:07:20,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470188445] [2021-12-22 16:07:20,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:07:20,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:07:20,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:07:20,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:07:20,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:07:20,470 INFO L87 Difference]: Start difference. First operand 1078 states and 1366 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 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) [2021-12-22 16:07:21,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:07:21,901 INFO L93 Difference]: Finished difference Result 1078 states and 1366 transitions. [2021-12-22 16:07:21,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:07:21,902 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 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 163 [2021-12-22 16:07:21,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:07:21,907 INFO L225 Difference]: With dead ends: 1078 [2021-12-22 16:07:21,907 INFO L226 Difference]: Without dead ends: 1076 [2021-12-22 16:07:21,907 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:07:21,908 INFO L933 BasicCegarLoop]: 1145 mSDtfsCounter, 1498 mSDsluCounter, 1690 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1659 SdHoareTripleChecker+Valid, 2835 SdHoareTripleChecker+Invalid, 1431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-22 16:07:21,908 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1659 Valid, 2835 Invalid, 1431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-12-22 16:07:21,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2021-12-22 16:07:21,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 1076. [2021-12-22 16:07:21,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1076 states, 705 states have (on average 1.1900709219858157) internal successors, (839), 729 states have internal predecessors, (839), 262 states have call successors, (262), 100 states have call predecessors, (262), 100 states have return successors, (263), 256 states have call predecessors, (263), 260 states have call successors, (263) [2021-12-22 16:07:21,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1364 transitions. [2021-12-22 16:07:21,988 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1364 transitions. Word has length 163 [2021-12-22 16:07:21,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:07:21,988 INFO L470 AbstractCegarLoop]: Abstraction has 1076 states and 1364 transitions. [2021-12-22 16:07:21,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 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) [2021-12-22 16:07:21,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1364 transitions. [2021-12-22 16:07:21,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2021-12-22 16:07:21,990 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:07:21,991 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 7, 7, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:07:21,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-22 16:07:21,991 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-12-22 16:07:21,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:07:21,991 INFO L85 PathProgramCache]: Analyzing trace with hash -997022710, now seen corresponding path program 1 times [2021-12-22 16:07:21,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:07:21,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168806329] [2021-12-22 16:07:21,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:07:21,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:07:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:22,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 16:07:22,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:22,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 16:07:22,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:22,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 16:07:22,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:22,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 16:07:22,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:22,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 16:07:22,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:22,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 16:07:22,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:22,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-22 16:07:22,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:22,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:07:22,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:22,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-22 16:07:22,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:22,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-22 16:07:22,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:22,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-22 16:07:22,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:22,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-22 16:07:22,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:22,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:07:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:22,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 16:07:22,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:22,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 16:07:22,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:22,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-22 16:07:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:22,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:07:22,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:22,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 16:07:22,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:22,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 16:07:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:22,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-12-22 16:07:22,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:22,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:07:22,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:22,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 16:07:22,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:22,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 16:07:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:22,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-22 16:07:22,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:22,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-22 16:07:22,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:22,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-12-22 16:07:22,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:22,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:07:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:22,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-22 16:07:22,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:22,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 16:07:22,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:22,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 16:07:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:22,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2021-12-22 16:07:22,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:22,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 16:07:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:22,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2021-12-22 16:07:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:07:22,243 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2021-12-22 16:07:22,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:07:22,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168806329] [2021-12-22 16:07:22,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168806329] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:07:22,243 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:07:22,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 16:07:22,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79071235] [2021-12-22 16:07:22,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:07:22,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 16:07:22,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:07:22,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 16:07:22,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-22 16:07:22,245 INFO L87 Difference]: Start difference. First operand 1076 states and 1364 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (29), 7 states have call predecessors, (29), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27)