./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--net--team--team.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0f8a17c6 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--net--team--team.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 c2e40c074e34eae853879e913dea35acffb5001042b37759d8583ab68da2fb52 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-17 12:59:19,616 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-17 12:59:19,618 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-17 12:59:19,652 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-17 12:59:19,653 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-17 12:59:19,656 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-17 12:59:19,657 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-17 12:59:19,659 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-17 12:59:19,660 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-17 12:59:19,661 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-17 12:59:19,661 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-17 12:59:19,662 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-17 12:59:19,663 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-17 12:59:19,666 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-17 12:59:19,667 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-17 12:59:19,672 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-17 12:59:19,673 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-17 12:59:19,674 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-17 12:59:19,676 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-17 12:59:19,677 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-17 12:59:19,678 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-17 12:59:19,679 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-17 12:59:19,680 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-17 12:59:19,681 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-17 12:59:19,686 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-17 12:59:19,687 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-17 12:59:19,687 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-17 12:59:19,688 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-17 12:59:19,689 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-17 12:59:19,689 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-17 12:59:19,689 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-17 12:59:19,690 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-17 12:59:19,691 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-17 12:59:19,692 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-17 12:59:19,693 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-17 12:59:19,693 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-17 12:59:19,693 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-17 12:59:19,693 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-17 12:59:19,694 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-17 12:59:19,694 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-17 12:59:19,695 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-17 12:59:19,696 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-17 12:59:19,720 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-17 12:59:19,720 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-17 12:59:19,720 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-17 12:59:19,721 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-17 12:59:19,721 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-17 12:59:19,721 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-17 12:59:19,722 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-17 12:59:19,722 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-17 12:59:19,722 INFO L138 SettingsManager]: * Use SBE=true [2021-11-17 12:59:19,722 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-17 12:59:19,723 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-17 12:59:19,723 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-17 12:59:19,723 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-17 12:59:19,724 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-17 12:59:19,724 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-17 12:59:19,724 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-17 12:59:19,724 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-17 12:59:19,724 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-17 12:59:19,724 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-17 12:59:19,725 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-17 12:59:19,725 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-17 12:59:19,725 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 12:59:19,725 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-17 12:59:19,725 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-17 12:59:19,725 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-17 12:59:19,725 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-17 12:59:19,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-17 12:59:19,727 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-17 12:59:19,727 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-17 12:59:19,727 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-17 12:59:19,727 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-17 12:59:19,727 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 -> c2e40c074e34eae853879e913dea35acffb5001042b37759d8583ab68da2fb52 [2021-11-17 12:59:19,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-17 12:59:19,961 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-17 12:59:19,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-17 12:59:19,963 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-17 12:59:19,964 INFO L275 PluginConnector]: CDTParser initialized [2021-11-17 12:59:19,965 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--net--team--team.ko.cil.i [2021-11-17 12:59:20,022 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a79ee82f/25914059e84f42b0a77a0a181826d482/FLAG71d5572b6 [2021-11-17 12:59:20,690 INFO L306 CDTParser]: Found 1 translation units. [2021-11-17 12:59:20,690 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i [2021-11-17 12:59:20,740 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a79ee82f/25914059e84f42b0a77a0a181826d482/FLAG71d5572b6 [2021-11-17 12:59:20,789 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a79ee82f/25914059e84f42b0a77a0a181826d482 [2021-11-17 12:59:20,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-17 12:59:20,793 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-17 12:59:20,795 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-17 12:59:20,795 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-17 12:59:20,797 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-17 12:59:20,798 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:59:20" (1/1) ... [2021-11-17 12:59:20,799 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2baacda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:59:20, skipping insertion in model container [2021-11-17 12:59:20,799 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:59:20" (1/1) ... [2021-11-17 12:59:20,803 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-17 12:59:20,926 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-17 12:59:25,820 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[552584,552597] [2021-11-17 12:59:25,823 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[552729,552742] [2021-11-17 12:59:25,824 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[552875,552888] [2021-11-17 12:59:25,825 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[553040,553053] [2021-11-17 12:59:25,825 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[553198,553211] [2021-11-17 12:59:25,826 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[553356,553369] [2021-11-17 12:59:25,826 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[553514,553527] [2021-11-17 12:59:25,826 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[553674,553687] [2021-11-17 12:59:25,827 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[553833,553846] [2021-11-17 12:59:25,827 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[553972,553985] [2021-11-17 12:59:25,827 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[554114,554127] [2021-11-17 12:59:25,828 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[554263,554276] [2021-11-17 12:59:25,828 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[554402,554415] [2021-11-17 12:59:25,829 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[554557,554570] [2021-11-17 12:59:25,829 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[554717,554730] [2021-11-17 12:59:25,829 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[554868,554881] [2021-11-17 12:59:25,830 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[555019,555032] [2021-11-17 12:59:25,830 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[555171,555184] [2021-11-17 12:59:25,830 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[555320,555333] [2021-11-17 12:59:25,831 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[555468,555481] [2021-11-17 12:59:25,831 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[555625,555638] [2021-11-17 12:59:25,831 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[555774,555787] [2021-11-17 12:59:25,832 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[555930,555943] [2021-11-17 12:59:25,832 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[556083,556096] [2021-11-17 12:59:25,833 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[556229,556242] [2021-11-17 12:59:25,833 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[556372,556385] [2021-11-17 12:59:25,833 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[556524,556537] [2021-11-17 12:59:25,834 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[556670,556683] [2021-11-17 12:59:25,834 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[556815,556828] [2021-11-17 12:59:25,834 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[556969,556982] [2021-11-17 12:59:25,835 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[557120,557133] [2021-11-17 12:59:25,835 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[557275,557288] [2021-11-17 12:59:25,835 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[557427,557440] [2021-11-17 12:59:25,836 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[557582,557595] [2021-11-17 12:59:25,836 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[557746,557759] [2021-11-17 12:59:25,836 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[557902,557915] [2021-11-17 12:59:25,836 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[558066,558079] [2021-11-17 12:59:25,837 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[558208,558221] [2021-11-17 12:59:25,837 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[558366,558379] [2021-11-17 12:59:25,837 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[558533,558546] [2021-11-17 12:59:25,838 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[558692,558705] [2021-11-17 12:59:25,838 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[558851,558864] [2021-11-17 12:59:25,838 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[559000,559013] [2021-11-17 12:59:25,839 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[559147,559160] [2021-11-17 12:59:25,839 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[559286,559299] [2021-11-17 12:59:25,839 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[559449,559462] [2021-11-17 12:59:25,839 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[559615,559628] [2021-11-17 12:59:25,840 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[559779,559792] [2021-11-17 12:59:25,840 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[559944,559957] [2021-11-17 12:59:25,840 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[560109,560122] [2021-11-17 12:59:25,841 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[560275,560288] [2021-11-17 12:59:25,841 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[560440,560453] [2021-11-17 12:59:25,841 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[560607,560620] [2021-11-17 12:59:25,841 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[560767,560780] [2021-11-17 12:59:25,842 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[560929,560942] [2021-11-17 12:59:25,842 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[561088,561101] [2021-11-17 12:59:25,842 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[561234,561247] [2021-11-17 12:59:25,843 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[561377,561390] [2021-11-17 12:59:25,843 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[561521,561534] [2021-11-17 12:59:25,843 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[561664,561677] [2021-11-17 12:59:25,844 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[561808,561821] [2021-11-17 12:59:25,844 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[561949,561962] [2021-11-17 12:59:25,844 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[562087,562100] [2021-11-17 12:59:25,844 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[562245,562258] [2021-11-17 12:59:25,845 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[562404,562417] [2021-11-17 12:59:25,845 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[562560,562573] [2021-11-17 12:59:25,845 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[562709,562722] [2021-11-17 12:59:25,846 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[562861,562874] [2021-11-17 12:59:25,846 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[563012,563025] [2021-11-17 12:59:25,846 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[563161,563174] [2021-11-17 12:59:25,846 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[563313,563326] [2021-11-17 12:59:25,847 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[563461,563474] [2021-11-17 12:59:25,847 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[563614,563627] [2021-11-17 12:59:25,847 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[563765,563778] [2021-11-17 12:59:25,848 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[563915,563928] [2021-11-17 12:59:25,848 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[564062,564075] [2021-11-17 12:59:25,848 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[564213,564226] [2021-11-17 12:59:25,849 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[564364,564377] [2021-11-17 12:59:25,849 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[564512,564525] [2021-11-17 12:59:25,849 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[564678,564691] [2021-11-17 12:59:25,849 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[564847,564860] [2021-11-17 12:59:25,850 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[565014,565027] [2021-11-17 12:59:25,850 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[565182,565195] [2021-11-17 12:59:25,850 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[565332,565345] [2021-11-17 12:59:25,851 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[565479,565492] [2021-11-17 12:59:25,851 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[565640,565653] [2021-11-17 12:59:25,851 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[565810,565823] [2021-11-17 12:59:25,852 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[565972,565985] [2021-11-17 12:59:25,861 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 12:59:25,911 INFO L203 MainTranslator]: Completed pre-run [2021-11-17 12:59:26,287 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[552584,552597] [2021-11-17 12:59:26,288 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[552729,552742] [2021-11-17 12:59:26,289 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[552875,552888] [2021-11-17 12:59:26,290 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[553040,553053] [2021-11-17 12:59:26,290 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[553198,553211] [2021-11-17 12:59:26,291 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[553356,553369] [2021-11-17 12:59:26,291 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[553514,553527] [2021-11-17 12:59:26,292 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[553674,553687] [2021-11-17 12:59:26,292 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[553833,553846] [2021-11-17 12:59:26,293 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[553972,553985] [2021-11-17 12:59:26,293 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[554114,554127] [2021-11-17 12:59:26,293 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[554263,554276] [2021-11-17 12:59:26,294 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[554402,554415] [2021-11-17 12:59:26,295 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[554557,554570] [2021-11-17 12:59:26,295 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[554717,554730] [2021-11-17 12:59:26,295 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[554868,554881] [2021-11-17 12:59:26,296 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[555019,555032] [2021-11-17 12:59:26,296 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[555171,555184] [2021-11-17 12:59:26,296 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[555320,555333] [2021-11-17 12:59:26,297 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[555468,555481] [2021-11-17 12:59:26,297 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[555625,555638] [2021-11-17 12:59:26,298 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[555774,555787] [2021-11-17 12:59:26,298 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[555930,555943] [2021-11-17 12:59:26,299 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[556083,556096] [2021-11-17 12:59:26,299 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[556229,556242] [2021-11-17 12:59:26,299 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[556372,556385] [2021-11-17 12:59:26,299 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[556524,556537] [2021-11-17 12:59:26,300 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[556670,556683] [2021-11-17 12:59:26,300 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[556815,556828] [2021-11-17 12:59:26,300 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[556969,556982] [2021-11-17 12:59:26,300 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[557120,557133] [2021-11-17 12:59:26,301 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[557275,557288] [2021-11-17 12:59:26,301 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[557427,557440] [2021-11-17 12:59:26,302 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[557582,557595] [2021-11-17 12:59:26,302 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[557746,557759] [2021-11-17 12:59:26,302 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[557902,557915] [2021-11-17 12:59:26,303 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[558066,558079] [2021-11-17 12:59:26,303 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[558208,558221] [2021-11-17 12:59:26,303 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[558366,558379] [2021-11-17 12:59:26,304 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[558533,558546] [2021-11-17 12:59:26,317 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[558692,558705] [2021-11-17 12:59:26,318 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[558851,558864] [2021-11-17 12:59:26,318 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[559000,559013] [2021-11-17 12:59:26,318 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[559147,559160] [2021-11-17 12:59:26,318 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[559286,559299] [2021-11-17 12:59:26,319 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[559449,559462] [2021-11-17 12:59:26,319 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[559615,559628] [2021-11-17 12:59:26,319 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[559779,559792] [2021-11-17 12:59:26,320 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[559944,559957] [2021-11-17 12:59:26,320 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[560109,560122] [2021-11-17 12:59:26,320 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[560275,560288] [2021-11-17 12:59:26,320 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[560440,560453] [2021-11-17 12:59:26,321 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[560607,560620] [2021-11-17 12:59:26,321 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[560767,560780] [2021-11-17 12:59:26,321 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[560929,560942] [2021-11-17 12:59:26,321 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[561088,561101] [2021-11-17 12:59:26,322 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[561234,561247] [2021-11-17 12:59:26,322 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[561377,561390] [2021-11-17 12:59:26,322 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[561521,561534] [2021-11-17 12:59:26,323 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[561664,561677] [2021-11-17 12:59:26,323 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[561808,561821] [2021-11-17 12:59:26,323 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[561949,561962] [2021-11-17 12:59:26,323 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[562087,562100] [2021-11-17 12:59:26,324 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[562245,562258] [2021-11-17 12:59:26,324 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[562404,562417] [2021-11-17 12:59:26,324 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[562560,562573] [2021-11-17 12:59:26,324 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[562709,562722] [2021-11-17 12:59:26,325 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[562861,562874] [2021-11-17 12:59:26,325 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[563012,563025] [2021-11-17 12:59:26,325 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[563161,563174] [2021-11-17 12:59:26,325 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[563313,563326] [2021-11-17 12:59:26,326 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[563461,563474] [2021-11-17 12:59:26,326 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[563614,563627] [2021-11-17 12:59:26,326 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[563765,563778] [2021-11-17 12:59:26,326 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[563915,563928] [2021-11-17 12:59:26,327 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[564062,564075] [2021-11-17 12:59:26,327 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[564213,564226] [2021-11-17 12:59:26,327 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[564364,564377] [2021-11-17 12:59:26,328 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[564512,564525] [2021-11-17 12:59:26,328 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[564678,564691] [2021-11-17 12:59:26,328 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[564847,564860] [2021-11-17 12:59:26,328 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[565014,565027] [2021-11-17 12:59:26,329 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[565182,565195] [2021-11-17 12:59:26,329 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[565332,565345] [2021-11-17 12:59:26,329 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[565479,565492] [2021-11-17 12:59:26,329 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[565640,565653] [2021-11-17 12:59:26,330 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[565810,565823] [2021-11-17 12:59:26,330 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i[565972,565985] [2021-11-17 12:59:26,333 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 12:59:26,611 INFO L208 MainTranslator]: Completed translation [2021-11-17 12:59:26,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:59:26 WrapperNode [2021-11-17 12:59:26,612 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-17 12:59:26,612 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-17 12:59:26,613 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-17 12:59:26,613 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-17 12:59:26,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:59:26" (1/1) ... [2021-11-17 12:59:26,725 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:59:26" (1/1) ... [2021-11-17 12:59:26,945 INFO L137 Inliner]: procedures = 918, calls = 3166, calls flagged for inlining = 418, calls inlined = 342, statements flattened = 7962 [2021-11-17 12:59:26,946 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-17 12:59:26,947 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-17 12:59:26,947 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-17 12:59:26,947 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-17 12:59:26,954 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:59:26" (1/1) ... [2021-11-17 12:59:26,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:59:26" (1/1) ... [2021-11-17 12:59:26,996 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:59:26" (1/1) ... [2021-11-17 12:59:26,997 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:59:26" (1/1) ... [2021-11-17 12:59:27,102 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:59:26" (1/1) ... [2021-11-17 12:59:27,124 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:59:26" (1/1) ... [2021-11-17 12:59:27,157 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:59:26" (1/1) ... [2021-11-17 12:59:27,195 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-17 12:59:27,196 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-17 12:59:27,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-17 12:59:27,196 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-17 12:59:27,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:59:26" (1/1) ... [2021-11-17 12:59:27,201 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 12:59:27,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 12:59:27,224 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-11-17 12:59:27,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-17 12:59:27,254 INFO L130 BoogieDeclarations]: Found specification of procedure nla_get_u32 [2021-11-17 12:59:27,256 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_get_u32 [2021-11-17 12:59:27,256 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_total_size [2021-11-17 12:59:27,258 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_total_size [2021-11-17 12:59:27,258 INFO L130 BoogieDeclarations]: Found specification of procedure team_mode_option_get [2021-11-17 12:59:27,258 INFO L138 BoogieDeclarations]: Found implementation of procedure team_mode_option_get [2021-11-17 12:59:27,258 INFO L130 BoogieDeclarations]: Found specification of procedure __team_change_mode [2021-11-17 12:59:27,258 INFO L138 BoogieDeclarations]: Found implementation of procedure __team_change_mode [2021-11-17 12:59:27,258 INFO L130 BoogieDeclarations]: Found specification of procedure nla_put_u32 [2021-11-17 12:59:27,258 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_put_u32 [2021-11-17 12:59:27,258 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_131 [2021-11-17 12:59:27,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_131 [2021-11-17 12:59:27,259 INFO L130 BoogieDeclarations]: Found specification of procedure team_init [2021-11-17 12:59:27,259 INFO L138 BoogieDeclarations]: Found implementation of procedure team_init [2021-11-17 12:59:27,259 INFO L130 BoogieDeclarations]: Found specification of procedure team_notify_peers_interval_set [2021-11-17 12:59:27,259 INFO L138 BoogieDeclarations]: Found implementation of procedure team_notify_peers_interval_set [2021-11-17 12:59:27,260 INFO L130 BoogieDeclarations]: Found specification of procedure team_del_slave [2021-11-17 12:59:27,260 INFO L138 BoogieDeclarations]: Found implementation of procedure team_del_slave [2021-11-17 12:59:27,260 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec_if_positive [2021-11-17 12:59:27,261 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec_if_positive [2021-11-17 12:59:27,261 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-11-17 12:59:27,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-11-17 12:59:27,261 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2021-11-17 12:59:27,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2021-11-17 12:59:27,261 INFO L130 BoogieDeclarations]: Found specification of procedure arch_local_irq_restore [2021-11-17 12:59:27,262 INFO L138 BoogieDeclarations]: Found implementation of procedure arch_local_irq_restore [2021-11-17 12:59:27,262 INFO L130 BoogieDeclarations]: Found specification of procedure free_percpu [2021-11-17 12:59:27,262 INFO L138 BoogieDeclarations]: Found implementation of procedure free_percpu [2021-11-17 12:59:27,262 INFO L130 BoogieDeclarations]: Found specification of procedure team_priority_option_get [2021-11-17 12:59:27,262 INFO L138 BoogieDeclarations]: Found implementation of procedure team_priority_option_get [2021-11-17 12:59:27,262 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_net_rtnetlink__double_lock [2021-11-17 12:59:27,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_net_rtnetlink__double_lock [2021-11-17 12:59:27,262 INFO L130 BoogieDeclarations]: Found specification of procedure team_queue_override_fini [2021-11-17 12:59:27,262 INFO L138 BoogieDeclarations]: Found implementation of procedure team_queue_override_fini [2021-11-17 12:59:27,263 INFO L130 BoogieDeclarations]: Found specification of procedure strlcpy [2021-11-17 12:59:27,263 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcpy [2021-11-17 12:59:27,263 INFO L130 BoogieDeclarations]: Found specification of procedure team_port_get_rtnl [2021-11-17 12:59:27,263 INFO L138 BoogieDeclarations]: Found implementation of procedure team_port_get_rtnl [2021-11-17 12:59:27,263 INFO L130 BoogieDeclarations]: Found specification of procedure arch_irqs_disabled_flags [2021-11-17 12:59:27,263 INFO L138 BoogieDeclarations]: Found implementation of procedure arch_irqs_disabled_flags [2021-11-17 12:59:27,263 INFO L130 BoogieDeclarations]: Found specification of procedure team_set_mac_address [2021-11-17 12:59:27,263 INFO L138 BoogieDeclarations]: Found implementation of procedure team_set_mac_address [2021-11-17 12:59:27,263 INFO L130 BoogieDeclarations]: Found specification of procedure team_notify_peers_count_set [2021-11-17 12:59:27,264 INFO L138 BoogieDeclarations]: Found implementation of procedure team_notify_peers_count_set [2021-11-17 12:59:27,264 INFO L130 BoogieDeclarations]: Found specification of procedure team_add_slave [2021-11-17 12:59:27,264 INFO L138 BoogieDeclarations]: Found implementation of procedure team_add_slave [2021-11-17 12:59:27,264 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_add [2021-11-17 12:59:27,264 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_add [2021-11-17 12:59:27,264 INFO L130 BoogieDeclarations]: Found specification of procedure __team_option_inst_del_option [2021-11-17 12:59:27,264 INFO L138 BoogieDeclarations]: Found implementation of procedure __team_option_inst_del_option [2021-11-17 12:59:27,264 INFO L130 BoogieDeclarations]: Found specification of procedure team_mode_put [2021-11-17 12:59:27,264 INFO L138 BoogieDeclarations]: Found implementation of procedure team_mode_put [2021-11-17 12:59:27,264 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2021-11-17 12:59:27,265 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2021-11-17 12:59:27,265 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2021-11-17 12:59:27,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2021-11-17 12:59:27,265 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_new [2021-11-17 12:59:27,265 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_new [2021-11-17 12:59:27,265 INFO L130 BoogieDeclarations]: Found specification of procedure team_notify_peers [2021-11-17 12:59:27,266 INFO L138 BoogieDeclarations]: Found implementation of procedure team_notify_peers [2021-11-17 12:59:27,266 INFO L130 BoogieDeclarations]: Found specification of procedure hlist_del_rcu [2021-11-17 12:59:27,266 INFO L138 BoogieDeclarations]: Found implementation of procedure hlist_del_rcu [2021-11-17 12:59:27,266 INFO L130 BoogieDeclarations]: Found specification of procedure __team_netpoll_cleanup [2021-11-17 12:59:27,266 INFO L138 BoogieDeclarations]: Found implementation of procedure __team_netpoll_cleanup [2021-11-17 12:59:27,266 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2021-11-17 12:59:27,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2021-11-17 12:59:27,266 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-11-17 12:59:27,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-11-17 12:59:27,267 INFO L130 BoogieDeclarations]: Found specification of procedure nla_put_u8 [2021-11-17 12:59:27,267 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_put_u8 [2021-11-17 12:59:27,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-17 12:59:27,267 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2021-11-17 12:59:27,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2021-11-17 12:59:27,268 INFO L130 BoogieDeclarations]: Found specification of procedure __find_mode [2021-11-17 12:59:27,268 INFO L138 BoogieDeclarations]: Found implementation of procedure __find_mode [2021-11-17 12:59:27,268 INFO L130 BoogieDeclarations]: Found specification of procedure team_ethtool_get_drvinfo [2021-11-17 12:59:27,269 INFO L138 BoogieDeclarations]: Found implementation of procedure team_ethtool_get_drvinfo [2021-11-17 12:59:27,269 INFO L130 BoogieDeclarations]: Found specification of procedure dev_close [2021-11-17 12:59:27,269 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_close [2021-11-17 12:59:27,269 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_put [2021-11-17 12:59:27,269 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_put [2021-11-17 12:59:27,269 INFO L130 BoogieDeclarations]: Found specification of procedure team_set_rx_mode [2021-11-17 12:59:27,269 INFO L138 BoogieDeclarations]: Found implementation of procedure team_set_rx_mode [2021-11-17 12:59:27,269 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-11-17 12:59:27,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-11-17 12:59:27,270 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_lock [2021-11-17 12:59:27,270 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_lock [2021-11-17 12:59:27,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-17 12:59:27,270 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2021-11-17 12:59:27,270 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2021-11-17 12:59:27,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-17 12:59:27,270 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2021-11-17 12:59:27,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2021-11-17 12:59:27,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-17 12:59:27,271 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2021-11-17 12:59:27,271 INFO L130 BoogieDeclarations]: Found specification of procedure team_user_linkup_en_option_get [2021-11-17 12:59:27,271 INFO L138 BoogieDeclarations]: Found implementation of procedure team_user_linkup_en_option_get [2021-11-17 12:59:27,271 INFO L130 BoogieDeclarations]: Found specification of procedure team_port_en_option_set [2021-11-17 12:59:27,271 INFO L138 BoogieDeclarations]: Found implementation of procedure team_port_en_option_set [2021-11-17 12:59:27,271 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dummy_resourceless_instance_callback_0_48 [2021-11-17 12:59:27,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dummy_resourceless_instance_callback_0_48 [2021-11-17 12:59:27,271 INFO L130 BoogieDeclarations]: Found specification of procedure team_nl_cmd_options_set [2021-11-17 12:59:27,271 INFO L138 BoogieDeclarations]: Found implementation of procedure team_nl_cmd_options_set [2021-11-17 12:59:27,271 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2021-11-17 12:59:27,272 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2021-11-17 12:59:27,272 INFO L130 BoogieDeclarations]: Found specification of procedure team_queue_id_option_get [2021-11-17 12:59:27,272 INFO L138 BoogieDeclarations]: Found implementation of procedure team_queue_id_option_get [2021-11-17 12:59:27,272 INFO L130 BoogieDeclarations]: Found specification of procedure team_port_del [2021-11-17 12:59:27,272 INFO L138 BoogieDeclarations]: Found implementation of procedure team_port_del [2021-11-17 12:59:27,272 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2021-11-17 12:59:27,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2021-11-17 12:59:27,272 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_lock_of_team [2021-11-17 12:59:27,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_lock_of_team [2021-11-17 12:59:27,273 INFO L130 BoogieDeclarations]: Found specification of procedure team_mcast_rejoin [2021-11-17 12:59:27,273 INFO L138 BoogieDeclarations]: Found implementation of procedure team_mcast_rejoin [2021-11-17 12:59:27,273 INFO L130 BoogieDeclarations]: Found specification of procedure skb_tail_pointer [2021-11-17 12:59:27,273 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_tail_pointer [2021-11-17 12:59:27,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-17 12:59:27,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-17 12:59:27,273 INFO L130 BoogieDeclarations]: Found specification of procedure team_nl_cmd_noop [2021-11-17 12:59:27,273 INFO L138 BoogieDeclarations]: Found implementation of procedure team_nl_cmd_noop [2021-11-17 12:59:27,273 INFO L130 BoogieDeclarations]: Found specification of procedure team_port_set_orig_dev_addr [2021-11-17 12:59:27,273 INFO L138 BoogieDeclarations]: Found implementation of procedure team_port_set_orig_dev_addr [2021-11-17 12:59:27,274 INFO L130 BoogieDeclarations]: Found specification of procedure team_nl_fill_one_port_get [2021-11-17 12:59:27,274 INFO L138 BoogieDeclarations]: Found implementation of procedure team_nl_fill_one_port_get [2021-11-17 12:59:27,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-17 12:59:27,274 INFO L130 BoogieDeclarations]: Found specification of procedure team_options_register [2021-11-17 12:59:27,274 INFO L138 BoogieDeclarations]: Found implementation of procedure team_options_register [2021-11-17 12:59:27,274 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dummy_resourceless_instance_callback_0_11 [2021-11-17 12:59:27,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dummy_resourceless_instance_callback_0_11 [2021-11-17 12:59:27,274 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_off [2021-11-17 12:59:27,274 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_off [2021-11-17 12:59:27,274 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_trim [2021-11-17 12:59:27,318 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_trim [2021-11-17 12:59:27,318 INFO L130 BoogieDeclarations]: Found specification of procedure __team_option_inst_add_option [2021-11-17 12:59:27,318 INFO L138 BoogieDeclarations]: Found implementation of procedure __team_option_inst_add_option [2021-11-17 12:59:27,318 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_size_call_parameter [2021-11-17 12:59:27,318 INFO L130 BoogieDeclarations]: Found specification of procedure list_del_rcu [2021-11-17 12:59:27,318 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del_rcu [2021-11-17 12:59:27,318 INFO L130 BoogieDeclarations]: Found specification of procedure nla_nest_cancel [2021-11-17 12:59:27,318 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_nest_cancel [2021-11-17 12:59:27,318 INFO L130 BoogieDeclarations]: Found specification of procedure hlist_add_head_rcu [2021-11-17 12:59:27,318 INFO L138 BoogieDeclarations]: Found implementation of procedure hlist_add_head_rcu [2021-11-17 12:59:27,318 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dummy_resourceless_instance_callback_0_36 [2021-11-17 12:59:27,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dummy_resourceless_instance_callback_0_36 [2021-11-17 12:59:27,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2021-11-17 12:59:27,319 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2021-11-17 12:59:27,319 INFO L130 BoogieDeclarations]: Found specification of procedure team_nl_team_get [2021-11-17 12:59:27,319 INFO L138 BoogieDeclarations]: Found implementation of procedure team_nl_team_get [2021-11-17 12:59:27,319 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dummy_resourceless_instance_callback_0_29 [2021-11-17 12:59:27,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dummy_resourceless_instance_callback_0_29 [2021-11-17 12:59:27,319 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2021-11-17 12:59:27,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2021-11-17 12:59:27,319 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_for_read_section [2021-11-17 12:59:27,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_for_read_section [2021-11-17 12:59:27,319 INFO L130 BoogieDeclarations]: Found specification of procedure team_port_en_option_get [2021-11-17 12:59:27,319 INFO L138 BoogieDeclarations]: Found implementation of procedure team_port_en_option_get [2021-11-17 12:59:27,319 INFO L130 BoogieDeclarations]: Found specification of procedure nla_len [2021-11-17 12:59:27,319 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_len [2021-11-17 12:59:27,319 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2021-11-17 12:59:27,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2021-11-17 12:59:27,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-17 12:59:27,319 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2021-11-17 12:59:27,319 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2021-11-17 12:59:27,319 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2021-11-17 12:59:27,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2021-11-17 12:59:27,319 INFO L130 BoogieDeclarations]: Found specification of procedure team_port_enable_netpoll [2021-11-17 12:59:27,319 INFO L138 BoogieDeclarations]: Found implementation of procedure team_port_enable_netpoll [2021-11-17 12:59:27,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-17 12:59:27,320 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail_rcu [2021-11-17 12:59:27,320 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail_rcu [2021-11-17 12:59:27,320 INFO L130 BoogieDeclarations]: Found specification of procedure team_nl_cmd_options_get [2021-11-17 12:59:27,320 INFO L138 BoogieDeclarations]: Found implementation of procedure team_nl_cmd_options_get [2021-11-17 12:59:27,320 INFO L130 BoogieDeclarations]: Found specification of procedure team_user_linkup_en_option_set [2021-11-17 12:59:27,320 INFO L138 BoogieDeclarations]: Found implementation of procedure team_user_linkup_en_option_set [2021-11-17 12:59:27,320 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_module_put [2021-11-17 12:59:27,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_module_put [2021-11-17 12:59:27,320 INFO L130 BoogieDeclarations]: Found specification of procedure __team_find_option [2021-11-17 12:59:27,320 INFO L138 BoogieDeclarations]: Found implementation of procedure __team_find_option [2021-11-17 12:59:27,320 INFO L130 BoogieDeclarations]: Found specification of procedure nla_data [2021-11-17 12:59:27,320 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_data [2021-11-17 12:59:27,320 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2021-11-17 12:59:27,320 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2021-11-17 12:59:27,320 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2021-11-17 12:59:27,320 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2021-11-17 12:59:27,320 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_init_map [2021-11-17 12:59:27,320 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_init_map [2021-11-17 12:59:27,320 INFO L130 BoogieDeclarations]: Found specification of procedure team_nl_fill_one_option_get [2021-11-17 12:59:27,320 INFO L138 BoogieDeclarations]: Found implementation of procedure team_nl_fill_one_option_get [2021-11-17 12:59:27,320 INFO L130 BoogieDeclarations]: Found specification of procedure team_mcast_rejoin_interval_set [2021-11-17 12:59:27,320 INFO L138 BoogieDeclarations]: Found implementation of procedure team_mcast_rejoin_interval_set [2021-11-17 12:59:27,320 INFO L130 BoogieDeclarations]: Found specification of procedure team_is_mode_set [2021-11-17 12:59:27,320 INFO L138 BoogieDeclarations]: Found implementation of procedure team_is_mode_set [2021-11-17 12:59:27,321 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2021-11-17 12:59:27,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2021-11-17 12:59:27,321 INFO L130 BoogieDeclarations]: Found specification of procedure team_port_change_check [2021-11-17 12:59:27,321 INFO L138 BoogieDeclarations]: Found implementation of procedure team_port_change_check [2021-11-17 12:59:27,321 INFO L130 BoogieDeclarations]: Found specification of procedure list_empty [2021-11-17 12:59:27,321 INFO L138 BoogieDeclarations]: Found implementation of procedure list_empty [2021-11-17 12:59:27,321 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_netdev_rx_handler_register_149 [2021-11-17 12:59:27,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_netdev_rx_handler_register_149 [2021-11-17 12:59:27,321 INFO L130 BoogieDeclarations]: Found specification of procedure __team_compute_features [2021-11-17 12:59:27,321 INFO L138 BoogieDeclarations]: Found implementation of procedure __team_compute_features [2021-11-17 12:59:27,321 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-11-17 12:59:27,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-11-17 12:59:27,321 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2021-11-17 12:59:27,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2021-11-17 12:59:27,321 INFO L130 BoogieDeclarations]: Found specification of procedure team_port_leave [2021-11-17 12:59:27,321 INFO L138 BoogieDeclarations]: Found implementation of procedure team_port_leave [2021-11-17 12:59:27,321 INFO L130 BoogieDeclarations]: Found specification of procedure __send_and_alloc_skb [2021-11-17 12:59:27,321 INFO L138 BoogieDeclarations]: Found implementation of procedure __send_and_alloc_skb [2021-11-17 12:59:27,321 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2021-11-17 12:59:27,321 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2021-11-17 12:59:27,321 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_lock_held [2021-11-17 12:59:27,321 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_lock_held [2021-11-17 12:59:27,321 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2021-11-17 12:59:27,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2021-11-17 12:59:27,322 INFO L130 BoogieDeclarations]: Found specification of procedure genlmsg_cancel [2021-11-17 12:59:27,322 INFO L138 BoogieDeclarations]: Found implementation of procedure genlmsg_cancel [2021-11-17 12:59:27,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-17 12:59:27,322 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2021-11-17 12:59:27,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2021-11-17 12:59:27,322 INFO L130 BoogieDeclarations]: Found specification of procedure team_nl_send_options_get [2021-11-17 12:59:27,322 INFO L138 BoogieDeclarations]: Found implementation of procedure team_nl_send_options_get [2021-11-17 12:59:27,322 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_increment_features [2021-11-17 12:59:27,322 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_increment_features [2021-11-17 12:59:27,322 INFO L130 BoogieDeclarations]: Found specification of procedure team_open [2021-11-17 12:59:27,322 INFO L138 BoogieDeclarations]: Found implementation of procedure team_open [2021-11-17 12:59:27,322 INFO L130 BoogieDeclarations]: Found specification of procedure __team_option_inst_add_port [2021-11-17 12:59:27,322 INFO L138 BoogieDeclarations]: Found implementation of procedure __team_option_inst_add_port [2021-11-17 12:59:27,322 INFO L130 BoogieDeclarations]: Found specification of procedure __team_queue_override_port_add [2021-11-17 12:59:27,322 INFO L138 BoogieDeclarations]: Found implementation of procedure __team_queue_override_port_add [2021-11-17 12:59:27,322 INFO L130 BoogieDeclarations]: Found specification of procedure __team_options_change_check [2021-11-17 12:59:27,322 INFO L138 BoogieDeclarations]: Found implementation of procedure __team_options_change_check [2021-11-17 12:59:27,322 INFO L130 BoogieDeclarations]: Found specification of procedure cpumask_next [2021-11-17 12:59:27,322 INFO L138 BoogieDeclarations]: Found implementation of procedure cpumask_next [2021-11-17 12:59:27,322 INFO L130 BoogieDeclarations]: Found specification of procedure nla_put [2021-11-17 12:59:27,322 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_put [2021-11-17 12:59:27,322 INFO L130 BoogieDeclarations]: Found specification of procedure team_notify_peers_count_get [2021-11-17 12:59:27,322 INFO L138 BoogieDeclarations]: Found implementation of procedure team_notify_peers_count_get [2021-11-17 12:59:27,322 INFO L130 BoogieDeclarations]: Found specification of procedure team_validate [2021-11-17 12:59:27,323 INFO L138 BoogieDeclarations]: Found implementation of procedure team_validate [2021-11-17 12:59:27,323 INFO L130 BoogieDeclarations]: Found specification of procedure nla_put_flag [2021-11-17 12:59:27,323 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_put_flag [2021-11-17 12:59:27,323 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_past_rtnl_unlock [2021-11-17 12:59:27,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_past_rtnl_unlock [2021-11-17 12:59:27,323 INFO L130 BoogieDeclarations]: Found specification of procedure team_port_disable_netpoll [2021-11-17 12:59:27,323 INFO L138 BoogieDeclarations]: Found implementation of procedure team_port_disable_netpoll [2021-11-17 12:59:27,323 INFO L130 BoogieDeclarations]: Found specification of procedure team_port_enter [2021-11-17 12:59:27,323 INFO L138 BoogieDeclarations]: Found implementation of procedure team_port_enter [2021-11-17 12:59:27,326 INFO L130 BoogieDeclarations]: Found specification of procedure delayed_work_timer_fn [2021-11-17 12:59:27,326 INFO L130 BoogieDeclarations]: Found specification of procedure nla_put_string [2021-11-17 12:59:27,326 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_put_string [2021-11-17 12:59:27,326 INFO L130 BoogieDeclarations]: Found specification of procedure team_close [2021-11-17 12:59:27,327 INFO L138 BoogieDeclarations]: Found implementation of procedure team_close [2021-11-17 12:59:27,327 INFO L130 BoogieDeclarations]: Found specification of procedure __team_option_inst_add [2021-11-17 12:59:27,327 INFO L138 BoogieDeclarations]: Found implementation of procedure __team_option_inst_add [2021-11-17 12:59:27,327 INFO L130 BoogieDeclarations]: Found specification of procedure team_mcast_rejoin_count_get [2021-11-17 12:59:27,327 INFO L138 BoogieDeclarations]: Found implementation of procedure team_mcast_rejoin_count_get [2021-11-17 12:59:27,327 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2021-11-17 12:59:27,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2021-11-17 12:59:27,327 INFO L130 BoogieDeclarations]: Found specification of procedure team_nl_send_port_list_get [2021-11-17 12:59:27,327 INFO L138 BoogieDeclarations]: Found implementation of procedure team_nl_send_port_list_get [2021-11-17 12:59:27,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-11-17 12:59:27,327 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-11-17 12:59:27,327 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_130 [2021-11-17 12:59:27,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_130 [2021-11-17 12:59:27,327 INFO L130 BoogieDeclarations]: Found specification of procedure debug_lockdep_rcu_enabled [2021-11-17 12:59:27,327 INFO L138 BoogieDeclarations]: Found implementation of procedure debug_lockdep_rcu_enabled [2021-11-17 12:59:27,327 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-11-17 12:59:27,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-11-17 12:59:27,327 INFO L130 BoogieDeclarations]: Found specification of procedure team_nl_cmd_port_list_get [2021-11-17 12:59:27,327 INFO L138 BoogieDeclarations]: Found implementation of procedure team_nl_cmd_port_list_get [2021-11-17 12:59:27,327 INFO L130 BoogieDeclarations]: Found specification of procedure team_option_set [2021-11-17 12:59:27,327 INFO L138 BoogieDeclarations]: Found implementation of procedure team_option_set [2021-11-17 12:59:27,327 INFO L130 BoogieDeclarations]: Found specification of procedure team_netpoll_setup [2021-11-17 12:59:27,327 INFO L138 BoogieDeclarations]: Found implementation of procedure team_netpoll_setup [2021-11-17 12:59:27,327 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_rtnl_trylock [2021-11-17 12:59:27,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_rtnl_trylock [2021-11-17 12:59:27,328 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_ok [2021-11-17 12:59:27,328 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_ok [2021-11-17 12:59:27,328 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_on [2021-11-17 12:59:27,328 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_on [2021-11-17 12:59:27,328 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2021-11-17 12:59:27,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2021-11-17 12:59:27,328 INFO L130 BoogieDeclarations]: Found specification of procedure __team_queue_override_enabled_check [2021-11-17 12:59:27,328 INFO L138 BoogieDeclarations]: Found implementation of procedure __team_queue_override_enabled_check [2021-11-17 12:59:27,328 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2021-11-17 12:59:27,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2021-11-17 12:59:27,328 INFO L130 BoogieDeclarations]: Found specification of procedure team_netpoll_cleanup [2021-11-17 12:59:27,328 INFO L138 BoogieDeclarations]: Found implementation of procedure team_netpoll_cleanup [2021-11-17 12:59:27,328 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_mtu [2021-11-17 12:59:27,328 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_mtu [2021-11-17 12:59:27,328 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2021-11-17 12:59:27,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2021-11-17 12:59:27,328 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2021-11-17 12:59:27,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2021-11-17 12:59:27,328 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2021-11-17 12:59:27,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2021-11-17 12:59:27,328 INFO L130 BoogieDeclarations]: Found specification of procedure team_port_add [2021-11-17 12:59:27,328 INFO L138 BoogieDeclarations]: Found implementation of procedure team_port_add [2021-11-17 12:59:27,328 INFO L130 BoogieDeclarations]: Found specification of procedure genlmsg_unicast [2021-11-17 12:59:27,328 INFO L138 BoogieDeclarations]: Found implementation of procedure genlmsg_unicast [2021-11-17 12:59:27,328 INFO L130 BoogieDeclarations]: Found specification of procedure nla_nest_end [2021-11-17 12:59:27,328 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_nest_end [2021-11-17 12:59:27,329 INFO L130 BoogieDeclarations]: Found specification of procedure team_poll_controller [2021-11-17 12:59:27,329 INFO L138 BoogieDeclarations]: Found implementation of procedure team_poll_controller [2021-11-17 12:59:27,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-17 12:59:27,329 INFO L130 BoogieDeclarations]: Found specification of procedure __team_options_unregister [2021-11-17 12:59:27,329 INFO L138 BoogieDeclarations]: Found implementation of procedure __team_options_unregister [2021-11-17 12:59:27,329 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2021-11-17 12:59:27,329 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2021-11-17 12:59:27,329 INFO L130 BoogieDeclarations]: Found specification of procedure team_queue_id_option_set [2021-11-17 12:59:27,329 INFO L138 BoogieDeclarations]: Found implementation of procedure team_queue_id_option_set [2021-11-17 12:59:27,329 INFO L130 BoogieDeclarations]: Found specification of procedure team_refresh_port_linkup [2021-11-17 12:59:27,329 INFO L138 BoogieDeclarations]: Found implementation of procedure team_refresh_port_linkup [2021-11-17 12:59:27,329 INFO L130 BoogieDeclarations]: Found specification of procedure team_user_linkup_option_set [2021-11-17 12:59:27,329 INFO L138 BoogieDeclarations]: Found implementation of procedure team_user_linkup_option_set [2021-11-17 12:59:27,329 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dispatch_register_20_2 [2021-11-17 12:59:27,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dispatch_register_20_2 [2021-11-17 12:59:27,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-17 12:59:27,329 INFO L130 BoogieDeclarations]: Found specification of procedure __team_port_change_send [2021-11-17 12:59:27,329 INFO L138 BoogieDeclarations]: Found implementation of procedure __team_port_change_send [2021-11-17 12:59:27,329 INFO L130 BoogieDeclarations]: Found specification of procedure genlmsg_end [2021-11-17 12:59:27,329 INFO L138 BoogieDeclarations]: Found implementation of procedure genlmsg_end [2021-11-17 12:59:27,329 INFO L130 BoogieDeclarations]: Found specification of procedure team_notify_peers_interval_get [2021-11-17 12:59:27,329 INFO L138 BoogieDeclarations]: Found implementation of procedure team_notify_peers_interval_get [2021-11-17 12:59:27,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-17 12:59:27,329 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2021-11-17 12:59:27,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2021-11-17 12:59:27,329 INFO L130 BoogieDeclarations]: Found specification of procedure vlan_vid_del [2021-11-17 12:59:27,330 INFO L138 BoogieDeclarations]: Found implementation of procedure vlan_vid_del [2021-11-17 12:59:27,330 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2021-11-17 12:59:27,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2021-11-17 12:59:27,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2021-11-17 12:59:27,330 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2021-11-17 12:59:27,330 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2021-11-17 12:59:27,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2021-11-17 12:59:27,332 INFO L130 BoogieDeclarations]: Found specification of procedure team_mode_option_set [2021-11-17 12:59:27,332 INFO L138 BoogieDeclarations]: Found implementation of procedure team_mode_option_set [2021-11-17 12:59:27,332 INFO L130 BoogieDeclarations]: Found specification of procedure team_change_mode [2021-11-17 12:59:27,332 INFO L138 BoogieDeclarations]: Found implementation of procedure team_change_mode [2021-11-17 12:59:27,333 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2021-11-17 12:59:27,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2021-11-17 12:59:27,333 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_net_dummy_resourceless_instance_0 [2021-11-17 12:59:27,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_net_dummy_resourceless_instance_0 [2021-11-17 12:59:27,333 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2021-11-17 12:59:27,333 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2021-11-17 12:59:27,333 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2021-11-17 12:59:27,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2021-11-17 12:59:27,333 INFO L130 BoogieDeclarations]: Found specification of procedure team_setup [2021-11-17 12:59:27,333 INFO L138 BoogieDeclarations]: Found implementation of procedure team_setup [2021-11-17 12:59:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure team_port_index_hash [2021-11-17 12:59:27,334 INFO L138 BoogieDeclarations]: Found implementation of procedure team_port_index_hash [2021-11-17 12:59:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure genl_info_net [2021-11-17 12:59:27,334 INFO L138 BoogieDeclarations]: Found implementation of procedure genl_info_net [2021-11-17 12:59:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure team_notify_peers_fini [2021-11-17 12:59:27,334 INFO L138 BoogieDeclarations]: Found implementation of procedure team_notify_peers_fini [2021-11-17 12:59:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure is_valid_ether_addr [2021-11-17 12:59:27,334 INFO L138 BoogieDeclarations]: Found implementation of procedure is_valid_ether_addr [2021-11-17 12:59:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure __team_option_inst_del_port [2021-11-17 12:59:27,334 INFO L138 BoogieDeclarations]: Found implementation of procedure __team_option_inst_del_port [2021-11-17 12:59:27,335 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2021-11-17 12:59:27,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2021-11-17 12:59:27,337 INFO L130 BoogieDeclarations]: Found specification of procedure read_pnet [2021-11-17 12:59:27,337 INFO L138 BoogieDeclarations]: Found implementation of procedure read_pnet [2021-11-17 12:59:27,337 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2021-11-17 12:59:27,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2021-11-17 12:59:27,337 INFO L130 BoogieDeclarations]: Found specification of procedure team_port_disable [2021-11-17 12:59:27,337 INFO L138 BoogieDeclarations]: Found implementation of procedure team_port_disable [2021-11-17 12:59:27,338 INFO L130 BoogieDeclarations]: Found specification of procedure team_adjust_ops [2021-11-17 12:59:27,338 INFO L138 BoogieDeclarations]: Found implementation of procedure team_adjust_ops [2021-11-17 12:59:27,338 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_rx_handler_unregister [2021-11-17 12:59:27,338 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_rx_handler_unregister [2021-11-17 12:59:27,338 INFO L130 BoogieDeclarations]: Found specification of procedure __init_work [2021-11-17 12:59:27,338 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_work [2021-11-17 12:59:27,338 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2021-11-17 12:59:27,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2021-11-17 12:59:27,338 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_delayed_work [2021-11-17 12:59:27,338 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_delayed_work [2021-11-17 12:59:27,339 INFO L130 BoogieDeclarations]: Found specification of procedure vlan_vids_del_by_dev [2021-11-17 12:59:27,339 INFO L138 BoogieDeclarations]: Found implementation of procedure vlan_vids_del_by_dev [2021-11-17 12:59:27,339 INFO L130 BoogieDeclarations]: Found specification of procedure team_mcast_rejoin_interval_get [2021-11-17 12:59:27,339 INFO L138 BoogieDeclarations]: Found implementation of procedure team_mcast_rejoin_interval_get [2021-11-17 12:59:27,339 INFO L130 BoogieDeclarations]: Found specification of procedure arch_local_save_flags [2021-11-17 12:59:27,339 INFO L138 BoogieDeclarations]: Found implementation of procedure arch_local_save_flags [2021-11-17 12:59:27,339 INFO L130 BoogieDeclarations]: Found specification of procedure team_mcast_rejoin_fini [2021-11-17 12:59:27,339 INFO L138 BoogieDeclarations]: Found implementation of procedure team_mcast_rejoin_fini [2021-11-17 12:59:27,339 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_unregister_netdevice_notifier [2021-11-17 12:59:27,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_unregister_netdevice_notifier [2021-11-17 12:59:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure __team_options_register [2021-11-17 12:59:27,340 INFO L138 BoogieDeclarations]: Found implementation of procedure __team_options_register [2021-11-17 12:59:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure __cmpxchg_wrong_size [2021-11-17 12:59:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure team_options_change_check [2021-11-17 12:59:27,340 INFO L138 BoogieDeclarations]: Found implementation of procedure team_options_change_check [2021-11-17 12:59:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-17 12:59:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-11-17 12:59:27,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-11-17 12:59:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure cancel_delayed_work_sync [2021-11-17 12:59:27,340 INFO L138 BoogieDeclarations]: Found implementation of procedure cancel_delayed_work_sync [2021-11-17 12:59:27,341 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2021-11-17 12:59:27,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2021-11-17 12:59:27,341 INFO L130 BoogieDeclarations]: Found specification of procedure team_nl_team_put [2021-11-17 12:59:27,341 INFO L138 BoogieDeclarations]: Found implementation of procedure team_nl_team_put [2021-11-17 12:59:27,341 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2021-11-17 12:59:27,341 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2021-11-17 12:59:27,341 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdevice_notifier [2021-11-17 12:59:27,341 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdevice_notifier [2021-11-17 12:59:27,341 INFO L130 BoogieDeclarations]: Found specification of procedure team_port_set_team_dev_addr [2021-11-17 12:59:27,341 INFO L138 BoogieDeclarations]: Found implementation of procedure team_port_set_team_dev_addr [2021-11-17 12:59:27,342 INFO L130 BoogieDeclarations]: Found specification of procedure u64_stats_update_begin [2021-11-17 12:59:27,342 INFO L138 BoogieDeclarations]: Found implementation of procedure u64_stats_update_begin [2021-11-17 12:59:27,342 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_lock_of_team [2021-11-17 12:59:27,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_lock_of_team [2021-11-17 12:59:27,342 INFO L130 BoogieDeclarations]: Found specification of procedure __team_carrier_check [2021-11-17 12:59:27,342 INFO L138 BoogieDeclarations]: Found implementation of procedure __team_carrier_check [2021-11-17 12:59:27,342 INFO L130 BoogieDeclarations]: Found specification of procedure nla_nest_start [2021-11-17 12:59:27,342 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_nest_start [2021-11-17 12:59:27,342 INFO L130 BoogieDeclarations]: Found specification of procedure dev_net [2021-11-17 12:59:27,342 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_net [2021-11-17 12:59:27,343 INFO L130 BoogieDeclarations]: Found specification of procedure trace_hardirqs_off [2021-11-17 12:59:27,343 INFO L138 BoogieDeclarations]: Found implementation of procedure trace_hardirqs_off [2021-11-17 12:59:27,343 INFO L130 BoogieDeclarations]: Found specification of procedure __team_queue_override_port_del [2021-11-17 12:59:27,343 INFO L138 BoogieDeclarations]: Found implementation of procedure __team_queue_override_port_del [2021-11-17 12:59:27,343 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2021-11-17 12:59:27,343 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2021-11-17 12:59:27,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-17 12:59:27,343 INFO L130 BoogieDeclarations]: Found specification of procedure team_port_enabled [2021-11-17 12:59:27,343 INFO L138 BoogieDeclarations]: Found implementation of procedure team_port_enabled [2021-11-17 12:59:27,343 INFO L130 BoogieDeclarations]: Found specification of procedure team_upper_dev_unlink [2021-11-17 12:59:27,344 INFO L138 BoogieDeclarations]: Found implementation of procedure team_upper_dev_unlink [2021-11-17 12:59:27,344 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2021-11-17 12:59:27,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2021-11-17 12:59:27,344 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2021-11-17 12:59:27,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2021-11-17 12:59:27,344 INFO L130 BoogieDeclarations]: Found specification of procedure call_netdevice_notifiers [2021-11-17 12:59:27,344 INFO L138 BoogieDeclarations]: Found implementation of procedure call_netdevice_notifiers [2021-11-17 12:59:27,344 INFO L130 BoogieDeclarations]: Found specification of procedure dev_put [2021-11-17 12:59:27,344 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_put [2021-11-17 12:59:27,344 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2021-11-17 12:59:27,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2021-11-17 12:59:27,345 INFO L130 BoogieDeclarations]: Found specification of procedure team_mcast_rejoin_count_set [2021-11-17 12:59:27,345 INFO L138 BoogieDeclarations]: Found implementation of procedure team_mcast_rejoin_count_set [2021-11-17 12:59:27,345 INFO L130 BoogieDeclarations]: Found specification of procedure genlmsg_put [2021-11-17 12:59:27,345 INFO L138 BoogieDeclarations]: Found implementation of procedure genlmsg_put [2021-11-17 12:59:27,345 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-11-17 12:59:27,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-11-17 12:59:27,345 INFO L130 BoogieDeclarations]: Found specification of procedure __team_get_qom_list [2021-11-17 12:59:27,345 INFO L138 BoogieDeclarations]: Found implementation of procedure __team_get_qom_list [2021-11-17 12:59:27,345 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-11-17 12:59:27,346 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-11-17 12:59:27,346 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2021-11-17 12:59:27,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2021-11-17 12:59:27,346 INFO L130 BoogieDeclarations]: Found specification of procedure team_option_get [2021-11-17 12:59:27,346 INFO L138 BoogieDeclarations]: Found implementation of procedure team_option_get [2021-11-17 12:59:27,346 INFO L130 BoogieDeclarations]: Found specification of procedure __team_option_inst_del [2021-11-17 12:59:27,346 INFO L138 BoogieDeclarations]: Found implementation of procedure __team_option_inst_del [2021-11-17 12:59:27,346 INFO L130 BoogieDeclarations]: Found specification of procedure team_priority_option_set [2021-11-17 12:59:27,346 INFO L138 BoogieDeclarations]: Found implementation of procedure team_priority_option_set [2021-11-17 12:59:27,347 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_link_unregister [2021-11-17 12:59:27,347 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_link_unregister [2021-11-17 12:59:27,347 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2021-11-17 12:59:27,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2021-11-17 12:59:27,347 INFO L130 BoogieDeclarations]: Found specification of procedure __set_port_dev_addr [2021-11-17 12:59:27,347 INFO L138 BoogieDeclarations]: Found implementation of procedure __set_port_dev_addr [2021-11-17 12:59:27,348 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~~u32~0~TO~int [2021-11-17 12:59:27,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~~u32~0~TO~int [2021-11-17 12:59:27,348 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_rcu_suspicious [2021-11-17 12:59:27,348 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_rcu_suspicious [2021-11-17 12:59:27,348 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2021-11-17 12:59:27,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2021-11-17 12:59:27,349 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_free [2021-11-17 12:59:27,349 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_free [2021-11-17 12:59:27,349 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-11-17 12:59:27,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-11-17 12:59:27,349 INFO L130 BoogieDeclarations]: Found specification of procedure init_timer_key [2021-11-17 12:59:27,349 INFO L138 BoogieDeclarations]: Found implementation of procedure init_timer_key [2021-11-17 12:59:27,349 INFO L130 BoogieDeclarations]: Found specification of procedure team_port_enable [2021-11-17 12:59:27,349 INFO L138 BoogieDeclarations]: Found implementation of procedure team_port_enable [2021-11-17 12:59:27,349 INFO L130 BoogieDeclarations]: Found specification of procedure msecs_to_jiffies [2021-11-17 12:59:27,349 INFO L138 BoogieDeclarations]: Found implementation of procedure msecs_to_jiffies [2021-11-17 12:59:27,350 INFO L130 BoogieDeclarations]: Found specification of procedure team_set_no_mode [2021-11-17 12:59:27,350 INFO L138 BoogieDeclarations]: Found implementation of procedure team_set_no_mode [2021-11-17 12:59:27,350 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2021-11-17 12:59:27,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2021-11-17 12:59:27,350 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_unlock [2021-11-17 12:59:27,350 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_unlock [2021-11-17 12:59:27,350 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_netdev_rx_handler_unregister [2021-11-17 12:59:27,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_netdev_rx_handler_unregister [2021-11-17 12:59:27,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-17 12:59:27,350 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_netdev_rx_handler_register [2021-11-17 12:59:27,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_netdev_rx_handler_register [2021-11-17 12:59:27,351 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~VOID [2021-11-17 12:59:27,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~VOID [2021-11-17 12:59:27,351 INFO L130 BoogieDeclarations]: Found specification of procedure team_nl_send_event_options_get [2021-11-17 12:59:27,351 INFO L138 BoogieDeclarations]: Found implementation of procedure team_nl_send_event_options_get [2021-11-17 12:59:27,351 INFO L130 BoogieDeclarations]: Found specification of procedure team_uninit [2021-11-17 12:59:27,351 INFO L138 BoogieDeclarations]: Found implementation of procedure team_uninit [2021-11-17 12:59:27,351 INFO L130 BoogieDeclarations]: Found specification of procedure team_user_linkup_option_get [2021-11-17 12:59:27,351 INFO L138 BoogieDeclarations]: Found implementation of procedure team_user_linkup_option_get [2021-11-17 12:59:27,351 INFO L130 BoogieDeclarations]: Found specification of procedure qdisc_skb_cb [2021-11-17 12:59:27,351 INFO L138 BoogieDeclarations]: Found implementation of procedure qdisc_skb_cb [2021-11-17 12:59:28,372 INFO L236 CfgBuilder]: Building ICFG [2021-11-17 12:59:28,388 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-17 12:59:28,717 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-11-17 12:59:34,214 INFO L277 CfgBuilder]: Performing block encoding [2021-11-17 12:59:34,240 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-17 12:59:34,240 INFO L301 CfgBuilder]: Removed 16 assume(true) statements. [2021-11-17 12:59:34,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:59:34 BoogieIcfgContainer [2021-11-17 12:59:34,246 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-17 12:59:34,247 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-17 12:59:34,247 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-17 12:59:34,251 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-17 12:59:34,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:59:20" (1/3) ... [2021-11-17 12:59:34,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31a877db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:59:34, skipping insertion in model container [2021-11-17 12:59:34,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:59:26" (2/3) ... [2021-11-17 12:59:34,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31a877db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:59:34, skipping insertion in model container [2021-11-17 12:59:34,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:59:34" (3/3) ... [2021-11-17 12:59:34,254 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--net--team--team.ko.cil.i [2021-11-17 12:59:34,259 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-17 12:59:34,260 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2021-11-17 12:59:34,316 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-17 12:59:34,331 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-11-17 12:59:34,331 INFO L340 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2021-11-17 12:59:34,391 INFO L276 IsEmpty]: Start isEmpty. Operand has 3251 states, 2231 states have (on average 1.2868668758404302) internal successors, (2871), 2330 states have internal predecessors, (2871), 743 states have call successors, (743), 241 states have call predecessors, (743), 240 states have return successors, (730), 711 states have call predecessors, (730), 730 states have call successors, (730) [2021-11-17 12:59:34,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-17 12:59:34,396 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:59:34,397 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:59:34,397 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-11-17 12:59:34,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:59:34,401 INFO L85 PathProgramCache]: Analyzing trace with hash -421279904, now seen corresponding path program 1 times [2021-11-17 12:59:34,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:59:34,407 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393514443] [2021-11-17 12:59:34,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:59:34,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:59:34,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:59:34,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:59:34,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:59:34,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:59:34,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:59:34,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:59:34,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:59:34,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 12:59:34,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:59:34,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 12:59:34,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:59:34,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 12:59:34,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:59:34,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:59:34,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:59:34,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 12:59:34,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:59:35,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 12:59:35,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:59:35,033 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 12:59:35,034 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:59:35,034 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393514443] [2021-11-17 12:59:35,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393514443] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:59:35,034 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:59:35,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:59:35,036 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572141644] [2021-11-17 12:59:35,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:59:35,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:59:35,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:59:35,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:59:35,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:59:35,061 INFO L87 Difference]: Start difference. First operand has 3251 states, 2231 states have (on average 1.2868668758404302) internal successors, (2871), 2330 states have internal predecessors, (2871), 743 states have call successors, (743), 241 states have call predecessors, (743), 240 states have return successors, (730), 711 states have call predecessors, (730), 730 states have call successors, (730) Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2021-11-17 12:59:42,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:59:42,273 INFO L93 Difference]: Finished difference Result 6404 states and 8775 transitions. [2021-11-17 12:59:42,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:59:42,275 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 70 [2021-11-17 12:59:42,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:59:42,300 INFO L225 Difference]: With dead ends: 6404 [2021-11-17 12:59:42,300 INFO L226 Difference]: Without dead ends: 3152 [2021-11-17 12:59:42,317 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:59:42,320 INFO L933 BasicCegarLoop]: 3560 mSDtfsCounter, 7582 mSDsluCounter, 1775 mSDsCounter, 0 mSdLazyCounter, 3851 mSolverCounterSat, 3889 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7703 SdHoareTripleChecker+Valid, 5335 SdHoareTripleChecker+Invalid, 7740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3889 IncrementalHoareTripleChecker+Valid, 3851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2021-11-17 12:59:42,320 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7703 Valid, 5335 Invalid, 7740 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3889 Valid, 3851 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2021-11-17 12:59:42,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3152 states. [2021-11-17 12:59:42,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3152 to 3152. [2021-11-17 12:59:42,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3152 states, 2148 states have (on average 1.2425512104283054) internal successors, (2669), 2234 states have internal predecessors, (2669), 730 states have call successors, (730), 240 states have call predecessors, (730), 239 states have return successors, (728), 709 states have call predecessors, (728), 728 states have call successors, (728) [2021-11-17 12:59:42,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3152 states to 3152 states and 4127 transitions. [2021-11-17 12:59:42,533 INFO L78 Accepts]: Start accepts. Automaton has 3152 states and 4127 transitions. Word has length 70 [2021-11-17 12:59:42,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:59:42,536 INFO L470 AbstractCegarLoop]: Abstraction has 3152 states and 4127 transitions. [2021-11-17 12:59:42,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2021-11-17 12:59:42,536 INFO L276 IsEmpty]: Start isEmpty. Operand 3152 states and 4127 transitions. [2021-11-17 12:59:42,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-17 12:59:42,543 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:59:42,544 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:59:42,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-17 12:59:42,545 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-11-17 12:59:42,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:59:42,547 INFO L85 PathProgramCache]: Analyzing trace with hash 60367389, now seen corresponding path program 1 times [2021-11-17 12:59:42,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:59:42,547 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286986961] [2021-11-17 12:59:42,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:59:42,547 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:59:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:59:42,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:59:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:59:42,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:59:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:59:42,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:59:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:59:42,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 12:59:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:59:42,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 12:59:42,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:59:42,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 12:59:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:59:42,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:59:42,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:59:42,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 12:59:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:59:42,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 12:59:42,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:59:42,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 12:59:42,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:59:42,959 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 12:59:42,959 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:59:42,959 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286986961] [2021-11-17 12:59:42,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286986961] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:59:42,960 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:59:42,960 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:59:42,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712997863] [2021-11-17 12:59:42,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:59:42,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:59:42,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:59:42,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:59:42,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:59:42,962 INFO L87 Difference]: Start difference. First operand 3152 states and 4127 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (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-11-17 12:59:44,997 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:59:47,080 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:59:52,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:59:52,846 INFO L93 Difference]: Finished difference Result 3152 states and 4127 transitions. [2021-11-17 12:59:52,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:59:52,847 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (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 76 [2021-11-17 12:59:52,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:59:52,861 INFO L225 Difference]: With dead ends: 3152 [2021-11-17 12:59:52,861 INFO L226 Difference]: Without dead ends: 3150 [2021-11-17 12:59:52,862 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-11-17 12:59:52,863 INFO L933 BasicCegarLoop]: 3522 mSDtfsCounter, 7525 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 3834 mSolverCounterSat, 3862 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7643 SdHoareTripleChecker+Valid, 5246 SdHoareTripleChecker+Invalid, 7698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3862 IncrementalHoareTripleChecker+Valid, 3834 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2021-11-17 12:59:52,864 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7643 Valid, 5246 Invalid, 7698 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3862 Valid, 3834 Invalid, 2 Unknown, 0 Unchecked, 9.5s Time] [2021-11-17 12:59:52,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3150 states. [2021-11-17 12:59:52,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3150 to 3150. [2021-11-17 12:59:52,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3150 states, 2147 states have (on average 1.2421984163949698) internal successors, (2667), 2232 states have internal predecessors, (2667), 730 states have call successors, (730), 240 states have call predecessors, (730), 239 states have return successors, (728), 709 states have call predecessors, (728), 728 states have call successors, (728) [2021-11-17 12:59:52,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3150 states to 3150 states and 4125 transitions. [2021-11-17 12:59:52,948 INFO L78 Accepts]: Start accepts. Automaton has 3150 states and 4125 transitions. Word has length 76 [2021-11-17 12:59:52,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:59:52,951 INFO L470 AbstractCegarLoop]: Abstraction has 3150 states and 4125 transitions. [2021-11-17 12:59:52,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (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-11-17 12:59:52,951 INFO L276 IsEmpty]: Start isEmpty. Operand 3150 states and 4125 transitions. [2021-11-17 12:59:52,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-11-17 12:59:52,953 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:59:52,953 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:59:52,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-17 12:59:52,954 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-11-17 12:59:52,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:59:52,955 INFO L85 PathProgramCache]: Analyzing trace with hash 968027039, now seen corresponding path program 1 times [2021-11-17 12:59:52,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:59:52,955 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035948563] [2021-11-17 12:59:52,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:59:52,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:59:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:59:53,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:59:53,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:59:53,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:59:53,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:59:53,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:59:53,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:59:53,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 12:59:53,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:59:53,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 12:59:53,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:59:53,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 12:59:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:59:53,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:59:53,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:59:53,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 12:59:53,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:59:53,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 12:59:53,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:59:53,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 12:59:53,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:59:53,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 12:59:53,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:59:53,234 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 12:59:53,235 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:59:53,235 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035948563] [2021-11-17 12:59:53,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035948563] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:59:53,235 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:59:53,235 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:59:53,235 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852087309] [2021-11-17 12:59:53,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:59:53,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:59:53,236 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:59:53,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:59:53,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:59:53,237 INFO L87 Difference]: Start difference. First operand 3150 states and 4125 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (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-11-17 12:59:55,267 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:59:57,331 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:00:02,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:00:02,977 INFO L93 Difference]: Finished difference Result 3150 states and 4125 transitions. [2021-11-17 13:00:02,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:00:02,978 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (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 82 [2021-11-17 13:00:02,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:00:02,990 INFO L225 Difference]: With dead ends: 3150 [2021-11-17 13:00:02,990 INFO L226 Difference]: Without dead ends: 3148 [2021-11-17 13:00:02,993 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-11-17 13:00:02,993 INFO L933 BasicCegarLoop]: 3520 mSDtfsCounter, 7519 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 3832 mSolverCounterSat, 3862 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7636 SdHoareTripleChecker+Valid, 5244 SdHoareTripleChecker+Invalid, 7696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3862 IncrementalHoareTripleChecker+Valid, 3832 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2021-11-17 13:00:02,994 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7636 Valid, 5244 Invalid, 7696 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3862 Valid, 3832 Invalid, 2 Unknown, 0 Unchecked, 9.4s Time] [2021-11-17 13:00:03,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3148 states. [2021-11-17 13:00:03,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3148 to 3148. [2021-11-17 13:00:03,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3148 states, 2146 states have (on average 1.2418452935694315) internal successors, (2665), 2230 states have internal predecessors, (2665), 730 states have call successors, (730), 240 states have call predecessors, (730), 239 states have return successors, (728), 709 states have call predecessors, (728), 728 states have call successors, (728) [2021-11-17 13:00:03,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3148 states to 3148 states and 4123 transitions. [2021-11-17 13:00:03,092 INFO L78 Accepts]: Start accepts. Automaton has 3148 states and 4123 transitions. Word has length 82 [2021-11-17 13:00:03,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:00:03,092 INFO L470 AbstractCegarLoop]: Abstraction has 3148 states and 4123 transitions. [2021-11-17 13:00:03,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (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-11-17 13:00:03,093 INFO L276 IsEmpty]: Start isEmpty. Operand 3148 states and 4123 transitions. [2021-11-17 13:00:03,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-11-17 13:00:03,094 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:00:03,094 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:00:03,094 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-17 13:00:03,094 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-11-17 13:00:03,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:00:03,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1570637701, now seen corresponding path program 1 times [2021-11-17 13:00:03,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:00:03,095 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223459717] [2021-11-17 13:00:03,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:00:03,095 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:00:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:03,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:00:03,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:03,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:00:03,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:03,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 13:00:03,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:03,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-17 13:00:03,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:03,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:00:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:03,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:00:03,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:03,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:00:03,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:03,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-17 13:00:03,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:03,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 13:00:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:03,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:00:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:03,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:00:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:03,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:00:03,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:03,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:00:03,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:03,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:00:03,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:03,467 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2021-11-17 13:00:03,467 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:00:03,467 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223459717] [2021-11-17 13:00:03,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223459717] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:00:03,468 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:00:03,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:00:03,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377147419] [2021-11-17 13:00:03,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:00:03,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:00:03,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:00:03,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:00:03,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:00:03,470 INFO L87 Difference]: Start difference. First operand 3148 states and 4123 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-17 13:00:05,505 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:00:14,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:00:14,347 INFO L93 Difference]: Finished difference Result 6932 states and 9420 transitions. [2021-11-17 13:00:14,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 13:00:14,353 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 97 [2021-11-17 13:00:14,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:00:14,387 INFO L225 Difference]: With dead ends: 6932 [2021-11-17 13:00:14,388 INFO L226 Difference]: Without dead ends: 6930 [2021-11-17 13:00:14,393 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-11-17 13:00:14,395 INFO L933 BasicCegarLoop]: 6605 mSDtfsCounter, 5530 mSDsluCounter, 15991 mSDsCounter, 0 mSdLazyCounter, 6994 mSolverCounterSat, 2083 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6113 SdHoareTripleChecker+Valid, 22596 SdHoareTripleChecker+Invalid, 9078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2083 IncrementalHoareTripleChecker+Valid, 6994 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2021-11-17 13:00:14,396 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6113 Valid, 22596 Invalid, 9078 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2083 Valid, 6994 Invalid, 1 Unknown, 0 Unchecked, 10.3s Time] [2021-11-17 13:00:14,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6930 states. [2021-11-17 13:00:14,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6930 to 6111. [2021-11-17 13:00:14,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6111 states, 4198 states have (on average 1.2477370176274416) internal successors, (5238), 4350 states have internal predecessors, (5238), 1393 states have call successors, (1393), 469 states have call predecessors, (1393), 487 states have return successors, (1535), 1351 states have call predecessors, (1535), 1391 states have call successors, (1535) [2021-11-17 13:00:14,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6111 states to 6111 states and 8166 transitions. [2021-11-17 13:00:14,644 INFO L78 Accepts]: Start accepts. Automaton has 6111 states and 8166 transitions. Word has length 97 [2021-11-17 13:00:14,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:00:14,644 INFO L470 AbstractCegarLoop]: Abstraction has 6111 states and 8166 transitions. [2021-11-17 13:00:14,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-17 13:00:14,645 INFO L276 IsEmpty]: Start isEmpty. Operand 6111 states and 8166 transitions. [2021-11-17 13:00:14,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-17 13:00:14,650 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:00:14,650 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:00:14,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-17 13:00:14,650 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-11-17 13:00:14,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:00:14,651 INFO L85 PathProgramCache]: Analyzing trace with hash 751652485, now seen corresponding path program 1 times [2021-11-17 13:00:14,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:00:14,651 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536816017] [2021-11-17 13:00:14,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:00:14,651 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:00:14,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:14,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:00:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:14,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:00:14,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:14,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 13:00:14,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:14,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 13:00:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:14,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 13:00:14,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:14,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 13:00:14,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:14,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:00:14,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:14,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:00:14,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:14,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 13:00:14,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:14,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 13:00:14,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:14,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:00:14,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:14,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 13:00:14,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:14,922 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 13:00:14,923 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:00:14,923 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536816017] [2021-11-17 13:00:14,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536816017] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:00:14,923 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:00:14,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:00:14,923 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065657814] [2021-11-17 13:00:14,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:00:14,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:00:14,924 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:00:14,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:00:14,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:00:14,925 INFO L87 Difference]: Start difference. First operand 6111 states and 8166 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (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-11-17 13:00:16,960 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:00:19,029 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:00:24,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:00:24,800 INFO L93 Difference]: Finished difference Result 6111 states and 8166 transitions. [2021-11-17 13:00:24,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:00:24,801 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (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 88 [2021-11-17 13:00:24,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:00:24,834 INFO L225 Difference]: With dead ends: 6111 [2021-11-17 13:00:24,835 INFO L226 Difference]: Without dead ends: 6109 [2021-11-17 13:00:24,840 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-11-17 13:00:24,840 INFO L933 BasicCegarLoop]: 3518 mSDtfsCounter, 7513 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 3830 mSolverCounterSat, 3862 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7629 SdHoareTripleChecker+Valid, 5242 SdHoareTripleChecker+Invalid, 7694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3862 IncrementalHoareTripleChecker+Valid, 3830 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2021-11-17 13:00:24,841 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7629 Valid, 5242 Invalid, 7694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3862 Valid, 3830 Invalid, 2 Unknown, 0 Unchecked, 9.5s Time] [2021-11-17 13:00:24,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6109 states. [2021-11-17 13:00:25,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6109 to 6109. [2021-11-17 13:00:25,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6109 states, 4197 states have (on average 1.2473195139385276) internal successors, (5235), 4348 states have internal predecessors, (5235), 1393 states have call successors, (1393), 469 states have call predecessors, (1393), 487 states have return successors, (1535), 1351 states have call predecessors, (1535), 1391 states have call successors, (1535) [2021-11-17 13:00:25,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6109 states to 6109 states and 8163 transitions. [2021-11-17 13:00:25,158 INFO L78 Accepts]: Start accepts. Automaton has 6109 states and 8163 transitions. Word has length 88 [2021-11-17 13:00:25,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:00:25,159 INFO L470 AbstractCegarLoop]: Abstraction has 6109 states and 8163 transitions. [2021-11-17 13:00:25,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (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-11-17 13:00:25,159 INFO L276 IsEmpty]: Start isEmpty. Operand 6109 states and 8163 transitions. [2021-11-17 13:00:25,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-17 13:00:25,160 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:00:25,160 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:00:25,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-17 13:00:25,161 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-11-17 13:00:25,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:00:25,161 INFO L85 PathProgramCache]: Analyzing trace with hash -623154177, now seen corresponding path program 1 times [2021-11-17 13:00:25,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:00:25,161 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68062232] [2021-11-17 13:00:25,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:00:25,162 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:00:25,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:25,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:00:25,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:25,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:00:25,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:25,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 13:00:25,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:25,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 13:00:25,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:25,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 13:00:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:25,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 13:00:25,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:25,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:00:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:25,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:00:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:25,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 13:00:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:25,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 13:00:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:25,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:00:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:25,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 13:00:25,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:25,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 13:00:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:25,425 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 13:00:25,425 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:00:25,425 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68062232] [2021-11-17 13:00:25,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68062232] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:00:25,425 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:00:25,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:00:25,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665585936] [2021-11-17 13:00:25,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:00:25,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:00:25,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:00:25,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:00:25,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:00:25,427 INFO L87 Difference]: Start difference. First operand 6109 states and 8163 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (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-11-17 13:00:26,450 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:00:28,510 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:00:34,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:00:34,288 INFO L93 Difference]: Finished difference Result 6109 states and 8163 transitions. [2021-11-17 13:00:34,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:00:34,289 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (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 94 [2021-11-17 13:00:34,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:00:34,312 INFO L225 Difference]: With dead ends: 6109 [2021-11-17 13:00:34,313 INFO L226 Difference]: Without dead ends: 6107 [2021-11-17 13:00:34,317 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-11-17 13:00:34,317 INFO L933 BasicCegarLoop]: 3516 mSDtfsCounter, 7507 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 3829 mSolverCounterSat, 3862 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7622 SdHoareTripleChecker+Valid, 5240 SdHoareTripleChecker+Invalid, 7692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3862 IncrementalHoareTripleChecker+Valid, 3829 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2021-11-17 13:00:34,318 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7622 Valid, 5240 Invalid, 7692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3862 Valid, 3829 Invalid, 1 Unknown, 0 Unchecked, 8.5s Time] [2021-11-17 13:00:34,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6107 states. [2021-11-17 13:00:34,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6107 to 6107. [2021-11-17 13:00:34,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6107 states, 4196 states have (on average 1.2469018112488084) internal successors, (5232), 4346 states have internal predecessors, (5232), 1393 states have call successors, (1393), 469 states have call predecessors, (1393), 487 states have return successors, (1535), 1351 states have call predecessors, (1535), 1391 states have call successors, (1535) [2021-11-17 13:00:34,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6107 states to 6107 states and 8160 transitions. [2021-11-17 13:00:34,537 INFO L78 Accepts]: Start accepts. Automaton has 6107 states and 8160 transitions. Word has length 94 [2021-11-17 13:00:34,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:00:34,538 INFO L470 AbstractCegarLoop]: Abstraction has 6107 states and 8160 transitions. [2021-11-17 13:00:34,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (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-11-17 13:00:34,538 INFO L276 IsEmpty]: Start isEmpty. Operand 6107 states and 8160 transitions. [2021-11-17 13:00:34,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-17 13:00:34,540 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:00:34,540 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:00:34,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-17 13:00:34,541 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-11-17 13:00:34,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:00:34,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1442149089, now seen corresponding path program 1 times [2021-11-17 13:00:34,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:00:34,541 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356355926] [2021-11-17 13:00:34,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:00:34,542 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:00:34,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:34,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:00:34,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:34,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:00:34,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:34,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 13:00:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:34,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 13:00:34,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:34,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 13:00:34,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:34,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 13:00:34,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:34,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:00:34,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:34,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:00:34,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:34,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 13:00:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:34,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 13:00:34,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:34,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:00:34,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:34,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 13:00:34,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:34,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 13:00:34,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:34,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 13:00:34,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:34,811 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 13:00:34,811 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:00:34,811 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356355926] [2021-11-17 13:00:34,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356355926] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:00:34,811 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:00:34,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:00:34,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843319092] [2021-11-17 13:00:34,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:00:34,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:00:34,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:00:34,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:00:34,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:00:34,813 INFO L87 Difference]: Start difference. First operand 6107 states and 8160 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 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-11-17 13:00:36,845 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:00:44,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:00:44,295 INFO L93 Difference]: Finished difference Result 6107 states and 8160 transitions. [2021-11-17 13:00:44,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:00:44,296 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 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 100 [2021-11-17 13:00:44,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:00:44,326 INFO L225 Difference]: With dead ends: 6107 [2021-11-17 13:00:44,326 INFO L226 Difference]: Without dead ends: 6105 [2021-11-17 13:00:44,331 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-11-17 13:00:44,332 INFO L933 BasicCegarLoop]: 3514 mSDtfsCounter, 7501 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 3827 mSolverCounterSat, 3862 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7615 SdHoareTripleChecker+Valid, 5238 SdHoareTripleChecker+Invalid, 7690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3862 IncrementalHoareTripleChecker+Valid, 3827 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2021-11-17 13:00:44,332 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7615 Valid, 5238 Invalid, 7690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3862 Valid, 3827 Invalid, 1 Unknown, 0 Unchecked, 9.1s Time] [2021-11-17 13:00:44,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6105 states. [2021-11-17 13:00:44,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6105 to 6105. [2021-11-17 13:00:44,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6105 states, 4195 states have (on average 1.2464839094159714) internal successors, (5229), 4344 states have internal predecessors, (5229), 1393 states have call successors, (1393), 469 states have call predecessors, (1393), 487 states have return successors, (1535), 1351 states have call predecessors, (1535), 1391 states have call successors, (1535) [2021-11-17 13:00:44,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6105 states to 6105 states and 8157 transitions. [2021-11-17 13:00:44,575 INFO L78 Accepts]: Start accepts. Automaton has 6105 states and 8157 transitions. Word has length 100 [2021-11-17 13:00:44,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:00:44,576 INFO L470 AbstractCegarLoop]: Abstraction has 6105 states and 8157 transitions. [2021-11-17 13:00:44,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 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-11-17 13:00:44,576 INFO L276 IsEmpty]: Start isEmpty. Operand 6105 states and 8157 transitions. [2021-11-17 13:00:44,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-11-17 13:00:44,578 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:00:44,579 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:00:44,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-17 13:00:44,579 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-11-17 13:00:44,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:00:44,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1732215939, now seen corresponding path program 1 times [2021-11-17 13:00:44,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:00:44,580 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307956844] [2021-11-17 13:00:44,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:00:44,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:00:44,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:44,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:00:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:44,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:00:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:44,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 13:00:44,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:44,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-17 13:00:44,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:44,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:00:44,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:44,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:00:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:44,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:00:44,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:44,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-17 13:00:44,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:44,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 13:00:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:44,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:00:44,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:44,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:00:44,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:44,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:00:44,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:44,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:00:44,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:44,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:00:44,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:44,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-17 13:00:44,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:44,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:00:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:44,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-17 13:00:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:44,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:00:44,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:45,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 13:00:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:00:45,012 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2021-11-17 13:00:45,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:00:45,013 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307956844] [2021-11-17 13:00:45,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307956844] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:00:45,013 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:00:45,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 13:00:45,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102981208] [2021-11-17 13:00:45,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:00:45,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 13:00:45,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:00:45,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 13:00:45,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 13:00:45,015 INFO L87 Difference]: Start difference. First operand 6105 states and 8157 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 13:00:47,046 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:00:49,113 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:00:51,188 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:01:09,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:01:09,507 INFO L93 Difference]: Finished difference Result 8737 states and 12210 transitions. [2021-11-17 13:01:09,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-17 13:01:09,507 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 127 [2021-11-17 13:01:09,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:01:09,535 INFO L225 Difference]: With dead ends: 8737 [2021-11-17 13:01:09,535 INFO L226 Difference]: Without dead ends: 8735 [2021-11-17 13:01:09,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-11-17 13:01:09,542 INFO L933 BasicCegarLoop]: 4794 mSDtfsCounter, 11540 mSDsluCounter, 12389 mSDsCounter, 0 mSdLazyCounter, 13325 mSolverCounterSat, 6557 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12109 SdHoareTripleChecker+Valid, 17183 SdHoareTripleChecker+Invalid, 19885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6557 IncrementalHoareTripleChecker+Valid, 13325 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.6s IncrementalHoareTripleChecker+Time [2021-11-17 13:01:09,542 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12109 Valid, 17183 Invalid, 19885 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6557 Valid, 13325 Invalid, 3 Unknown, 0 Unchecked, 23.6s Time] [2021-11-17 13:01:09,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8735 states. [2021-11-17 13:01:09,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8735 to 7085. [2021-11-17 13:01:09,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7085 states, 4904 states have (on average 1.2506117455138663) internal successors, (6133), 5062 states have internal predecessors, (6133), 1631 states have call successors, (1631), 472 states have call predecessors, (1631), 520 states have return successors, (1794), 1613 states have call predecessors, (1794), 1629 states have call successors, (1794) [2021-11-17 13:01:09,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7085 states to 7085 states and 9558 transitions. [2021-11-17 13:01:09,863 INFO L78 Accepts]: Start accepts. Automaton has 7085 states and 9558 transitions. Word has length 127 [2021-11-17 13:01:09,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:01:09,863 INFO L470 AbstractCegarLoop]: Abstraction has 7085 states and 9558 transitions. [2021-11-17 13:01:09,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 13:01:09,864 INFO L276 IsEmpty]: Start isEmpty. Operand 7085 states and 9558 transitions. [2021-11-17 13:01:09,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-11-17 13:01:09,865 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:01:09,865 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:01:09,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-17 13:01:09,865 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-11-17 13:01:09,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:01:09,866 INFO L85 PathProgramCache]: Analyzing trace with hash -2008776906, now seen corresponding path program 1 times [2021-11-17 13:01:09,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:01:09,866 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507132689] [2021-11-17 13:01:09,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:01:09,866 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:01:09,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:09,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:01:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:09,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:01:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:10,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 13:01:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:10,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 13:01:10,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:10,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 13:01:10,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:10,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 13:01:10,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:10,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:01:10,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:10,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:01:10,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:10,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 13:01:10,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:10,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 13:01:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:10,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:01:10,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:10,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 13:01:10,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:10,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 13:01:10,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:10,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 13:01:10,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:10,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 13:01:10,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:10,130 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 13:01:10,131 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:01:10,131 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507132689] [2021-11-17 13:01:10,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507132689] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:01:10,131 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:01:10,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:01:10,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898423326] [2021-11-17 13:01:10,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:01:10,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:01:10,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:01:10,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:01:10,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:01:10,133 INFO L87 Difference]: Start difference. First operand 7085 states and 9558 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 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-11-17 13:01:12,166 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:01:14,240 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:01:19,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:01:19,958 INFO L93 Difference]: Finished difference Result 7085 states and 9558 transitions. [2021-11-17 13:01:19,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:01:19,959 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 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 106 [2021-11-17 13:01:19,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:01:19,980 INFO L225 Difference]: With dead ends: 7085 [2021-11-17 13:01:19,981 INFO L226 Difference]: Without dead ends: 7083 [2021-11-17 13:01:19,986 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-11-17 13:01:19,986 INFO L933 BasicCegarLoop]: 3512 mSDtfsCounter, 7495 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 3824 mSolverCounterSat, 3862 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7608 SdHoareTripleChecker+Valid, 5236 SdHoareTripleChecker+Invalid, 7688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3862 IncrementalHoareTripleChecker+Valid, 3824 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2021-11-17 13:01:19,986 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7608 Valid, 5236 Invalid, 7688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3862 Valid, 3824 Invalid, 2 Unknown, 0 Unchecked, 9.4s Time] [2021-11-17 13:01:19,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7083 states. [2021-11-17 13:01:20,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7083 to 7083. [2021-11-17 13:01:20,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7083 states, 4903 states have (on average 1.2502549459514583) internal successors, (6130), 5060 states have internal predecessors, (6130), 1631 states have call successors, (1631), 472 states have call predecessors, (1631), 520 states have return successors, (1794), 1613 states have call predecessors, (1794), 1629 states have call successors, (1794) [2021-11-17 13:01:20,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7083 states to 7083 states and 9555 transitions. [2021-11-17 13:01:20,295 INFO L78 Accepts]: Start accepts. Automaton has 7083 states and 9555 transitions. Word has length 106 [2021-11-17 13:01:20,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:01:20,296 INFO L470 AbstractCegarLoop]: Abstraction has 7083 states and 9555 transitions. [2021-11-17 13:01:20,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 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-11-17 13:01:20,296 INFO L276 IsEmpty]: Start isEmpty. Operand 7083 states and 9555 transitions. [2021-11-17 13:01:20,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-11-17 13:01:20,298 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:01:20,298 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-17 13:01:20,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-17 13:01:20,299 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-11-17 13:01:20,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:01:20,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1103970101, now seen corresponding path program 1 times [2021-11-17 13:01:20,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:01:20,300 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772619380] [2021-11-17 13:01:20,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:01:20,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:01:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:20,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:01:20,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:20,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:01:20,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:20,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 13:01:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:20,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 13:01:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:20,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 13:01:20,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:20,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 13:01:20,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:20,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:01:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:20,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:01:20,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:20,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 13:01:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:20,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-17 13:01:20,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:20,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-17 13:01:20,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:20,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:01:20,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:20,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:01:20,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:20,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:01:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:20,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-11-17 13:01:20,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:20,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 13:01:20,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:20,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-11-17 13:01:20,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:20,602 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-11-17 13:01:20,603 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:01:20,603 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772619380] [2021-11-17 13:01:20,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772619380] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:01:20,603 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:01:20,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-17 13:01:20,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589933074] [2021-11-17 13:01:20,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:01:20,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-17 13:01:20,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:01:20,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-17 13:01:20,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-17 13:01:20,605 INFO L87 Difference]: Start difference. First operand 7083 states and 9555 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (20), 5 states have call predecessors, (20), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-17 13:01:22,636 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:01:25,667 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:01:37,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:01:37,095 INFO L93 Difference]: Finished difference Result 15353 states and 21449 transitions. [2021-11-17 13:01:37,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-17 13:01:37,096 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (20), 5 states have call predecessors, (20), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 119 [2021-11-17 13:01:37,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:01:37,132 INFO L225 Difference]: With dead ends: 15353 [2021-11-17 13:01:37,132 INFO L226 Difference]: Without dead ends: 8287 [2021-11-17 13:01:37,162 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 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-11-17 13:01:37,163 INFO L933 BasicCegarLoop]: 3503 mSDtfsCounter, 10240 mSDsluCounter, 3479 mSDsCounter, 0 mSdLazyCounter, 13008 mSolverCounterSat, 6056 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10365 SdHoareTripleChecker+Valid, 6982 SdHoareTripleChecker+Invalid, 19066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6056 IncrementalHoareTripleChecker+Valid, 13008 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.7s IncrementalHoareTripleChecker+Time [2021-11-17 13:01:37,164 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10365 Valid, 6982 Invalid, 19066 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6056 Valid, 13008 Invalid, 2 Unknown, 0 Unchecked, 15.7s Time] [2021-11-17 13:01:37,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8287 states. [2021-11-17 13:01:37,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8287 to 7083. [2021-11-17 13:01:37,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7083 states, 4903 states have (on average 1.249847032429125) internal successors, (6128), 5060 states have internal predecessors, (6128), 1631 states have call successors, (1631), 472 states have call predecessors, (1631), 520 states have return successors, (1794), 1613 states have call predecessors, (1794), 1629 states have call successors, (1794) [2021-11-17 13:01:37,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7083 states to 7083 states and 9553 transitions. [2021-11-17 13:01:37,484 INFO L78 Accepts]: Start accepts. Automaton has 7083 states and 9553 transitions. Word has length 119 [2021-11-17 13:01:37,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:01:37,486 INFO L470 AbstractCegarLoop]: Abstraction has 7083 states and 9553 transitions. [2021-11-17 13:01:37,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (20), 5 states have call predecessors, (20), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-17 13:01:37,486 INFO L276 IsEmpty]: Start isEmpty. Operand 7083 states and 9553 transitions. [2021-11-17 13:01:37,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-11-17 13:01:37,488 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:01:37,488 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-17 13:01:37,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-17 13:01:37,488 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-11-17 13:01:37,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:01:37,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1103910519, now seen corresponding path program 1 times [2021-11-17 13:01:37,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:01:37,489 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691078006] [2021-11-17 13:01:37,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:01:37,490 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:01:37,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:37,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:01:37,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:37,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:01:37,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:37,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 13:01:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:37,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 13:01:37,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:37,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 13:01:37,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:37,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 13:01:37,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:37,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:01:37,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:37,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:01:37,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:37,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 13:01:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:37,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-17 13:01:37,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:37,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-17 13:01:37,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:37,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:01:37,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:37,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:01:37,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:37,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:01:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:37,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-11-17 13:01:37,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:37,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 13:01:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:37,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-11-17 13:01:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:37,741 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-11-17 13:01:37,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:01:37,741 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691078006] [2021-11-17 13:01:37,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691078006] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:01:37,742 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:01:37,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 13:01:37,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595834283] [2021-11-17 13:01:37,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:01:37,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 13:01:37,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:01:37,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 13:01:37,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 13:01:37,744 INFO L87 Difference]: Start difference. First operand 7083 states and 9553 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2021-11-17 13:01:39,319 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:01:40,479 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:01:42,553 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:01:52,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:01:52,328 INFO L93 Difference]: Finished difference Result 8287 states and 11519 transitions. [2021-11-17 13:01:52,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 13:01:52,329 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 119 [2021-11-17 13:01:52,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:01:52,353 INFO L225 Difference]: With dead ends: 8287 [2021-11-17 13:01:52,353 INFO L226 Difference]: Without dead ends: 8285 [2021-11-17 13:01:52,358 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 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-11-17 13:01:52,359 INFO L933 BasicCegarLoop]: 3505 mSDtfsCounter, 7094 mSDsluCounter, 3190 mSDsCounter, 0 mSdLazyCounter, 9016 mSolverCounterSat, 4510 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7094 SdHoareTripleChecker+Valid, 6695 SdHoareTripleChecker+Invalid, 13527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4510 IncrementalHoareTripleChecker+Valid, 9016 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2021-11-17 13:01:52,359 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7094 Valid, 6695 Invalid, 13527 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4510 Valid, 9016 Invalid, 1 Unknown, 0 Unchecked, 14.0s Time] [2021-11-17 13:01:52,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8285 states. [2021-11-17 13:01:52,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8285 to 7081. [2021-11-17 13:01:52,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7081 states, 4902 states have (on average 1.2494900040799675) internal successors, (6125), 5058 states have internal predecessors, (6125), 1631 states have call successors, (1631), 472 states have call predecessors, (1631), 520 states have return successors, (1794), 1613 states have call predecessors, (1794), 1629 states have call successors, (1794) [2021-11-17 13:01:52,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7081 states to 7081 states and 9550 transitions. [2021-11-17 13:01:52,673 INFO L78 Accepts]: Start accepts. Automaton has 7081 states and 9550 transitions. Word has length 119 [2021-11-17 13:01:52,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:01:52,674 INFO L470 AbstractCegarLoop]: Abstraction has 7081 states and 9550 transitions. [2021-11-17 13:01:52,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2021-11-17 13:01:52,675 INFO L276 IsEmpty]: Start isEmpty. Operand 7081 states and 9550 transitions. [2021-11-17 13:01:52,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-11-17 13:01:52,676 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:01:52,676 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:01:52,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-17 13:01:52,677 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-11-17 13:01:52,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:01:52,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1185347957, now seen corresponding path program 1 times [2021-11-17 13:01:52,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:01:52,678 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200805094] [2021-11-17 13:01:52,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:01:52,678 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:01:52,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:52,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:01:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:52,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:01:52,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:52,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 13:01:52,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:52,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 13:01:52,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:52,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 13:01:52,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:52,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 13:01:52,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:52,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:01:52,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:52,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:01:52,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:52,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 13:01:52,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:52,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 13:01:52,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:52,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:01:52,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:52,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 13:01:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:52,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 13:01:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:52,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 13:01:52,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:52,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 13:01:52,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:52,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 13:01:52,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:01:52,904 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 13:01:52,904 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:01:52,905 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200805094] [2021-11-17 13:01:52,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200805094] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:01:52,905 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:01:52,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:01:52,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113640433] [2021-11-17 13:01:52,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:01:52,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:01:52,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:01:52,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:01:52,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:01:52,906 INFO L87 Difference]: Start difference. First operand 7081 states and 9550 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 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-11-17 13:01:54,938 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:01:56,665 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:02:02,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:02:02,482 INFO L93 Difference]: Finished difference Result 7081 states and 9550 transitions. [2021-11-17 13:02:02,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:02:02,483 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 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 112 [2021-11-17 13:02:02,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:02:02,502 INFO L225 Difference]: With dead ends: 7081 [2021-11-17 13:02:02,502 INFO L226 Difference]: Without dead ends: 7079 [2021-11-17 13:02:02,507 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-11-17 13:02:02,510 INFO L933 BasicCegarLoop]: 3507 mSDtfsCounter, 7484 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 3816 mSolverCounterSat, 3862 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7596 SdHoareTripleChecker+Valid, 5231 SdHoareTripleChecker+Invalid, 7679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3862 IncrementalHoareTripleChecker+Valid, 3816 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2021-11-17 13:02:02,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7596 Valid, 5231 Invalid, 7679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3862 Valid, 3816 Invalid, 1 Unknown, 0 Unchecked, 9.2s Time] [2021-11-17 13:02:02,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7079 states. [2021-11-17 13:02:02,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7079 to 7079. [2021-11-17 13:02:02,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7079 states, 4901 states have (on average 1.249132830034687) internal successors, (6122), 5056 states have internal predecessors, (6122), 1631 states have call successors, (1631), 472 states have call predecessors, (1631), 520 states have return successors, (1794), 1613 states have call predecessors, (1794), 1629 states have call successors, (1794) [2021-11-17 13:02:02,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7079 states to 7079 states and 9547 transitions. [2021-11-17 13:02:02,836 INFO L78 Accepts]: Start accepts. Automaton has 7079 states and 9547 transitions. Word has length 112 [2021-11-17 13:02:02,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:02:02,836 INFO L470 AbstractCegarLoop]: Abstraction has 7079 states and 9547 transitions. [2021-11-17 13:02:02,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 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-11-17 13:02:02,836 INFO L276 IsEmpty]: Start isEmpty. Operand 7079 states and 9547 transitions. [2021-11-17 13:02:02,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-11-17 13:02:02,838 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:02:02,838 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-17 13:02:02,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-17 13:02:02,838 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_check_alloc_flagsErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-11-17 13:02:02,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:02:02,839 INFO L85 PathProgramCache]: Analyzing trace with hash -848632241, now seen corresponding path program 1 times [2021-11-17 13:02:02,839 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:02:02,839 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194600188] [2021-11-17 13:02:02,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:02:02,840 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:02:02,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:02,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:02:02,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:02,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:02:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:02,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 13:02:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:02,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 13:02:02,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:02,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 13:02:02,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:02,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 13:02:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:03,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:02:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:03,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:02:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:03,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 13:02:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:03,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-17 13:02:03,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:03,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-17 13:02:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:03,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:02:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:03,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:02:03,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:03,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:02:03,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:03,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-11-17 13:02:03,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:03,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 13:02:03,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:03,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-11-17 13:02:03,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:03,079 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-11-17 13:02:03,079 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:02:03,079 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194600188] [2021-11-17 13:02:03,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194600188] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:02:03,080 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:02:03,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:02:03,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914223313] [2021-11-17 13:02:03,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:02:03,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:02:03,080 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:02:03,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:02:03,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:02:03,081 INFO L87 Difference]: Start difference. First operand 7079 states and 9547 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-17 13:02:05,112 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:02:06,384 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:02:08,466 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:02:14,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:02:14,994 INFO L93 Difference]: Finished difference Result 15339 states and 21426 transitions. [2021-11-17 13:02:14,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:02:14,995 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 123 [2021-11-17 13:02:14,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:02:15,029 INFO L225 Difference]: With dead ends: 15339 [2021-11-17 13:02:15,029 INFO L226 Difference]: Without dead ends: 8277 [2021-11-17 13:02:15,061 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 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-11-17 13:02:15,062 INFO L933 BasicCegarLoop]: 3500 mSDtfsCounter, 10185 mSDsluCounter, 890 mSDsCounter, 0 mSdLazyCounter, 2842 mSolverCounterSat, 6046 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10310 SdHoareTripleChecker+Valid, 4390 SdHoareTripleChecker+Invalid, 8890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6046 IncrementalHoareTripleChecker+Valid, 2842 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2021-11-17 13:02:15,062 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10310 Valid, 4390 Invalid, 8890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6046 Valid, 2842 Invalid, 2 Unknown, 0 Unchecked, 11.3s Time] [2021-11-17 13:02:15,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8277 states. [2021-11-17 13:02:15,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8277 to 7073. [2021-11-17 13:02:15,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7073 states, 4896 states have (on average 1.2485702614379084) internal successors, (6113), 5050 states have internal predecessors, (6113), 1631 states have call successors, (1631), 472 states have call predecessors, (1631), 520 states have return successors, (1794), 1613 states have call predecessors, (1794), 1629 states have call successors, (1794) [2021-11-17 13:02:15,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7073 states to 7073 states and 9538 transitions. [2021-11-17 13:02:15,422 INFO L78 Accepts]: Start accepts. Automaton has 7073 states and 9538 transitions. Word has length 123 [2021-11-17 13:02:15,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:02:15,422 INFO L470 AbstractCegarLoop]: Abstraction has 7073 states and 9538 transitions. [2021-11-17 13:02:15,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-17 13:02:15,423 INFO L276 IsEmpty]: Start isEmpty. Operand 7073 states and 9538 transitions. [2021-11-17 13:02:15,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-11-17 13:02:15,424 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:02:15,424 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:02:15,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-17 13:02:15,425 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-11-17 13:02:15,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:02:15,425 INFO L85 PathProgramCache]: Analyzing trace with hash 953287352, now seen corresponding path program 1 times [2021-11-17 13:02:15,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:02:15,426 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502292719] [2021-11-17 13:02:15,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:02:15,426 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:02:15,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:15,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:02:15,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:15,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:02:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:15,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 13:02:15,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:15,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 13:02:15,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:15,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 13:02:15,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:15,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 13:02:15,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:15,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:02:15,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:15,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:02:15,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:15,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 13:02:15,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:15,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 13:02:15,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:15,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:02:15,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:15,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 13:02:15,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:15,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 13:02:15,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:15,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 13:02:15,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:15,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 13:02:15,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:15,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 13:02:15,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:15,668 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 13:02:15,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:02:15,668 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502292719] [2021-11-17 13:02:15,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502292719] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:02:15,668 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:02:15,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:02:15,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417037051] [2021-11-17 13:02:15,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:02:15,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:02:15,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:02:15,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:02:15,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:02:15,670 INFO L87 Difference]: Start difference. First operand 7073 states and 9538 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (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-11-17 13:02:22,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:02:22,502 INFO L93 Difference]: Finished difference Result 7073 states and 9538 transitions. [2021-11-17 13:02:22,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:02:22,503 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (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 114 [2021-11-17 13:02:22,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:02:22,521 INFO L225 Difference]: With dead ends: 7073 [2021-11-17 13:02:22,521 INFO L226 Difference]: Without dead ends: 7071 [2021-11-17 13:02:22,525 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-11-17 13:02:22,525 INFO L933 BasicCegarLoop]: 3500 mSDtfsCounter, 7457 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 3814 mSolverCounterSat, 3862 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7569 SdHoareTripleChecker+Valid, 5224 SdHoareTripleChecker+Invalid, 7676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3862 IncrementalHoareTripleChecker+Valid, 3814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2021-11-17 13:02:22,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7569 Valid, 5224 Invalid, 7676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3862 Valid, 3814 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2021-11-17 13:02:22,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7071 states. [2021-11-17 13:02:22,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7071 to 7071. [2021-11-17 13:02:22,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7071 states, 4895 states have (on average 1.2482124616956078) internal successors, (6110), 5048 states have internal predecessors, (6110), 1631 states have call successors, (1631), 472 states have call predecessors, (1631), 520 states have return successors, (1794), 1613 states have call predecessors, (1794), 1629 states have call successors, (1794) [2021-11-17 13:02:22,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7071 states to 7071 states and 9535 transitions. [2021-11-17 13:02:22,836 INFO L78 Accepts]: Start accepts. Automaton has 7071 states and 9535 transitions. Word has length 114 [2021-11-17 13:02:22,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:02:22,836 INFO L470 AbstractCegarLoop]: Abstraction has 7071 states and 9535 transitions. [2021-11-17 13:02:22,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (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-11-17 13:02:22,836 INFO L276 IsEmpty]: Start isEmpty. Operand 7071 states and 9535 transitions. [2021-11-17 13:02:22,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-11-17 13:02:22,838 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:02:22,838 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:02:22,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-17 13:02:22,838 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-11-17 13:02:22,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:02:22,839 INFO L85 PathProgramCache]: Analyzing trace with hash -141032601, now seen corresponding path program 1 times [2021-11-17 13:02:22,839 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:02:22,839 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735419262] [2021-11-17 13:02:22,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:02:22,839 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:02:22,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:22,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:02:22,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:22,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:02:22,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:22,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 13:02:22,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:22,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 13:02:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:22,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 13:02:22,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:22,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 13:02:22,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:22,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:02:22,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:22,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:02:23,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:23,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 13:02:23,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:23,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 13:02:23,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:23,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:02:23,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:23,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 13:02:23,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:23,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 13:02:23,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:23,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 13:02:23,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:23,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 13:02:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:23,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 13:02:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:23,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-17 13:02:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:23,079 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 13:02:23,080 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:02:23,080 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735419262] [2021-11-17 13:02:23,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735419262] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:02:23,080 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:02:23,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:02:23,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817935288] [2021-11-17 13:02:23,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:02:23,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:02:23,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:02:23,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:02:23,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:02:23,081 INFO L87 Difference]: Start difference. First operand 7071 states and 9535 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (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-11-17 13:02:26,139 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:02:38,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:02:38,600 INFO L93 Difference]: Finished difference Result 14125 states and 19316 transitions. [2021-11-17 13:02:38,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-17 13:02:38,601 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (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 120 [2021-11-17 13:02:38,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:02:38,634 INFO L225 Difference]: With dead ends: 14125 [2021-11-17 13:02:38,634 INFO L226 Difference]: Without dead ends: 14123 [2021-11-17 13:02:38,639 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-17 13:02:38,639 INFO L933 BasicCegarLoop]: 4185 mSDtfsCounter, 11303 mSDsluCounter, 3111 mSDsCounter, 0 mSdLazyCounter, 8704 mSolverCounterSat, 6341 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11410 SdHoareTripleChecker+Valid, 7296 SdHoareTripleChecker+Invalid, 15046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6341 IncrementalHoareTripleChecker+Valid, 8704 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.7s IncrementalHoareTripleChecker+Time [2021-11-17 13:02:38,639 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11410 Valid, 7296 Invalid, 15046 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6341 Valid, 8704 Invalid, 1 Unknown, 0 Unchecked, 14.7s Time] [2021-11-17 13:02:38,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14123 states. [2021-11-17 13:02:39,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14123 to 13937. [2021-11-17 13:02:39,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13937 states, 9668 states have (on average 1.2486553578816715) internal successors, (12072), 9949 states have internal predecessors, (12072), 3224 states have call successors, (3224), 923 states have call predecessors, (3224), 1020 states have return successors, (3823), 3189 states have call predecessors, (3823), 3222 states have call successors, (3823) [2021-11-17 13:02:39,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13937 states to 13937 states and 19119 transitions. [2021-11-17 13:02:39,234 INFO L78 Accepts]: Start accepts. Automaton has 13937 states and 19119 transitions. Word has length 120 [2021-11-17 13:02:39,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:02:39,235 INFO L470 AbstractCegarLoop]: Abstraction has 13937 states and 19119 transitions. [2021-11-17 13:02:39,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (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-11-17 13:02:39,235 INFO L276 IsEmpty]: Start isEmpty. Operand 13937 states and 19119 transitions. [2021-11-17 13:02:39,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-11-17 13:02:39,237 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:02:39,237 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:02:39,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-17 13:02:39,237 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-11-17 13:02:39,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:02:39,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1188750476, now seen corresponding path program 1 times [2021-11-17 13:02:39,238 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:02:39,238 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610005642] [2021-11-17 13:02:39,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:02:39,238 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:02:39,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:39,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:02:39,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:39,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:02:39,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:39,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 13:02:39,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:39,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 13:02:39,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:39,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 13:02:39,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:39,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 13:02:39,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:39,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:02:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:39,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:02:39,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:39,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 13:02:39,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:39,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 13:02:39,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:39,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:02:39,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:39,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 13:02:39,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:39,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 13:02:39,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:39,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 13:02:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:39,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 13:02:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:39,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 13:02:39,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:39,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-17 13:02:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:39,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 13:02:39,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:39,523 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 13:02:39,523 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:02:39,523 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610005642] [2021-11-17 13:02:39,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610005642] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:02:39,525 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:02:39,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:02:39,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151249739] [2021-11-17 13:02:39,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:02:39,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:02:39,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:02:39,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:02:39,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:02:39,527 INFO L87 Difference]: Start difference. First operand 13937 states and 19119 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (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-11-17 13:02:42,260 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:02:48,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:02:48,387 INFO L93 Difference]: Finished difference Result 13937 states and 19119 transitions. [2021-11-17 13:02:48,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:02:48,388 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (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 126 [2021-11-17 13:02:48,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:02:48,420 INFO L225 Difference]: With dead ends: 13937 [2021-11-17 13:02:48,420 INFO L226 Difference]: Without dead ends: 13935 [2021-11-17 13:02:48,427 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-11-17 13:02:48,427 INFO L933 BasicCegarLoop]: 3497 mSDtfsCounter, 7453 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 3812 mSolverCounterSat, 3862 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7563 SdHoareTripleChecker+Valid, 5221 SdHoareTripleChecker+Invalid, 7675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3862 IncrementalHoareTripleChecker+Valid, 3812 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2021-11-17 13:02:48,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7563 Valid, 5221 Invalid, 7675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3862 Valid, 3812 Invalid, 1 Unknown, 0 Unchecked, 8.1s Time] [2021-11-17 13:02:48,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13935 states. [2021-11-17 13:02:49,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13935 to 13935. [2021-11-17 13:02:49,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13935 states, 9667 states have (on average 1.2484741905451535) internal successors, (12069), 9947 states have internal predecessors, (12069), 3224 states have call successors, (3224), 923 states have call predecessors, (3224), 1020 states have return successors, (3823), 3189 states have call predecessors, (3823), 3222 states have call successors, (3823) [2021-11-17 13:02:49,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13935 states to 13935 states and 19116 transitions. [2021-11-17 13:02:49,083 INFO L78 Accepts]: Start accepts. Automaton has 13935 states and 19116 transitions. Word has length 126 [2021-11-17 13:02:49,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:02:49,084 INFO L470 AbstractCegarLoop]: Abstraction has 13935 states and 19116 transitions. [2021-11-17 13:02:49,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (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-11-17 13:02:49,084 INFO L276 IsEmpty]: Start isEmpty. Operand 13935 states and 19116 transitions. [2021-11-17 13:02:49,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-11-17 13:02:49,086 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:02:49,086 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:02:49,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-17 13:02:49,086 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_check_for_read_sectionErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-11-17 13:02:49,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:02:49,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1277925900, now seen corresponding path program 1 times [2021-11-17 13:02:49,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:02:49,087 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798838779] [2021-11-17 13:02:49,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:02:49,087 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:02:49,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:49,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:02:49,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:49,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:02:49,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:49,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 13:02:49,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:49,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-17 13:02:49,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:49,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:02:49,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:49,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:02:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:49,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:02:49,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:49,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-17 13:02:49,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:49,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 13:02:49,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:49,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:02:49,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:49,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:02:49,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:49,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:02:49,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:49,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:02:49,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:49,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:02:49,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:49,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-11-17 13:02:49,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:49,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-11-17 13:02:49,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:49,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:02:49,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:49,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-11-17 13:02:49,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:49,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:02:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:49,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-11-17 13:02:49,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:49,315 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-11-17 13:02:49,316 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:02:49,316 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798838779] [2021-11-17 13:02:49,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798838779] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:02:49,316 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:02:49,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-17 13:02:49,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797371238] [2021-11-17 13:02:49,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:02:49,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 13:02:49,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:02:49,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 13:02:49,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-17 13:02:49,318 INFO L87 Difference]: Start difference. First operand 13935 states and 19116 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 13:02:51,349 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:02:58,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:02:58,745 INFO L93 Difference]: Finished difference Result 32211 states and 46593 transitions. [2021-11-17 13:02:58,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-17 13:02:58,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 147 [2021-11-17 13:02:58,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:02:58,811 INFO L225 Difference]: With dead ends: 32211 [2021-11-17 13:02:58,812 INFO L226 Difference]: Without dead ends: 18293 [2021-11-17 13:02:58,866 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-17 13:02:58,867 INFO L933 BasicCegarLoop]: 3810 mSDtfsCounter, 4306 mSDsluCounter, 5248 mSDsCounter, 0 mSdLazyCounter, 4210 mSolverCounterSat, 2786 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4667 SdHoareTripleChecker+Valid, 9058 SdHoareTripleChecker+Invalid, 6997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2786 IncrementalHoareTripleChecker+Valid, 4210 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2021-11-17 13:02:58,867 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4667 Valid, 9058 Invalid, 6997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2786 Valid, 4210 Invalid, 1 Unknown, 0 Unchecked, 8.4s Time] [2021-11-17 13:02:58,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18293 states. [2021-11-17 13:02:59,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18293 to 14455. [2021-11-17 13:02:59,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14455 states, 10066 states have (on average 1.2507450824557917) internal successors, (12590), 10367 states have internal predecessors, (12590), 3301 states have call successors, (3301), 923 states have call predecessors, (3301), 1064 states have return successors, (4005), 3289 states have call predecessors, (4005), 3299 states have call successors, (4005) [2021-11-17 13:02:59,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14455 states to 14455 states and 19896 transitions. [2021-11-17 13:02:59,613 INFO L78 Accepts]: Start accepts. Automaton has 14455 states and 19896 transitions. Word has length 147 [2021-11-17 13:02:59,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:02:59,613 INFO L470 AbstractCegarLoop]: Abstraction has 14455 states and 19896 transitions. [2021-11-17 13:02:59,613 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 13:02:59,613 INFO L276 IsEmpty]: Start isEmpty. Operand 14455 states and 19896 transitions. [2021-11-17 13:02:59,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-11-17 13:02:59,615 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:02:59,616 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:02:59,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-17 13:02:59,616 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_check_for_read_sectionErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-11-17 13:02:59,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:02:59,616 INFO L85 PathProgramCache]: Analyzing trace with hash 716218806, now seen corresponding path program 1 times [2021-11-17 13:02:59,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:02:59,617 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871317951] [2021-11-17 13:02:59,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:02:59,617 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:02:59,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:59,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:02:59,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:59,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:02:59,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:59,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 13:02:59,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:59,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-17 13:02:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:59,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:02:59,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:59,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:02:59,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:59,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:02:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:59,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-17 13:02:59,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:59,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 13:02:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:59,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:02:59,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:59,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:02:59,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:59,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:02:59,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:59,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:02:59,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:02:59,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:02:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:00,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-11-17 13:03:00,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:00,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-11-17 13:03:00,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:00,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:03:00,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:00,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-11-17 13:03:00,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:00,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:03:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:00,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-11-17 13:03:00,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:00,053 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-11-17 13:03:00,054 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:03:00,054 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871317951] [2021-11-17 13:03:00,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871317951] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:03:00,054 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:03:00,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:03:00,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458450400] [2021-11-17 13:03:00,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:03:00,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:03:00,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:03:00,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:03:00,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:03:00,056 INFO L87 Difference]: Start difference. First operand 14455 states and 19896 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 13:03:02,089 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:03:10,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:03:10,430 INFO L93 Difference]: Finished difference Result 18285 states and 26529 transitions. [2021-11-17 13:03:10,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:03:10,431 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 147 [2021-11-17 13:03:10,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:03:10,490 INFO L225 Difference]: With dead ends: 18285 [2021-11-17 13:03:10,490 INFO L226 Difference]: Without dead ends: 18283 [2021-11-17 13:03:10,500 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-11-17 13:03:10,501 INFO L933 BasicCegarLoop]: 3768 mSDtfsCounter, 8573 mSDsluCounter, 5123 mSDsCounter, 0 mSdLazyCounter, 4284 mSolverCounterSat, 4731 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8923 SdHoareTripleChecker+Valid, 8891 SdHoareTripleChecker+Invalid, 9016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4731 IncrementalHoareTripleChecker+Valid, 4284 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2021-11-17 13:03:10,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8923 Valid, 8891 Invalid, 9016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4731 Valid, 4284 Invalid, 1 Unknown, 0 Unchecked, 9.5s Time] [2021-11-17 13:03:10,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18283 states. [2021-11-17 13:03:11,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18283 to 14453. [2021-11-17 13:03:11,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14453 states, 10065 states have (on average 1.2503725782414308) internal successors, (12585), 10365 states have internal predecessors, (12585), 3301 states have call successors, (3301), 923 states have call predecessors, (3301), 1064 states have return successors, (4005), 3289 states have call predecessors, (4005), 3299 states have call successors, (4005) [2021-11-17 13:03:11,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14453 states to 14453 states and 19891 transitions. [2021-11-17 13:03:11,195 INFO L78 Accepts]: Start accepts. Automaton has 14453 states and 19891 transitions. Word has length 147 [2021-11-17 13:03:11,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:03:11,195 INFO L470 AbstractCegarLoop]: Abstraction has 14453 states and 19891 transitions. [2021-11-17 13:03:11,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 13:03:11,195 INFO L276 IsEmpty]: Start isEmpty. Operand 14453 states and 19891 transitions. [2021-11-17 13:03:11,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-11-17 13:03:11,197 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:03:11,197 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:03:11,198 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-17 13:03:11,198 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-11-17 13:03:11,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:03:11,198 INFO L85 PathProgramCache]: Analyzing trace with hash 429836268, now seen corresponding path program 1 times [2021-11-17 13:03:11,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:03:11,198 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537034406] [2021-11-17 13:03:11,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:03:11,199 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:03:11,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:11,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:03:11,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:11,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:03:11,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:11,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 13:03:11,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:11,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 13:03:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:11,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 13:03:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:11,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 13:03:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:11,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:03:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:11,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:03:11,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:11,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 13:03:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:11,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 13:03:11,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:11,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:03:11,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:11,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 13:03:11,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:11,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 13:03:11,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:11,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 13:03:11,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:11,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 13:03:11,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:11,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 13:03:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:11,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-17 13:03:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:11,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 13:03:11,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:11,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-17 13:03:11,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:11,439 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 13:03:11,439 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:03:11,440 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537034406] [2021-11-17 13:03:11,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537034406] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:03:11,440 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:03:11,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:03:11,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974638474] [2021-11-17 13:03:11,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:03:11,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:03:11,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:03:11,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:03:11,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:03:11,443 INFO L87 Difference]: Start difference. First operand 14453 states and 19891 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (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-11-17 13:03:13,527 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:03:20,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:03:20,264 INFO L93 Difference]: Finished difference Result 14453 states and 19891 transitions. [2021-11-17 13:03:20,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:03:20,264 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (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 132 [2021-11-17 13:03:20,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:03:20,300 INFO L225 Difference]: With dead ends: 14453 [2021-11-17 13:03:20,300 INFO L226 Difference]: Without dead ends: 14451 [2021-11-17 13:03:20,307 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-11-17 13:03:20,307 INFO L933 BasicCegarLoop]: 3493 mSDtfsCounter, 7441 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 3808 mSolverCounterSat, 3862 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7550 SdHoareTripleChecker+Valid, 5217 SdHoareTripleChecker+Invalid, 7671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3862 IncrementalHoareTripleChecker+Valid, 3808 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2021-11-17 13:03:20,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7550 Valid, 5217 Invalid, 7671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3862 Valid, 3808 Invalid, 1 Unknown, 0 Unchecked, 8.0s Time] [2021-11-17 13:03:20,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14451 states. [2021-11-17 13:03:20,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14451 to 14451. [2021-11-17 13:03:20,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14451 states, 10064 states have (on average 1.2501987281399045) internal successors, (12582), 10363 states have internal predecessors, (12582), 3301 states have call successors, (3301), 923 states have call predecessors, (3301), 1064 states have return successors, (4005), 3289 states have call predecessors, (4005), 3299 states have call successors, (4005) [2021-11-17 13:03:20,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14451 states to 14451 states and 19888 transitions. [2021-11-17 13:03:20,956 INFO L78 Accepts]: Start accepts. Automaton has 14451 states and 19888 transitions. Word has length 132 [2021-11-17 13:03:20,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:03:20,956 INFO L470 AbstractCegarLoop]: Abstraction has 14451 states and 19888 transitions. [2021-11-17 13:03:20,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (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-11-17 13:03:20,957 INFO L276 IsEmpty]: Start isEmpty. Operand 14451 states and 19888 transitions. [2021-11-17 13:03:20,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-11-17 13:03:20,958 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:03:20,959 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:03:20,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-17 13:03:20,959 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_check_for_read_sectionErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-11-17 13:03:20,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:03:20,959 INFO L85 PathProgramCache]: Analyzing trace with hash -518218006, now seen corresponding path program 1 times [2021-11-17 13:03:20,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:03:20,959 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019256511] [2021-11-17 13:03:20,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:03:20,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:03:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:21,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:03:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:21,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:03:21,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:21,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 13:03:21,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:21,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-17 13:03:21,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:21,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:03:21,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:21,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:03:21,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:21,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:03:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:21,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-17 13:03:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:21,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 13:03:21,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:21,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:03:21,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:21,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:03:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:21,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:03:21,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:21,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:03:21,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:21,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:03:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:21,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-11-17 13:03:21,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:21,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-11-17 13:03:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:21,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:03:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:21,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-11-17 13:03:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:21,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:03:21,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:21,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-11-17 13:03:21,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:21,199 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-11-17 13:03:21,199 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:03:21,199 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019256511] [2021-11-17 13:03:21,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019256511] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:03:21,200 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:03:21,200 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:03:21,200 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261463014] [2021-11-17 13:03:21,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:03:21,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:03:21,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:03:21,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:03:21,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:03:21,201 INFO L87 Difference]: Start difference. First operand 14451 states and 19888 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 13:03:23,233 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:03:25,319 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:03:32,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:03:32,894 INFO L93 Difference]: Finished difference Result 18281 states and 26521 transitions. [2021-11-17 13:03:32,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:03:32,894 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 150 [2021-11-17 13:03:32,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:03:32,952 INFO L225 Difference]: With dead ends: 18281 [2021-11-17 13:03:32,952 INFO L226 Difference]: Without dead ends: 18279 [2021-11-17 13:03:32,965 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-11-17 13:03:32,966 INFO L933 BasicCegarLoop]: 3766 mSDtfsCounter, 8456 mSDsluCounter, 5222 mSDsCounter, 0 mSdLazyCounter, 4272 mSolverCounterSat, 4673 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8811 SdHoareTripleChecker+Valid, 8988 SdHoareTripleChecker+Invalid, 8947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4673 IncrementalHoareTripleChecker+Valid, 4272 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2021-11-17 13:03:32,966 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8811 Valid, 8988 Invalid, 8947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4673 Valid, 4272 Invalid, 2 Unknown, 0 Unchecked, 10.6s Time] [2021-11-17 13:03:32,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18279 states. [2021-11-17 13:03:33,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18279 to 14449. [2021-11-17 13:03:33,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14449 states, 10063 states have (on average 1.2498260955977343) internal successors, (12577), 10361 states have internal predecessors, (12577), 3301 states have call successors, (3301), 923 states have call predecessors, (3301), 1064 states have return successors, (4005), 3289 states have call predecessors, (4005), 3299 states have call successors, (4005) [2021-11-17 13:03:33,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14449 states to 14449 states and 19883 transitions. [2021-11-17 13:03:33,703 INFO L78 Accepts]: Start accepts. Automaton has 14449 states and 19883 transitions. Word has length 150 [2021-11-17 13:03:33,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:03:33,703 INFO L470 AbstractCegarLoop]: Abstraction has 14449 states and 19883 transitions. [2021-11-17 13:03:33,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 13:03:33,703 INFO L276 IsEmpty]: Start isEmpty. Operand 14449 states and 19883 transitions. [2021-11-17 13:03:33,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-11-17 13:03:33,705 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:03:33,705 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:03:33,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-17 13:03:33,706 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-11-17 13:03:33,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:03:33,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1677773610, now seen corresponding path program 1 times [2021-11-17 13:03:33,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:03:33,706 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101462388] [2021-11-17 13:03:33,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:03:33,707 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:03:33,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:33,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:03:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:33,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:03:33,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:33,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 13:03:33,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:33,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 13:03:33,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:33,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 13:03:33,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:33,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 13:03:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:33,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:03:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:33,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:03:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:33,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 13:03:33,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:33,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 13:03:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:33,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:03:33,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:33,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 13:03:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:33,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 13:03:33,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:33,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 13:03:33,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:33,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 13:03:33,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:33,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 13:03:33,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:33,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-17 13:03:33,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:33,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 13:03:33,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:33,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-17 13:03:33,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:33,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-11-17 13:03:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:33,965 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 13:03:33,965 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:03:33,966 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101462388] [2021-11-17 13:03:33,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101462388] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:03:33,966 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:03:33,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:03:33,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012485328] [2021-11-17 13:03:33,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:03:33,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:03:33,967 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:03:33,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:03:33,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:03:33,968 INFO L87 Difference]: Start difference. First operand 14449 states and 19883 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (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-11-17 13:03:36,003 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:03:38,093 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:03:51,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:03:51,887 INFO L93 Difference]: Finished difference Result 28109 states and 39463 transitions. [2021-11-17 13:03:51,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-17 13:03:51,888 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (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 138 [2021-11-17 13:03:51,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:03:51,969 INFO L225 Difference]: With dead ends: 28109 [2021-11-17 13:03:51,969 INFO L226 Difference]: Without dead ends: 28107 [2021-11-17 13:03:51,981 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-17 13:03:51,981 INFO L933 BasicCegarLoop]: 3718 mSDtfsCounter, 11612 mSDsluCounter, 2993 mSDsCounter, 0 mSdLazyCounter, 8299 mSolverCounterSat, 6394 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11716 SdHoareTripleChecker+Valid, 6711 SdHoareTripleChecker+Invalid, 14695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6394 IncrementalHoareTripleChecker+Valid, 8299 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.3s IncrementalHoareTripleChecker+Time [2021-11-17 13:03:51,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11716 Valid, 6711 Invalid, 14695 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6394 Valid, 8299 Invalid, 2 Unknown, 0 Unchecked, 16.3s Time] [2021-11-17 13:03:51,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28107 states. [2021-11-17 13:03:53,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28107 to 27906. [2021-11-17 13:03:53,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27906 states, 19424 states have (on average 1.2509266886326194) internal successors, (24298), 20035 states have internal predecessors, (24298), 6361 states have call successors, (6361), 1821 states have call predecessors, (6361), 2100 states have return successors, (8566), 6298 states have call predecessors, (8566), 6359 states have call successors, (8566) [2021-11-17 13:03:53,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27906 states to 27906 states and 39225 transitions. [2021-11-17 13:03:53,297 INFO L78 Accepts]: Start accepts. Automaton has 27906 states and 39225 transitions. Word has length 138 [2021-11-17 13:03:53,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:03:53,297 INFO L470 AbstractCegarLoop]: Abstraction has 27906 states and 39225 transitions. [2021-11-17 13:03:53,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (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-11-17 13:03:53,297 INFO L276 IsEmpty]: Start isEmpty. Operand 27906 states and 39225 transitions. [2021-11-17 13:03:53,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-11-17 13:03:53,299 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:03:53,299 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:03:53,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-17 13:03:53,300 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_check_for_read_sectionErr2ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-11-17 13:03:53,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:03:53,300 INFO L85 PathProgramCache]: Analyzing trace with hash -2115284030, now seen corresponding path program 1 times [2021-11-17 13:03:53,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:03:53,300 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051914918] [2021-11-17 13:03:53,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:03:53,301 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:03:53,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:53,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:03:53,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:53,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:03:53,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:53,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 13:03:53,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:53,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-17 13:03:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:53,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:03:53,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:53,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:03:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:53,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:03:53,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:53,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-17 13:03:53,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:53,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 13:03:53,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:53,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:03:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:53,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:03:53,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:53,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:03:53,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:53,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:03:53,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:53,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:03:53,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:53,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-11-17 13:03:53,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:53,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-11-17 13:03:53,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:53,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:03:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:53,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-11-17 13:03:53,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:53,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:03:53,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:53,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-11-17 13:03:53,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:03:53,786 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-11-17 13:03:53,786 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:03:53,786 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051914918] [2021-11-17 13:03:53,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051914918] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:03:53,786 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:03:53,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:03:53,787 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844038740] [2021-11-17 13:03:53,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:03:53,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:03:53,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:03:53,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:03:53,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:03:53,788 INFO L87 Difference]: Start difference. First operand 27906 states and 39225 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 13:03:55,821 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:03:57,920 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:04:13,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:04:13,243 INFO L93 Difference]: Finished difference Result 35627 states and 53097 transitions. [2021-11-17 13:04:13,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-17 13:04:13,244 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 153 [2021-11-17 13:04:13,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:04:13,371 INFO L225 Difference]: With dead ends: 35627 [2021-11-17 13:04:13,371 INFO L226 Difference]: Without dead ends: 35625 [2021-11-17 13:04:13,395 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-17 13:04:13,396 INFO L933 BasicCegarLoop]: 4266 mSDtfsCounter, 12411 mSDsluCounter, 8775 mSDsCounter, 0 mSdLazyCounter, 8698 mSolverCounterSat, 7227 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13077 SdHoareTripleChecker+Valid, 13041 SdHoareTripleChecker+Invalid, 15927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 7227 IncrementalHoareTripleChecker+Valid, 8698 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.3s IncrementalHoareTripleChecker+Time [2021-11-17 13:04:13,396 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13077 Valid, 13041 Invalid, 15927 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [7227 Valid, 8698 Invalid, 2 Unknown, 0 Unchecked, 17.3s Time] [2021-11-17 13:04:13,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35625 states. [2021-11-17 13:04:14,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35625 to 29148. [2021-11-17 13:04:14,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29148 states, 20322 states have (on average 1.2518452908178328) internal successors, (25440), 20961 states have internal predecessors, (25440), 6555 states have call successors, (6555), 1821 states have call predecessors, (6555), 2250 states have return successors, (9398), 6602 states have call predecessors, (9398), 6553 states have call successors, (9398) [2021-11-17 13:04:15,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29148 states to 29148 states and 41393 transitions. [2021-11-17 13:04:15,048 INFO L78 Accepts]: Start accepts. Automaton has 29148 states and 41393 transitions. Word has length 153 [2021-11-17 13:04:15,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:04:15,049 INFO L470 AbstractCegarLoop]: Abstraction has 29148 states and 41393 transitions. [2021-11-17 13:04:15,049 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 13:04:15,049 INFO L276 IsEmpty]: Start isEmpty. Operand 29148 states and 41393 transitions. [2021-11-17 13:04:15,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2021-11-17 13:04:15,051 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:04:15,051 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:04:15,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-17 13:04:15,052 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-11-17 13:04:15,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:04:15,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1032008721, now seen corresponding path program 1 times [2021-11-17 13:04:15,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:04:15,052 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895469420] [2021-11-17 13:04:15,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:04:15,052 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:04:15,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:15,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:04:15,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:15,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:04:15,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:15,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 13:04:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:15,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 13:04:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:15,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 13:04:15,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:15,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 13:04:15,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:15,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:04:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:15,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:04:15,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:15,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 13:04:15,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:15,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-17 13:04:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:15,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-17 13:04:15,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:15,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:04:15,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:15,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:04:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:15,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:04:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:15,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-11-17 13:04:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:15,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-11-17 13:04:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:15,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:04:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:15,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:04:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:15,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:04:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:15,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-17 13:04:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:15,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-11-17 13:04:15,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:15,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:04:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:15,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:04:15,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:15,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:04:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:15,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-11-17 13:04:15,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:15,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-11-17 13:04:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:15,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:04:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:15,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:04:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:15,449 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2021-11-17 13:04:15,449 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:04:15,449 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895469420] [2021-11-17 13:04:15,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895469420] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:04:15,449 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:04:15,449 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-17 13:04:15,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172843298] [2021-11-17 13:04:15,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:04:15,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-17 13:04:15,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:04:15,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-17 13:04:15,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-11-17 13:04:15,452 INFO L87 Difference]: Start difference. First operand 29148 states and 41393 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (26), 6 states have call predecessors, (26), 2 states have return successors, (22), 2 states have call predecessors, (22), 1 states have call successors, (22) [2021-11-17 13:04:16,548 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:04:19,532 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:04:35,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:04:35,464 INFO L93 Difference]: Finished difference Result 61181 states and 90713 transitions. [2021-11-17 13:04:35,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-17 13:04:35,465 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (26), 6 states have call predecessors, (26), 2 states have return successors, (22), 2 states have call predecessors, (22), 1 states have call successors, (22) Word has length 182 [2021-11-17 13:04:35,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:04:35,590 INFO L225 Difference]: With dead ends: 61181 [2021-11-17 13:04:35,590 INFO L226 Difference]: Without dead ends: 32050 [2021-11-17 13:04:35,727 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2021-11-17 13:04:35,727 INFO L933 BasicCegarLoop]: 3546 mSDtfsCounter, 8596 mSDsluCounter, 4383 mSDsCounter, 0 mSdLazyCounter, 12852 mSolverCounterSat, 5741 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8596 SdHoareTripleChecker+Valid, 7929 SdHoareTripleChecker+Invalid, 18594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5741 IncrementalHoareTripleChecker+Valid, 12852 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.5s IncrementalHoareTripleChecker+Time [2021-11-17 13:04:35,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8596 Valid, 7929 Invalid, 18594 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5741 Valid, 12852 Invalid, 1 Unknown, 0 Unchecked, 17.5s Time] [2021-11-17 13:04:35,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32050 states. [2021-11-17 13:04:37,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32050 to 29146. [2021-11-17 13:04:37,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29146 states, 20323 states have (on average 1.251439256015352) internal successors, (25433), 20963 states have internal predecessors, (25433), 6547 states have call successors, (6547), 1821 states have call predecessors, (6547), 2255 states have return successors, (9405), 6598 states have call predecessors, (9405), 6545 states have call successors, (9405) [2021-11-17 13:04:37,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29146 states to 29146 states and 41385 transitions. [2021-11-17 13:04:37,415 INFO L78 Accepts]: Start accepts. Automaton has 29146 states and 41385 transitions. Word has length 182 [2021-11-17 13:04:37,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:04:37,416 INFO L470 AbstractCegarLoop]: Abstraction has 29146 states and 41385 transitions. [2021-11-17 13:04:37,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (26), 6 states have call predecessors, (26), 2 states have return successors, (22), 2 states have call predecessors, (22), 1 states have call successors, (22) [2021-11-17 13:04:37,416 INFO L276 IsEmpty]: Start isEmpty. Operand 29146 states and 41385 transitions. [2021-11-17 13:04:37,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-11-17 13:04:37,418 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:04:37,418 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:04:37,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-17 13:04:37,419 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_check_for_read_sectionErr3ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-11-17 13:04:37,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:04:37,419 INFO L85 PathProgramCache]: Analyzing trace with hash -661488010, now seen corresponding path program 1 times [2021-11-17 13:04:37,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:04:37,419 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086125598] [2021-11-17 13:04:37,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:04:37,419 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:04:37,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:37,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:04:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:37,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:04:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:37,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 13:04:37,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:37,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-17 13:04:37,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:37,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:04:37,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:37,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:04:37,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:37,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:04:37,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:37,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-17 13:04:37,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:37,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 13:04:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:37,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:04:37,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:37,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:04:37,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:37,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:04:37,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:37,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:04:37,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:37,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:04:37,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:37,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-11-17 13:04:37,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:37,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-11-17 13:04:37,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:37,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:04:37,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:37,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-11-17 13:04:37,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:37,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:04:37,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:37,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-11-17 13:04:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:37,655 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-11-17 13:04:37,655 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:04:37,656 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086125598] [2021-11-17 13:04:37,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086125598] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:04:37,656 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:04:37,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:04:37,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011887674] [2021-11-17 13:04:37,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:04:37,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:04:37,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:04:37,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:04:37,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:04:37,657 INFO L87 Difference]: Start difference. First operand 29146 states and 41385 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, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 13:04:39,688 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:04:48,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:04:48,432 INFO L93 Difference]: Finished difference Result 34686 states and 51596 transitions. [2021-11-17 13:04:48,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:04:48,433 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, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 156 [2021-11-17 13:04:48,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:04:48,551 INFO L225 Difference]: With dead ends: 34686 [2021-11-17 13:04:48,551 INFO L226 Difference]: Without dead ends: 34684 [2021-11-17 13:04:48,570 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-11-17 13:04:48,571 INFO L933 BasicCegarLoop]: 3766 mSDtfsCounter, 8237 mSDsluCounter, 5208 mSDsCounter, 0 mSdLazyCounter, 4223 mSolverCounterSat, 4584 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8590 SdHoareTripleChecker+Valid, 8974 SdHoareTripleChecker+Invalid, 8808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4584 IncrementalHoareTripleChecker+Valid, 4223 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2021-11-17 13:04:48,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8590 Valid, 8974 Invalid, 8808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4584 Valid, 4223 Invalid, 1 Unknown, 0 Unchecked, 8.9s Time] [2021-11-17 13:04:48,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34684 states. [2021-11-17 13:04:50,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34684 to 29144. [2021-11-17 13:04:50,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29144 states, 20322 states have (on average 1.2510579667355575) internal successors, (25424), 20961 states have internal predecessors, (25424), 6547 states have call successors, (6547), 1821 states have call predecessors, (6547), 2255 states have return successors, (9405), 6598 states have call predecessors, (9405), 6545 states have call successors, (9405) [2021-11-17 13:04:50,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29144 states to 29144 states and 41376 transitions. [2021-11-17 13:04:50,343 INFO L78 Accepts]: Start accepts. Automaton has 29144 states and 41376 transitions. Word has length 156 [2021-11-17 13:04:50,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:04:50,344 INFO L470 AbstractCegarLoop]: Abstraction has 29144 states and 41376 transitions. [2021-11-17 13:04:50,344 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, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 13:04:50,344 INFO L276 IsEmpty]: Start isEmpty. Operand 29144 states and 41376 transitions. [2021-11-17 13:04:50,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-11-17 13:04:50,346 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:04:50,346 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:04:50,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-17 13:04:50,347 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-11-17 13:04:50,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:04:50,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1735046120, now seen corresponding path program 1 times [2021-11-17 13:04:50,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:04:50,347 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597431966] [2021-11-17 13:04:50,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:04:50,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:04:50,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:50,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:04:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:50,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:04:50,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:50,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 13:04:50,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:50,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 13:04:50,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:50,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 13:04:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:50,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 13:04:50,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:50,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:04:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:50,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:04:50,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:50,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 13:04:50,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:50,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 13:04:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:50,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:04:50,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:50,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 13:04:50,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:50,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 13:04:50,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:50,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 13:04:50,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:50,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 13:04:50,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:50,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 13:04:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:50,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-17 13:04:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:50,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 13:04:50,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:50,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-17 13:04:50,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:50,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-11-17 13:04:50,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:50,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-11-17 13:04:50,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:04:50,609 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 13:04:50,609 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:04:50,610 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597431966] [2021-11-17 13:04:50,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597431966] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:04:50,610 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:04:50,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:04:50,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205544638] [2021-11-17 13:04:50,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:04:50,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:04:50,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:04:50,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:04:50,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:04:50,611 INFO L87 Difference]: Start difference. First operand 29144 states and 41376 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (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-11-17 13:04:52,642 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:05:00,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:05:00,261 INFO L93 Difference]: Finished difference Result 29144 states and 41376 transitions. [2021-11-17 13:05:00,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:05:00,262 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (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 144 [2021-11-17 13:05:00,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:05:00,338 INFO L225 Difference]: With dead ends: 29144 [2021-11-17 13:05:00,338 INFO L226 Difference]: Without dead ends: 29142 [2021-11-17 13:05:00,347 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-11-17 13:05:00,348 INFO L933 BasicCegarLoop]: 3487 mSDtfsCounter, 7423 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 3802 mSolverCounterSat, 3862 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7530 SdHoareTripleChecker+Valid, 5211 SdHoareTripleChecker+Invalid, 7665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3862 IncrementalHoareTripleChecker+Valid, 3802 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2021-11-17 13:05:00,348 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7530 Valid, 5211 Invalid, 7665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3862 Valid, 3802 Invalid, 1 Unknown, 0 Unchecked, 8.0s Time] [2021-11-17 13:05:00,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29142 states. [2021-11-17 13:05:01,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29142 to 29142. [2021-11-17 13:05:01,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29142 states, 20321 states have (on average 1.2509719009891245) internal successors, (25421), 20959 states have internal predecessors, (25421), 6547 states have call successors, (6547), 1821 states have call predecessors, (6547), 2255 states have return successors, (9405), 6598 states have call predecessors, (9405), 6545 states have call successors, (9405) [2021-11-17 13:05:01,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29142 states to 29142 states and 41373 transitions. [2021-11-17 13:05:01,821 INFO L78 Accepts]: Start accepts. Automaton has 29142 states and 41373 transitions. Word has length 144 [2021-11-17 13:05:01,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:05:01,822 INFO L470 AbstractCegarLoop]: Abstraction has 29142 states and 41373 transitions. [2021-11-17 13:05:01,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (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-11-17 13:05:01,822 INFO L276 IsEmpty]: Start isEmpty. Operand 29142 states and 41373 transitions. [2021-11-17 13:05:01,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-11-17 13:05:01,824 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:05:01,825 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:05:01,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-17 13:05:01,825 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-11-17 13:05:01,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:05:01,825 INFO L85 PathProgramCache]: Analyzing trace with hash -2112502880, now seen corresponding path program 1 times [2021-11-17 13:05:01,825 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:05:01,825 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522867067] [2021-11-17 13:05:01,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:05:01,826 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:05:01,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:01,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:05:01,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:01,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:05:01,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:01,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 13:05:01,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:01,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 13:05:01,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:01,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 13:05:01,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:01,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 13:05:01,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:01,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:05:01,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:01,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:05:01,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:01,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 13:05:01,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:01,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 13:05:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:01,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:05:01,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:02,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 13:05:02,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:02,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 13:05:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:02,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 13:05:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:02,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 13:05:02,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:02,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 13:05:02,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:02,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-17 13:05:02,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:02,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 13:05:02,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:02,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-17 13:05:02,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:02,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-11-17 13:05:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:02,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-11-17 13:05:02,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:02,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-11-17 13:05:02,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:02,072 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 13:05:02,072 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:05:02,072 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522867067] [2021-11-17 13:05:02,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522867067] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:05:02,073 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:05:02,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:05:02,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310073063] [2021-11-17 13:05:02,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:05:02,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:05:02,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:05:02,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:05:02,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:05:02,074 INFO L87 Difference]: Start difference. First operand 29142 states and 41373 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (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-11-17 13:05:04,105 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:05:06,206 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:05:13,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:05:13,978 INFO L93 Difference]: Finished difference Result 29142 states and 41373 transitions. [2021-11-17 13:05:13,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:05:13,979 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (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 150 [2021-11-17 13:05:13,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:05:14,077 INFO L225 Difference]: With dead ends: 29142 [2021-11-17 13:05:14,078 INFO L226 Difference]: Without dead ends: 29140 [2021-11-17 13:05:14,094 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-11-17 13:05:14,094 INFO L933 BasicCegarLoop]: 3486 mSDtfsCounter, 7417 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 3798 mSolverCounterSat, 3862 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7523 SdHoareTripleChecker+Valid, 5210 SdHoareTripleChecker+Invalid, 7662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3862 IncrementalHoareTripleChecker+Valid, 3798 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2021-11-17 13:05:14,094 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7523 Valid, 5210 Invalid, 7662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3862 Valid, 3798 Invalid, 2 Unknown, 0 Unchecked, 10.1s Time] [2021-11-17 13:05:14,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29140 states. [2021-11-17 13:05:15,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29140 to 29140. [2021-11-17 13:05:15,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29140 states, 20320 states have (on average 1.2508858267716536) internal successors, (25418), 20957 states have internal predecessors, (25418), 6547 states have call successors, (6547), 1821 states have call predecessors, (6547), 2255 states have return successors, (9405), 6598 states have call predecessors, (9405), 6545 states have call successors, (9405) [2021-11-17 13:05:15,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29140 states to 29140 states and 41370 transitions. [2021-11-17 13:05:15,769 INFO L78 Accepts]: Start accepts. Automaton has 29140 states and 41370 transitions. Word has length 150 [2021-11-17 13:05:15,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:05:15,769 INFO L470 AbstractCegarLoop]: Abstraction has 29140 states and 41370 transitions. [2021-11-17 13:05:15,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (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-11-17 13:05:15,769 INFO L276 IsEmpty]: Start isEmpty. Operand 29140 states and 41370 transitions. [2021-11-17 13:05:15,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-11-17 13:05:15,771 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:05:15,771 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:05:15,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-17 13:05:15,772 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-11-17 13:05:15,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:05:15,772 INFO L85 PathProgramCache]: Analyzing trace with hash -745677881, now seen corresponding path program 1 times [2021-11-17 13:05:15,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:05:15,772 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940973174] [2021-11-17 13:05:15,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:05:15,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:05:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:15,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:05:15,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:15,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:05:15,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:15,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 13:05:15,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:15,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 13:05:15,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:15,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 13:05:15,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:15,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 13:05:15,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:15,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:05:15,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:15,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:05:15,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:15,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 13:05:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:15,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 13:05:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:15,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:05:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:15,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 13:05:15,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:15,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 13:05:15,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:15,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 13:05:15,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:15,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 13:05:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:15,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 13:05:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:15,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-17 13:05:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:15,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 13:05:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:16,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-17 13:05:16,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:16,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-11-17 13:05:16,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:16,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-11-17 13:05:16,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:16,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-11-17 13:05:16,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:16,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-11-17 13:05:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:16,038 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 13:05:16,038 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:05:16,038 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940973174] [2021-11-17 13:05:16,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940973174] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:05:16,038 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:05:16,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:05:16,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137772680] [2021-11-17 13:05:16,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:05:16,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:05:16,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:05:16,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:05:16,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:05:16,040 INFO L87 Difference]: Start difference. First operand 29140 states and 41370 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (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-11-17 13:05:18,073 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:05:20,187 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:05:27,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:05:27,445 INFO L93 Difference]: Finished difference Result 29140 states and 41370 transitions. [2021-11-17 13:05:27,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:05:27,445 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (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 156 [2021-11-17 13:05:27,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:05:27,532 INFO L225 Difference]: With dead ends: 29140 [2021-11-17 13:05:27,532 INFO L226 Difference]: Without dead ends: 29138 [2021-11-17 13:05:27,542 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-11-17 13:05:27,542 INFO L933 BasicCegarLoop]: 3484 mSDtfsCounter, 7411 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 3796 mSolverCounterSat, 3862 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7516 SdHoareTripleChecker+Valid, 5208 SdHoareTripleChecker+Invalid, 7660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3862 IncrementalHoareTripleChecker+Valid, 3796 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2021-11-17 13:05:27,543 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7516 Valid, 5208 Invalid, 7660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3862 Valid, 3796 Invalid, 2 Unknown, 0 Unchecked, 9.7s Time] [2021-11-17 13:05:27,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29138 states. [2021-11-17 13:05:29,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29138 to 29138. [2021-11-17 13:05:29,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29138 states, 20319 states have (on average 1.2507997440818939) internal successors, (25415), 20955 states have internal predecessors, (25415), 6547 states have call successors, (6547), 1821 states have call predecessors, (6547), 2255 states have return successors, (9405), 6598 states have call predecessors, (9405), 6545 states have call successors, (9405) [2021-11-17 13:05:29,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29138 states to 29138 states and 41367 transitions. [2021-11-17 13:05:29,154 INFO L78 Accepts]: Start accepts. Automaton has 29138 states and 41367 transitions. Word has length 156 [2021-11-17 13:05:29,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:05:29,154 INFO L470 AbstractCegarLoop]: Abstraction has 29138 states and 41367 transitions. [2021-11-17 13:05:29,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (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-11-17 13:05:29,154 INFO L276 IsEmpty]: Start isEmpty. Operand 29138 states and 41367 transitions. [2021-11-17 13:05:29,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2021-11-17 13:05:29,157 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:05:29,157 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:05:29,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-17 13:05:29,157 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-11-17 13:05:29,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:05:29,158 INFO L85 PathProgramCache]: Analyzing trace with hash 26792893, now seen corresponding path program 1 times [2021-11-17 13:05:29,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:05:29,158 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142028772] [2021-11-17 13:05:29,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:05:29,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:05:29,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:29,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:05:29,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:29,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:05:29,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:29,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 13:05:29,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:29,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 13:05:29,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:29,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 13:05:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:29,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 13:05:29,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:29,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:05:29,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:29,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:05:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:29,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 13:05:29,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:29,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-17 13:05:29,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:29,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-17 13:05:29,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:29,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:05:29,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:29,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:05:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:29,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:05:29,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:29,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-11-17 13:05:29,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:29,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-11-17 13:05:29,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:29,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:05:29,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:29,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:05:29,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:29,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:05:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:29,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-17 13:05:29,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:29,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-11-17 13:05:29,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:29,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:05:29,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:29,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:05:29,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:29,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-11-17 13:05:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:29,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:05:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:29,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 13:05:29,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:29,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:05:29,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:29,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-17 13:05:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:29,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:05:29,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:29,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 13:05:29,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:29,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:05:29,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:29,552 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2021-11-17 13:05:29,552 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:05:29,552 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142028772] [2021-11-17 13:05:29,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142028772] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:05:29,553 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:05:29,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-17 13:05:29,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668565725] [2021-11-17 13:05:29,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:05:29,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-17 13:05:29,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:05:29,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-17 13:05:29,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-11-17 13:05:29,555 INFO L87 Difference]: Start difference. First operand 29138 states and 41367 transitions. Second operand has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (32), 8 states have call predecessors, (32), 2 states have return successors, (28), 3 states have call predecessors, (28), 2 states have call successors, (28) [2021-11-17 13:05:31,590 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:05:33,698 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:05:35,806 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:05:56,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:05:56,639 INFO L93 Difference]: Finished difference Result 64243 states and 96111 transitions. [2021-11-17 13:05:56,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-17 13:05:56,640 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (32), 8 states have call predecessors, (32), 2 states have return successors, (28), 3 states have call predecessors, (28), 2 states have call successors, (28) Word has length 210 [2021-11-17 13:05:56,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:05:56,780 INFO L225 Difference]: With dead ends: 64243 [2021-11-17 13:05:56,780 INFO L226 Difference]: Without dead ends: 35122 [2021-11-17 13:05:56,924 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2021-11-17 13:05:56,924 INFO L933 BasicCegarLoop]: 3338 mSDtfsCounter, 9413 mSDsluCounter, 4413 mSDsCounter, 0 mSdLazyCounter, 15145 mSolverCounterSat, 6605 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9413 SdHoareTripleChecker+Valid, 7751 SdHoareTripleChecker+Invalid, 21753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6605 IncrementalHoareTripleChecker+Valid, 15145 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.0s IncrementalHoareTripleChecker+Time [2021-11-17 13:05:56,925 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9413 Valid, 7751 Invalid, 21753 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6605 Valid, 15145 Invalid, 3 Unknown, 0 Unchecked, 24.0s Time] [2021-11-17 13:05:57,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35122 states. [2021-11-17 13:05:58,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35122 to 29509. [2021-11-17 13:05:58,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29509 states, 20582 states have (on average 1.2500242930716159) internal successors, (25728), 21241 states have internal predecessors, (25728), 6573 states have call successors, (6573), 1821 states have call predecessors, (6573), 2337 states have return successors, (9690), 6683 states have call predecessors, (9690), 6571 states have call successors, (9690) [2021-11-17 13:05:58,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29509 states to 29509 states and 41991 transitions. [2021-11-17 13:05:58,945 INFO L78 Accepts]: Start accepts. Automaton has 29509 states and 41991 transitions. Word has length 210 [2021-11-17 13:05:58,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:05:58,945 INFO L470 AbstractCegarLoop]: Abstraction has 29509 states and 41991 transitions. [2021-11-17 13:05:58,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (32), 8 states have call predecessors, (32), 2 states have return successors, (28), 3 states have call predecessors, (28), 2 states have call successors, (28) [2021-11-17 13:05:58,946 INFO L276 IsEmpty]: Start isEmpty. Operand 29509 states and 41991 transitions. [2021-11-17 13:05:58,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-11-17 13:05:58,948 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:05:58,948 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:05:58,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-17 13:05:58,948 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-11-17 13:05:58,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:05:58,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1828250170, now seen corresponding path program 1 times [2021-11-17 13:05:58,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:05:58,949 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536495126] [2021-11-17 13:05:58,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:05:58,949 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:05:59,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:59,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:05:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:59,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:05:59,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:59,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 13:05:59,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:59,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 13:05:59,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:59,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 13:05:59,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:59,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 13:05:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:59,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:05:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:59,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:05:59,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:59,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 13:05:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:59,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 13:05:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:59,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:05:59,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:59,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 13:05:59,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:59,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 13:05:59,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:59,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 13:05:59,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:59,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 13:05:59,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:59,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 13:05:59,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:59,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-17 13:05:59,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:59,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 13:05:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:59,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-17 13:05:59,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:59,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-11-17 13:05:59,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:59,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-11-17 13:05:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:59,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-11-17 13:05:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:59,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-11-17 13:05:59,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:59,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-11-17 13:05:59,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:05:59,195 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 13:05:59,195 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:05:59,196 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536495126] [2021-11-17 13:05:59,196 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536495126] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:05:59,196 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:05:59,196 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:05:59,196 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026184235] [2021-11-17 13:05:59,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:05:59,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:05:59,197 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:05:59,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:05:59,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:05:59,197 INFO L87 Difference]: Start difference. First operand 29509 states and 41991 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (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-11-17 13:06:01,233 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:06:03,342 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:06:19,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:06:19,556 INFO L93 Difference]: Finished difference Result 88315 states and 136372 transitions. [2021-11-17 13:06:19,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-17 13:06:19,557 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (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 162 [2021-11-17 13:06:19,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:06:19,804 INFO L225 Difference]: With dead ends: 88315 [2021-11-17 13:06:19,804 INFO L226 Difference]: Without dead ends: 58823 [2021-11-17 13:06:19,958 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-17 13:06:19,959 INFO L933 BasicCegarLoop]: 3738 mSDtfsCounter, 11850 mSDsluCounter, 3010 mSDsCounter, 0 mSdLazyCounter, 8419 mSolverCounterSat, 6586 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11950 SdHoareTripleChecker+Valid, 6748 SdHoareTripleChecker+Invalid, 15007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6586 IncrementalHoareTripleChecker+Valid, 8419 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.0s IncrementalHoareTripleChecker+Time [2021-11-17 13:06:19,959 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11950 Valid, 6748 Invalid, 15007 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6586 Valid, 8419 Invalid, 2 Unknown, 0 Unchecked, 16.0s Time] [2021-11-17 13:06:20,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58823 states. [2021-11-17 13:06:23,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58823 to 58628. [2021-11-17 13:06:23,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58628 states, 40942 states have (on average 1.250158761174344) internal successors, (51184), 42259 states have internal predecessors, (51184), 13025 states have call successors, (13025), 3611 states have call predecessors, (13025), 4644 states have return successors, (24651), 13230 states have call predecessors, (24651), 13023 states have call successors, (24651) [2021-11-17 13:06:23,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58628 states to 58628 states and 88860 transitions. [2021-11-17 13:06:23,923 INFO L78 Accepts]: Start accepts. Automaton has 58628 states and 88860 transitions. Word has length 162 [2021-11-17 13:06:23,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:06:23,924 INFO L470 AbstractCegarLoop]: Abstraction has 58628 states and 88860 transitions. [2021-11-17 13:06:23,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (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-11-17 13:06:23,924 INFO L276 IsEmpty]: Start isEmpty. Operand 58628 states and 88860 transitions. [2021-11-17 13:06:23,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2021-11-17 13:06:23,926 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:06:23,927 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:06:23,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-17 13:06:23,927 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-11-17 13:06:23,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:06:23,927 INFO L85 PathProgramCache]: Analyzing trace with hash 2003540671, now seen corresponding path program 1 times [2021-11-17 13:06:23,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:06:23,928 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216708511] [2021-11-17 13:06:23,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:06:23,928 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:06:23,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:24,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:06:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:24,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:06:24,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:24,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 13:06:24,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:24,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 13:06:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:24,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 13:06:24,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:24,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 13:06:24,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:24,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:06:24,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:24,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:06:24,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:24,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 13:06:24,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:24,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 13:06:24,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:24,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:06:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:24,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 13:06:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:24,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 13:06:24,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:24,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 13:06:24,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:24,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 13:06:24,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:24,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 13:06:24,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:24,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-17 13:06:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:24,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 13:06:24,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:24,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-17 13:06:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:24,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-11-17 13:06:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:24,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-11-17 13:06:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:24,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-11-17 13:06:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:24,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-11-17 13:06:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:24,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-11-17 13:06:24,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:24,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2021-11-17 13:06:24,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:24,361 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 13:06:24,361 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:06:24,362 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216708511] [2021-11-17 13:06:24,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216708511] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:06:24,362 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:06:24,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:06:24,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281171518] [2021-11-17 13:06:24,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:06:24,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:06:24,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:06:24,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:06:24,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:06:24,363 INFO L87 Difference]: Start difference. First operand 58628 states and 88860 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 4 states have internal predecessors, (106), 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-11-17 13:06:27,367 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:06:37,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:06:37,373 INFO L93 Difference]: Finished difference Result 58628 states and 88860 transitions. [2021-11-17 13:06:37,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:06:37,373 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 4 states have internal predecessors, (106), 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 168 [2021-11-17 13:06:37,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:06:37,612 INFO L225 Difference]: With dead ends: 58628 [2021-11-17 13:06:37,612 INFO L226 Difference]: Without dead ends: 58626 [2021-11-17 13:06:37,652 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-11-17 13:06:37,652 INFO L933 BasicCegarLoop]: 3482 mSDtfsCounter, 7405 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 3795 mSolverCounterSat, 3862 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7508 SdHoareTripleChecker+Valid, 5206 SdHoareTripleChecker+Invalid, 7658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3862 IncrementalHoareTripleChecker+Valid, 3795 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2021-11-17 13:06:37,653 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7508 Valid, 5206 Invalid, 7658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3862 Valid, 3795 Invalid, 1 Unknown, 0 Unchecked, 9.5s Time] [2021-11-17 13:06:37,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58626 states. [2021-11-17 13:06:41,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58626 to 58626. [2021-11-17 13:06:41,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58626 states, 40941 states have (on average 1.2501160206150315) internal successors, (51181), 42257 states have internal predecessors, (51181), 13025 states have call successors, (13025), 3611 states have call predecessors, (13025), 4644 states have return successors, (24651), 13230 states have call predecessors, (24651), 13023 states have call successors, (24651) [2021-11-17 13:06:41,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58626 states to 58626 states and 88857 transitions. [2021-11-17 13:06:41,901 INFO L78 Accepts]: Start accepts. Automaton has 58626 states and 88857 transitions. Word has length 168 [2021-11-17 13:06:41,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:06:41,902 INFO L470 AbstractCegarLoop]: Abstraction has 58626 states and 88857 transitions. [2021-11-17 13:06:41,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 4 states have internal predecessors, (106), 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-11-17 13:06:41,902 INFO L276 IsEmpty]: Start isEmpty. Operand 58626 states and 88857 transitions. [2021-11-17 13:06:41,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-11-17 13:06:41,905 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:06:41,905 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:06:41,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-17 13:06:41,905 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-11-17 13:06:41,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:06:41,905 INFO L85 PathProgramCache]: Analyzing trace with hash 37012823, now seen corresponding path program 1 times [2021-11-17 13:06:41,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:06:41,905 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908666449] [2021-11-17 13:06:41,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:06:41,906 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:06:41,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:42,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:06:42,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:42,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:06:42,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:42,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 13:06:42,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:42,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 13:06:42,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:42,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 13:06:42,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:42,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 13:06:42,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:42,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:06:42,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:42,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:06:42,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:42,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 13:06:42,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:42,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 13:06:42,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:42,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:06:42,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:42,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 13:06:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:42,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 13:06:42,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:42,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 13:06:42,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:42,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 13:06:42,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:42,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 13:06:42,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:42,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-17 13:06:42,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:42,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 13:06:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:42,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-17 13:06:42,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:42,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-11-17 13:06:42,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:42,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-11-17 13:06:42,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:42,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-11-17 13:06:42,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:42,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-11-17 13:06:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:42,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-11-17 13:06:42,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:42,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2021-11-17 13:06:42,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:42,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2021-11-17 13:06:42,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:06:42,190 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 13:06:42,190 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:06:42,190 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908666449] [2021-11-17 13:06:42,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908666449] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:06:42,190 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:06:42,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:06:42,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548770097] [2021-11-17 13:06:42,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:06:42,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:06:42,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:06:42,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:06:42,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:06:42,192 INFO L87 Difference]: Start difference. First operand 58626 states and 88857 transitions. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2021-11-17 13:06:44,227 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:06:46,348 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:06:56,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:06:56,734 INFO L93 Difference]: Finished difference Result 58626 states and 88857 transitions. [2021-11-17 13:06:56,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:06:56,734 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 174 [2021-11-17 13:06:56,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:06:56,964 INFO L225 Difference]: With dead ends: 58626 [2021-11-17 13:06:56,965 INFO L226 Difference]: Without dead ends: 58624 [2021-11-17 13:06:56,991 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 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-11-17 13:06:56,992 INFO L933 BasicCegarLoop]: 3480 mSDtfsCounter, 7399 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 3792 mSolverCounterSat, 3862 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7501 SdHoareTripleChecker+Valid, 5204 SdHoareTripleChecker+Invalid, 7656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3862 IncrementalHoareTripleChecker+Valid, 3792 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2021-11-17 13:06:56,992 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7501 Valid, 5204 Invalid, 7656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3862 Valid, 3792 Invalid, 2 Unknown, 0 Unchecked, 10.8s Time] [2021-11-17 13:06:57,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58624 states. [2021-11-17 13:07:00,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58624 to 58624. [2021-11-17 13:07:00,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58624 states, 40940 states have (on average 1.2500732779677577) internal successors, (51178), 42255 states have internal predecessors, (51178), 13025 states have call successors, (13025), 3611 states have call predecessors, (13025), 4644 states have return successors, (24651), 13230 states have call predecessors, (24651), 13023 states have call successors, (24651) [2021-11-17 13:07:01,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58624 states to 58624 states and 88854 transitions. [2021-11-17 13:07:01,255 INFO L78 Accepts]: Start accepts. Automaton has 58624 states and 88854 transitions. Word has length 174 [2021-11-17 13:07:01,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:07:01,256 INFO L470 AbstractCegarLoop]: Abstraction has 58624 states and 88854 transitions. [2021-11-17 13:07:01,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2021-11-17 13:07:01,256 INFO L276 IsEmpty]: Start isEmpty. Operand 58624 states and 88854 transitions. [2021-11-17 13:07:01,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-11-17 13:07:01,259 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:07:01,259 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:07:01,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-17 13:07:01,259 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-11-17 13:07:01,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:07:01,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1835253873, now seen corresponding path program 1 times [2021-11-17 13:07:01,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:07:01,260 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881138429] [2021-11-17 13:07:01,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:07:01,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:07:01,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:01,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:07:01,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:01,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:07:01,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:01,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 13:07:01,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:01,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 13:07:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:01,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 13:07:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:01,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 13:07:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:01,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:07:01,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:01,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:07:01,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:01,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 13:07:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:01,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 13:07:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:01,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:07:01,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:01,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 13:07:01,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:01,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 13:07:01,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:01,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 13:07:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:01,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 13:07:01,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:01,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 13:07:01,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:01,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-17 13:07:01,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:01,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 13:07:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:01,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-17 13:07:01,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:01,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-11-17 13:07:01,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:01,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-11-17 13:07:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:01,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-11-17 13:07:01,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:01,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-11-17 13:07:01,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:01,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-11-17 13:07:01,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:01,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2021-11-17 13:07:01,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:01,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2021-11-17 13:07:01,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:01,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2021-11-17 13:07:01,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:01,557 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 13:07:01,558 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:07:01,558 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881138429] [2021-11-17 13:07:01,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881138429] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:07:01,558 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:07:01,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:07:01,558 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306180802] [2021-11-17 13:07:01,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:07:01,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:07:01,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:07:01,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:07:01,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:07:01,559 INFO L87 Difference]: Start difference. First operand 58624 states and 88854 transitions. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2021-11-17 13:07:03,591 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:07:05,695 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:07:16,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:07:16,143 INFO L93 Difference]: Finished difference Result 58624 states and 88854 transitions. [2021-11-17 13:07:16,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:07:16,144 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 180 [2021-11-17 13:07:16,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:07:16,403 INFO L225 Difference]: With dead ends: 58624 [2021-11-17 13:07:16,403 INFO L226 Difference]: Without dead ends: 58622 [2021-11-17 13:07:16,441 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 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-11-17 13:07:16,442 INFO L933 BasicCegarLoop]: 3478 mSDtfsCounter, 7393 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 3790 mSolverCounterSat, 3862 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7494 SdHoareTripleChecker+Valid, 5202 SdHoareTripleChecker+Invalid, 7654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3862 IncrementalHoareTripleChecker+Valid, 3790 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2021-11-17 13:07:16,442 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7494 Valid, 5202 Invalid, 7654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3862 Valid, 3790 Invalid, 2 Unknown, 0 Unchecked, 10.6s Time] [2021-11-17 13:07:16,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58622 states. [2021-11-17 13:07:20,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58622 to 58622. [2021-11-17 13:07:20,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58622 states, 40939 states have (on average 1.25003053323237) internal successors, (51175), 42253 states have internal predecessors, (51175), 13025 states have call successors, (13025), 3611 states have call predecessors, (13025), 4644 states have return successors, (24651), 13230 states have call predecessors, (24651), 13023 states have call successors, (24651) [2021-11-17 13:07:20,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58622 states to 58622 states and 88851 transitions. [2021-11-17 13:07:20,749 INFO L78 Accepts]: Start accepts. Automaton has 58622 states and 88851 transitions. Word has length 180 [2021-11-17 13:07:20,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:07:20,750 INFO L470 AbstractCegarLoop]: Abstraction has 58622 states and 88851 transitions. [2021-11-17 13:07:20,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2021-11-17 13:07:20,750 INFO L276 IsEmpty]: Start isEmpty. Operand 58622 states and 88851 transitions. [2021-11-17 13:07:20,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2021-11-17 13:07:20,754 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:07:20,754 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:07:20,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-17 13:07:20,754 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ldv_linux_usb_urb_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-11-17 13:07:20,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:07:20,754 INFO L85 PathProgramCache]: Analyzing trace with hash 557156352, now seen corresponding path program 1 times [2021-11-17 13:07:20,754 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:07:20,754 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531375296] [2021-11-17 13:07:20,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:07:20,755 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:07:20,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:20,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:07:20,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:20,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:07:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:20,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 13:07:20,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:20,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 13:07:20,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:20,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 13:07:20,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:20,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 13:07:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:20,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:07:20,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:20,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:07:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:20,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 13:07:20,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:20,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 13:07:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:20,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:07:20,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:20,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 13:07:20,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:20,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 13:07:20,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:20,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 13:07:20,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:20,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 13:07:20,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:20,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 13:07:20,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:20,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-17 13:07:20,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:20,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 13:07:20,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:20,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-17 13:07:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:21,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-11-17 13:07:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:21,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-11-17 13:07:21,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:21,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-11-17 13:07:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:21,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-11-17 13:07:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:21,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-11-17 13:07:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:21,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2021-11-17 13:07:21,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:21,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2021-11-17 13:07:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:21,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2021-11-17 13:07:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:21,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2021-11-17 13:07:21,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:21,068 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 13:07:21,068 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:07:21,068 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531375296] [2021-11-17 13:07:21,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531375296] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:07:21,068 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:07:21,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:07:21,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279405550] [2021-11-17 13:07:21,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:07:21,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:07:21,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:07:21,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:07:21,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:07:21,070 INFO L87 Difference]: Start difference. First operand 58622 states and 88851 transitions. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2021-11-17 13:07:23,102 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:07:25,200 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:07:35,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:07:35,747 INFO L93 Difference]: Finished difference Result 58622 states and 88851 transitions. [2021-11-17 13:07:35,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:07:35,748 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 186 [2021-11-17 13:07:35,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:07:35,997 INFO L225 Difference]: With dead ends: 58622 [2021-11-17 13:07:35,997 INFO L226 Difference]: Without dead ends: 58039 [2021-11-17 13:07:36,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 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-11-17 13:07:36,047 INFO L933 BasicCegarLoop]: 3477 mSDtfsCounter, 7384 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 3790 mSolverCounterSat, 3862 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7484 SdHoareTripleChecker+Valid, 5201 SdHoareTripleChecker+Invalid, 7654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3862 IncrementalHoareTripleChecker+Valid, 3790 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2021-11-17 13:07:36,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7484 Valid, 5201 Invalid, 7654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3862 Valid, 3790 Invalid, 2 Unknown, 0 Unchecked, 10.9s Time] [2021-11-17 13:07:36,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58039 states. [2021-11-17 13:07:39,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58039 to 58030. [2021-11-17 13:07:39,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58030 states, 40526 states have (on average 1.251542219809505) internal successors, (50720), 41832 states have internal predecessors, (50720), 12894 states have call successors, (12894), 3566 states have call predecessors, (12894), 4597 states have return successors, (24516), 13102 states have call predecessors, (24516), 12888 states have call successors, (24516) [2021-11-17 13:07:40,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58030 states to 58030 states and 88130 transitions. [2021-11-17 13:07:40,225 INFO L78 Accepts]: Start accepts. Automaton has 58030 states and 88130 transitions. Word has length 186 [2021-11-17 13:07:40,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:07:40,226 INFO L470 AbstractCegarLoop]: Abstraction has 58030 states and 88130 transitions. [2021-11-17 13:07:40,226 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2021-11-17 13:07:40,226 INFO L276 IsEmpty]: Start isEmpty. Operand 58030 states and 88130 transitions. [2021-11-17 13:07:40,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2021-11-17 13:07:40,229 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:07:40,230 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-17 13:07:40,230 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-17 13:07:40,230 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-11-17 13:07:40,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:07:40,230 INFO L85 PathProgramCache]: Analyzing trace with hash -73087090, now seen corresponding path program 1 times [2021-11-17 13:07:40,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:07:40,231 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782437253] [2021-11-17 13:07:40,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:07:40,231 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:07:40,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:40,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:07:40,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:40,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:07:40,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:40,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 13:07:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:40,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 13:07:40,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:40,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 13:07:40,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:40,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 13:07:40,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:40,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:07:40,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:40,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:07:40,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:40,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 13:07:40,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:40,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-17 13:07:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:40,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-17 13:07:40,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:40,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:07:40,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:40,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:07:40,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:40,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:07:40,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:40,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-11-17 13:07:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:40,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-11-17 13:07:40,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:40,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:07:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:40,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:07:40,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:40,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:07:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:40,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-17 13:07:40,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:40,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-11-17 13:07:40,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:40,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:07:40,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:40,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:07:40,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:40,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:07:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:40,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-11-17 13:07:40,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:40,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-11-17 13:07:40,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:40,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:07:40,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:40,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:07:40,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:40,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:07:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:40,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2021-11-17 13:07:40,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:40,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2021-11-17 13:07:40,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:40,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:07:40,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:40,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:07:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:40,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2021-11-17 13:07:40,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:40,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:07:40,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:40,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-17 13:07:40,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:40,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 13:07:40,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:40,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:07:40,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:40,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-17 13:07:40,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:40,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:07:40,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:40,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 13:07:40,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:40,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:07:40,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:07:40,656 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2021-11-17 13:07:40,656 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:07:40,657 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782437253] [2021-11-17 13:07:40,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782437253] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:07:40,657 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:07:40,657 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-17 13:07:40,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254117404] [2021-11-17 13:07:40,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:07:40,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-17 13:07:40,658 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:07:40,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-17 13:07:40,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-17 13:07:40,658 INFO L87 Difference]: Start difference. First operand 58030 states and 88130 transitions. Second operand has 10 states, 10 states have (on average 11.8) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (37), 7 states have call predecessors, (37), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) [2021-11-17 13:07:43,703 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:07:45,094 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:07:47,198 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:07:56,109 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:08:12,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:08:12,445 INFO L93 Difference]: Finished difference Result 126549 states and 208561 transitions. [2021-11-17 13:08:12,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-17 13:08:12,446 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.8) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (37), 7 states have call predecessors, (37), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) Word has length 271 [2021-11-17 13:08:12,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:08:12,792 INFO L225 Difference]: With dead ends: 126549 [2021-11-17 13:08:12,792 INFO L226 Difference]: Without dead ends: 68536 [2021-11-17 13:08:13,193 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2021-11-17 13:08:13,194 INFO L933 BasicCegarLoop]: 3282 mSDtfsCounter, 8806 mSDsluCounter, 4631 mSDsCounter, 0 mSdLazyCounter, 15769 mSolverCounterSat, 6236 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8806 SdHoareTripleChecker+Valid, 7913 SdHoareTripleChecker+Invalid, 22007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6236 IncrementalHoareTripleChecker+Valid, 15769 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.2s IncrementalHoareTripleChecker+Time [2021-11-17 13:08:13,194 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8806 Valid, 7913 Invalid, 22007 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6236 Valid, 15769 Invalid, 2 Unknown, 0 Unchecked, 25.2s Time] [2021-11-17 13:08:13,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68536 states. [2021-11-17 13:08:17,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68536 to 60128. [2021-11-17 13:08:17,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60128 states, 42078 states have (on average 1.2512001520984837) internal successors, (52648), 43448 states have internal predecessors, (52648), 13134 states have call successors, (13134), 3566 states have call predecessors, (13134), 4903 states have return successors, (26050), 13596 states have call predecessors, (26050), 13128 states have call successors, (26050) [2021-11-17 13:08:18,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60128 states to 60128 states and 91832 transitions. [2021-11-17 13:08:18,340 INFO L78 Accepts]: Start accepts. Automaton has 60128 states and 91832 transitions. Word has length 271 [2021-11-17 13:08:18,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:08:18,341 INFO L470 AbstractCegarLoop]: Abstraction has 60128 states and 91832 transitions. [2021-11-17 13:08:18,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.8) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (37), 7 states have call predecessors, (37), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) [2021-11-17 13:08:18,341 INFO L276 IsEmpty]: Start isEmpty. Operand 60128 states and 91832 transitions. [2021-11-17 13:08:18,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2021-11-17 13:08:18,345 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:08:18,345 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:08:18,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-17 13:08:18,345 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-11-17 13:08:18,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:08:18,346 INFO L85 PathProgramCache]: Analyzing trace with hash -2115133105, now seen corresponding path program 1 times [2021-11-17 13:08:18,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:08:18,346 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076474999] [2021-11-17 13:08:18,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:08:18,346 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:08:18,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:18,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:08:18,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:18,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:08:18,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:18,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 13:08:18,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:18,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 13:08:18,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:18,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 13:08:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:18,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 13:08:18,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:18,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:08:18,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:18,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:08:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:18,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 13:08:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:18,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-17 13:08:18,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:18,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-17 13:08:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:18,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:08:18,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:18,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:08:18,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:18,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:08:18,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:18,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-11-17 13:08:18,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:18,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-11-17 13:08:18,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:18,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:08:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:18,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:08:18,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:18,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:08:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:18,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-17 13:08:18,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:18,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-11-17 13:08:18,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:18,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:08:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:18,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:08:18,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:18,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:08:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:18,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-11-17 13:08:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:18,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-11-17 13:08:18,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:18,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:08:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:18,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:08:18,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:18,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:08:18,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:18,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-17 13:08:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:18,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:08:18,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:18,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-17 13:08:18,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:18,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:08:18,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:18,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 13:08:18,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:18,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 13:08:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:18,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:08:18,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:18,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2021-11-17 13:08:18,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:18,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2021-11-17 13:08:18,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:18,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:08:18,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:18,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-11-17 13:08:18,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:18,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:08:18,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:18,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2021-11-17 13:08:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:18,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:08:18,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:18,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2021-11-17 13:08:18,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:18,727 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2021-11-17 13:08:18,727 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:08:18,727 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076474999] [2021-11-17 13:08:18,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076474999] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:08:18,727 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:08:18,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-17 13:08:18,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899115034] [2021-11-17 13:08:18,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:08:18,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-17 13:08:18,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:08:18,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-17 13:08:18,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-11-17 13:08:18,728 INFO L87 Difference]: Start difference. First operand 60128 states and 91832 transitions. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (38), 8 states have call predecessors, (38), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2021-11-17 13:08:20,760 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:08:22,873 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:08:24,020 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:08:48,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:08:48,124 INFO L93 Difference]: Finished difference Result 133111 states and 224559 transitions. [2021-11-17 13:08:48,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-17 13:08:48,125 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (38), 8 states have call predecessors, (38), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 273 [2021-11-17 13:08:48,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:08:48,649 INFO L225 Difference]: With dead ends: 133111 [2021-11-17 13:08:48,649 INFO L226 Difference]: Without dead ends: 73000 [2021-11-17 13:08:48,994 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2021-11-17 13:08:48,994 INFO L933 BasicCegarLoop]: 3330 mSDtfsCounter, 10961 mSDsluCounter, 2345 mSDsCounter, 0 mSdLazyCounter, 11965 mSolverCounterSat, 7962 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10961 SdHoareTripleChecker+Valid, 5675 SdHoareTripleChecker+Invalid, 19929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 7962 IncrementalHoareTripleChecker+Valid, 11965 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.2s IncrementalHoareTripleChecker+Time [2021-11-17 13:08:48,995 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10961 Valid, 5675 Invalid, 19929 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [7962 Valid, 11965 Invalid, 2 Unknown, 0 Unchecked, 22.2s Time] [2021-11-17 13:08:49,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73000 states. [2021-11-17 13:08:53,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73000 to 60272. [2021-11-17 13:08:53,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60272 states, 42198 states have (on average 1.2508649699037868) internal successors, (52784), 43560 states have internal predecessors, (52784), 13150 states have call successors, (13150), 3566 states have call predecessors, (13150), 4911 states have return successors, (26082), 13622 states have call predecessors, (26082), 13144 states have call successors, (26082) [2021-11-17 13:08:53,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60272 states to 60272 states and 92016 transitions. [2021-11-17 13:08:54,147 INFO L78 Accepts]: Start accepts. Automaton has 60272 states and 92016 transitions. Word has length 273 [2021-11-17 13:08:54,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:08:54,148 INFO L470 AbstractCegarLoop]: Abstraction has 60272 states and 92016 transitions. [2021-11-17 13:08:54,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (38), 8 states have call predecessors, (38), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2021-11-17 13:08:54,148 INFO L276 IsEmpty]: Start isEmpty. Operand 60272 states and 92016 transitions. [2021-11-17 13:08:54,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2021-11-17 13:08:54,152 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:08:54,152 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:08:54,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-17 13:08:54,153 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-11-17 13:08:54,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:08:54,153 INFO L85 PathProgramCache]: Analyzing trace with hash 761826233, now seen corresponding path program 1 times [2021-11-17 13:08:54,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:08:54,153 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257046624] [2021-11-17 13:08:54,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:08:54,155 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:08:54,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:08:54,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:08:54,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 13:08:54,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 13:08:54,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 13:08:54,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 13:08:54,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:08:54,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:08:54,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 13:08:54,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-17 13:08:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-17 13:08:54,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:08:54,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:08:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:08:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-11-17 13:08:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-11-17 13:08:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:08:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:08:54,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:08:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-17 13:08:54,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-11-17 13:08:54,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:08:54,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:08:54,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:08:54,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-11-17 13:08:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-11-17 13:08:54,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:08:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:08:54,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:08:54,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2021-11-17 13:08:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2021-11-17 13:08:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:08:54,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:08:54,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:08:54,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-17 13:08:54,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:08:54,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-17 13:08:54,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:08:54,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 13:08:54,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 13:08:54,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:08:54,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-11-17 13:08:54,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-11-17 13:08:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:08:54,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2021-11-17 13:08:54,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:08:54,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2021-11-17 13:08:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:08:54,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2021-11-17 13:08:54,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:54,706 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2021-11-17 13:08:54,707 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:08:54,707 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257046624] [2021-11-17 13:08:54,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257046624] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 13:08:54,707 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712279368] [2021-11-17 13:08:54,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:08:54,707 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 13:08:54,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 13:08:54,709 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-11-17 13:08:54,712 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-11-17 13:08:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:08:55,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 3715 conjuncts, 53 conjunts are in the unsatisfiable core [2021-11-17 13:08:55,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 13:08:56,691 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2021-11-17 13:08:56,691 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 13:08:56,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712279368] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:08:56,692 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 13:08:56,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 22 [2021-11-17 13:08:56,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378344781] [2021-11-17 13:08:56,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:08:56,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-17 13:08:56,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:08:56,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-17 13:08:56,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2021-11-17 13:08:56,693 INFO L87 Difference]: Start difference. First operand 60272 states and 92016 transitions. Second operand has 12 states, 12 states have (on average 11.0) internal successors, (132), 9 states have internal predecessors, (132), 4 states have call successors, (44), 2 states have call predecessors, (44), 5 states have return successors, (40), 6 states have call predecessors, (40), 4 states have call successors, (40) [2021-11-17 13:09:02,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:09:02,808 INFO L93 Difference]: Finished difference Result 120371 states and 194495 transitions. [2021-11-17 13:09:02,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-17 13:09:02,810 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 11.0) internal successors, (132), 9 states have internal predecessors, (132), 4 states have call successors, (44), 2 states have call predecessors, (44), 5 states have return successors, (40), 6 states have call predecessors, (40), 4 states have call successors, (40) Word has length 301 [2021-11-17 13:09:02,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:09:03,257 INFO L225 Difference]: With dead ends: 120371 [2021-11-17 13:09:03,257 INFO L226 Difference]: Without dead ends: 60116 [2021-11-17 13:09:03,605 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2021-11-17 13:09:03,606 INFO L933 BasicCegarLoop]: 4035 mSDtfsCounter, 21 mSDsluCounter, 40309 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 44344 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-17 13:09:03,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 44344 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-17 13:09:03,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60116 states.