./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--media--rc--lirc_dev.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b 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--media--rc--lirc_dev.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 21c7509b891e0ddc87dd83939d0ee5cb835b3606a1a2de3064d905837c808c7b --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 19:08:28,023 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 19:08:28,025 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 19:08:28,074 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 19:08:28,080 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 19:08:28,081 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 19:08:28,082 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 19:08:28,084 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 19:08:28,086 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 19:08:28,087 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 19:08:28,087 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 19:08:28,088 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 19:08:28,089 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 19:08:28,090 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 19:08:28,091 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 19:08:28,092 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 19:08:28,093 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 19:08:28,094 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 19:08:28,095 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 19:08:28,097 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 19:08:28,098 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 19:08:28,099 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 19:08:28,101 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 19:08:28,101 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 19:08:28,104 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 19:08:28,104 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 19:08:28,104 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 19:08:28,105 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 19:08:28,106 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 19:08:28,106 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 19:08:28,107 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 19:08:28,108 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 19:08:28,108 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 19:08:28,109 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 19:08:28,110 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 19:08:28,110 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 19:08:28,111 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 19:08:28,111 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 19:08:28,111 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 19:08:28,112 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 19:08:28,113 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 19:08:28,114 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-14 19:08:28,133 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 19:08:28,133 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 19:08:28,133 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 19:08:28,133 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 19:08:28,134 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 19:08:28,134 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 19:08:28,135 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 19:08:28,135 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 19:08:28,135 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 19:08:28,135 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 19:08:28,136 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 19:08:28,136 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 19:08:28,136 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 19:08:28,136 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 19:08:28,136 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 19:08:28,137 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 19:08:28,137 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 19:08:28,137 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 19:08:28,137 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 19:08:28,137 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 19:08:28,138 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 19:08:28,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:08:28,138 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 19:08:28,138 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 19:08:28,138 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 19:08:28,139 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 19:08:28,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 19:08:28,139 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 19:08:28,139 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 19:08:28,139 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 19:08:28,139 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 19:08:28,140 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 -> 21c7509b891e0ddc87dd83939d0ee5cb835b3606a1a2de3064d905837c808c7b [2021-12-14 19:08:28,348 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 19:08:28,371 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 19:08:28,373 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 19:08:28,375 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 19:08:28,375 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 19:08:28,377 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--media--rc--lirc_dev.ko.cil.i [2021-12-14 19:08:28,446 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9aeebd415/ab322d27fe574acda17268b094aa79be/FLAG19f76955f [2021-12-14 19:08:29,135 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 19:08:29,136 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i [2021-12-14 19:08:29,182 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9aeebd415/ab322d27fe574acda17268b094aa79be/FLAG19f76955f [2021-12-14 19:08:29,206 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9aeebd415/ab322d27fe574acda17268b094aa79be [2021-12-14 19:08:29,208 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 19:08:29,209 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 19:08:29,210 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 19:08:29,211 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 19:08:29,213 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 19:08:29,214 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:08:29" (1/1) ... [2021-12-14 19:08:29,216 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@308e412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:08:29, skipping insertion in model container [2021-12-14 19:08:29,217 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:08:29" (1/1) ... [2021-12-14 19:08:29,222 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 19:08:29,346 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 19:08:31,180 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292064,292077] [2021-12-14 19:08:31,183 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292209,292222] [2021-12-14 19:08:31,183 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292355,292368] [2021-12-14 19:08:31,184 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292520,292533] [2021-12-14 19:08:31,184 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292678,292691] [2021-12-14 19:08:31,184 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292836,292849] [2021-12-14 19:08:31,185 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292994,293007] [2021-12-14 19:08:31,185 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293154,293167] [2021-12-14 19:08:31,186 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293313,293326] [2021-12-14 19:08:31,186 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293452,293465] [2021-12-14 19:08:31,186 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293594,293607] [2021-12-14 19:08:31,187 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293743,293756] [2021-12-14 19:08:31,187 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293882,293895] [2021-12-14 19:08:31,187 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294037,294050] [2021-12-14 19:08:31,188 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294197,294210] [2021-12-14 19:08:31,188 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294348,294361] [2021-12-14 19:08:31,189 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294499,294512] [2021-12-14 19:08:31,189 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294651,294664] [2021-12-14 19:08:31,189 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294800,294813] [2021-12-14 19:08:31,190 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294948,294961] [2021-12-14 19:08:31,190 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295105,295118] [2021-12-14 19:08:31,191 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295254,295267] [2021-12-14 19:08:31,191 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295410,295423] [2021-12-14 19:08:31,191 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295563,295576] [2021-12-14 19:08:31,192 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295709,295722] [2021-12-14 19:08:31,192 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295852,295865] [2021-12-14 19:08:31,192 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296004,296017] [2021-12-14 19:08:31,193 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296150,296163] [2021-12-14 19:08:31,193 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296295,296308] [2021-12-14 19:08:31,194 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296449,296462] [2021-12-14 19:08:31,194 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296600,296613] [2021-12-14 19:08:31,194 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296755,296768] [2021-12-14 19:08:31,195 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296907,296920] [2021-12-14 19:08:31,195 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297062,297075] [2021-12-14 19:08:31,196 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297226,297239] [2021-12-14 19:08:31,196 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297382,297395] [2021-12-14 19:08:31,196 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297546,297559] [2021-12-14 19:08:31,197 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297688,297701] [2021-12-14 19:08:31,197 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297846,297859] [2021-12-14 19:08:31,197 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298013,298026] [2021-12-14 19:08:31,198 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298172,298185] [2021-12-14 19:08:31,198 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298331,298344] [2021-12-14 19:08:31,198 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298480,298493] [2021-12-14 19:08:31,199 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298627,298640] [2021-12-14 19:08:31,199 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298766,298779] [2021-12-14 19:08:31,200 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298929,298942] [2021-12-14 19:08:31,200 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299095,299108] [2021-12-14 19:08:31,200 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299259,299272] [2021-12-14 19:08:31,201 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299424,299437] [2021-12-14 19:08:31,201 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299589,299602] [2021-12-14 19:08:31,201 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299755,299768] [2021-12-14 19:08:31,202 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299920,299933] [2021-12-14 19:08:31,202 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300087,300100] [2021-12-14 19:08:31,202 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300247,300260] [2021-12-14 19:08:31,203 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300409,300422] [2021-12-14 19:08:31,203 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300568,300581] [2021-12-14 19:08:31,203 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300714,300727] [2021-12-14 19:08:31,204 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300857,300870] [2021-12-14 19:08:31,204 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301001,301014] [2021-12-14 19:08:31,204 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301144,301157] [2021-12-14 19:08:31,205 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301288,301301] [2021-12-14 19:08:31,205 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301429,301442] [2021-12-14 19:08:31,205 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301567,301580] [2021-12-14 19:08:31,206 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301725,301738] [2021-12-14 19:08:31,206 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301884,301897] [2021-12-14 19:08:31,206 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302040,302053] [2021-12-14 19:08:31,207 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302189,302202] [2021-12-14 19:08:31,207 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302341,302354] [2021-12-14 19:08:31,208 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302492,302505] [2021-12-14 19:08:31,208 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302641,302654] [2021-12-14 19:08:31,208 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302793,302806] [2021-12-14 19:08:31,209 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302941,302954] [2021-12-14 19:08:31,209 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303094,303107] [2021-12-14 19:08:31,209 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303245,303258] [2021-12-14 19:08:31,210 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303395,303408] [2021-12-14 19:08:31,210 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303542,303555] [2021-12-14 19:08:31,210 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303693,303706] [2021-12-14 19:08:31,211 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303844,303857] [2021-12-14 19:08:31,211 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303992,304005] [2021-12-14 19:08:31,211 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304158,304171] [2021-12-14 19:08:31,212 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304327,304340] [2021-12-14 19:08:31,212 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304494,304507] [2021-12-14 19:08:31,212 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304662,304675] [2021-12-14 19:08:31,213 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304812,304825] [2021-12-14 19:08:31,213 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304959,304972] [2021-12-14 19:08:31,213 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[305120,305133] [2021-12-14 19:08:31,214 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[305290,305303] [2021-12-14 19:08:31,214 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[305452,305465] [2021-12-14 19:08:31,224 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:08:31,254 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 19:08:31,499 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292064,292077] [2021-12-14 19:08:31,500 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292209,292222] [2021-12-14 19:08:31,501 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292355,292368] [2021-12-14 19:08:31,501 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292520,292533] [2021-12-14 19:08:31,502 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292678,292691] [2021-12-14 19:08:31,503 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292836,292849] [2021-12-14 19:08:31,503 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292994,293007] [2021-12-14 19:08:31,504 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293154,293167] [2021-12-14 19:08:31,505 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293313,293326] [2021-12-14 19:08:31,506 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293452,293465] [2021-12-14 19:08:31,507 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293594,293607] [2021-12-14 19:08:31,510 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293743,293756] [2021-12-14 19:08:31,510 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293882,293895] [2021-12-14 19:08:31,510 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294037,294050] [2021-12-14 19:08:31,511 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294197,294210] [2021-12-14 19:08:31,511 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294348,294361] [2021-12-14 19:08:31,511 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294499,294512] [2021-12-14 19:08:31,511 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294651,294664] [2021-12-14 19:08:31,512 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294800,294813] [2021-12-14 19:08:31,512 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294948,294961] [2021-12-14 19:08:31,513 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295105,295118] [2021-12-14 19:08:31,514 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295254,295267] [2021-12-14 19:08:31,515 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295410,295423] [2021-12-14 19:08:31,515 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295563,295576] [2021-12-14 19:08:31,515 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295709,295722] [2021-12-14 19:08:31,516 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295852,295865] [2021-12-14 19:08:31,516 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296004,296017] [2021-12-14 19:08:31,516 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296150,296163] [2021-12-14 19:08:31,517 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296295,296308] [2021-12-14 19:08:31,518 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296449,296462] [2021-12-14 19:08:31,518 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296600,296613] [2021-12-14 19:08:31,518 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296755,296768] [2021-12-14 19:08:31,519 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296907,296920] [2021-12-14 19:08:31,519 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297062,297075] [2021-12-14 19:08:31,519 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297226,297239] [2021-12-14 19:08:31,520 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297382,297395] [2021-12-14 19:08:31,520 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297546,297559] [2021-12-14 19:08:31,520 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297688,297701] [2021-12-14 19:08:31,521 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297846,297859] [2021-12-14 19:08:31,521 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298013,298026] [2021-12-14 19:08:31,522 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298172,298185] [2021-12-14 19:08:31,523 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298331,298344] [2021-12-14 19:08:31,523 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298480,298493] [2021-12-14 19:08:31,523 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298627,298640] [2021-12-14 19:08:31,524 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298766,298779] [2021-12-14 19:08:31,524 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298929,298942] [2021-12-14 19:08:31,524 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299095,299108] [2021-12-14 19:08:31,524 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299259,299272] [2021-12-14 19:08:31,525 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299424,299437] [2021-12-14 19:08:31,525 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299589,299602] [2021-12-14 19:08:31,526 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299755,299768] [2021-12-14 19:08:31,529 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299920,299933] [2021-12-14 19:08:31,529 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300087,300100] [2021-12-14 19:08:31,530 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300247,300260] [2021-12-14 19:08:31,530 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300409,300422] [2021-12-14 19:08:31,530 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300568,300581] [2021-12-14 19:08:31,530 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300714,300727] [2021-12-14 19:08:31,557 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300857,300870] [2021-12-14 19:08:31,558 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301001,301014] [2021-12-14 19:08:31,558 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301144,301157] [2021-12-14 19:08:31,558 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301288,301301] [2021-12-14 19:08:31,558 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301429,301442] [2021-12-14 19:08:31,559 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301567,301580] [2021-12-14 19:08:31,559 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301725,301738] [2021-12-14 19:08:31,559 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301884,301897] [2021-12-14 19:08:31,559 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302040,302053] [2021-12-14 19:08:31,559 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302189,302202] [2021-12-14 19:08:31,560 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302341,302354] [2021-12-14 19:08:31,560 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302492,302505] [2021-12-14 19:08:31,560 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302641,302654] [2021-12-14 19:08:31,560 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302793,302806] [2021-12-14 19:08:31,561 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302941,302954] [2021-12-14 19:08:31,561 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303094,303107] [2021-12-14 19:08:31,561 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303245,303258] [2021-12-14 19:08:31,561 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303395,303408] [2021-12-14 19:08:31,561 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303542,303555] [2021-12-14 19:08:31,562 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303693,303706] [2021-12-14 19:08:31,564 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303844,303857] [2021-12-14 19:08:31,565 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303992,304005] [2021-12-14 19:08:31,565 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304158,304171] [2021-12-14 19:08:31,566 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304327,304340] [2021-12-14 19:08:31,567 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304494,304507] [2021-12-14 19:08:31,567 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304662,304675] [2021-12-14 19:08:31,568 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304812,304825] [2021-12-14 19:08:31,568 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304959,304972] [2021-12-14 19:08:31,568 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[305120,305133] [2021-12-14 19:08:31,569 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[305290,305303] [2021-12-14 19:08:31,569 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[305452,305465] [2021-12-14 19:08:31,571 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:08:31,703 INFO L208 MainTranslator]: Completed translation [2021-12-14 19:08:31,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:08:31 WrapperNode [2021-12-14 19:08:31,704 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 19:08:31,705 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 19:08:31,706 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 19:08:31,706 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 19:08:31,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:08:31" (1/1) ... [2021-12-14 19:08:31,790 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:08:31" (1/1) ... [2021-12-14 19:08:31,877 INFO L137 Inliner]: procedures = 519, calls = 1770, calls flagged for inlining = 206, calls inlined = 55, statements flattened = 940 [2021-12-14 19:08:31,878 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 19:08:31,878 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 19:08:31,878 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 19:08:31,878 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 19:08:31,884 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:08:31" (1/1) ... [2021-12-14 19:08:31,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:08:31" (1/1) ... [2021-12-14 19:08:31,903 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:08:31" (1/1) ... [2021-12-14 19:08:31,904 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:08:31" (1/1) ... [2021-12-14 19:08:31,928 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:08:31" (1/1) ... [2021-12-14 19:08:31,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:08:31" (1/1) ... [2021-12-14 19:08:31,940 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:08:31" (1/1) ... [2021-12-14 19:08:31,948 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 19:08:31,949 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 19:08:31,949 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 19:08:31,949 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 19:08:31,963 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:08:31" (1/1) ... [2021-12-14 19:08:31,969 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:08:31,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:08:31,990 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-14 19:08:31,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-14 19:08:32,028 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_usb_gadget__class_registration_with_usb_gadget [2021-12-14 19:08:32,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_usb_gadget__class_registration_with_usb_gadget [2021-12-14 19:08:32,029 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_nonpositive [2021-12-14 19:08:32,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_nonpositive [2021-12-14 19:08:32,029 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2021-12-14 19:08:32,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2021-12-14 19:08:32,030 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-12-14 19:08:32,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-12-14 19:08:32,030 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-12-14 19:08:32,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-12-14 19:08:32,030 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2021-12-14 19:08:32,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2021-12-14 19:08:32,031 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2021-12-14 19:08:32,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2021-12-14 19:08:32,032 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2021-12-14 19:08:32,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2021-12-14 19:08:32,032 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2021-12-14 19:08:32,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2021-12-14 19:08:32,033 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2021-12-14 19:08:32,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2021-12-14 19:08:32,034 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2021-12-14 19:08:32,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2021-12-14 19:08:32,034 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-12-14 19:08:32,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-12-14 19:08:32,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 19:08:32,034 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2021-12-14 19:08:32,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2021-12-14 19:08:32,035 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2021-12-14 19:08:32,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2021-12-14 19:08:32,035 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_fs_char_dev__double_registration [2021-12-14 19:08:32,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_fs_char_dev__double_registration [2021-12-14 19:08:32,035 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2021-12-14 19:08:32,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2021-12-14 19:08:32,036 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-12-14 19:08:32,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-12-14 19:08:32,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 19:08:32,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 19:08:32,036 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2021-12-14 19:08:32,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2021-12-14 19:08:32,036 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2021-12-14 19:08:32,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2021-12-14 19:08:32,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 19:08:32,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 19:08:32,037 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2021-12-14 19:08:32,037 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2021-12-14 19:08:32,037 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-12-14 19:08:32,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-12-14 19:08:32,038 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_destroy_class [2021-12-14 19:08:32,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_destroy_class [2021-12-14 19:08:32,038 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2021-12-14 19:08:32,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2021-12-14 19:08:32,038 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2021-12-14 19:08:32,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2021-12-14 19:08:32,038 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2021-12-14 19:08:32,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2021-12-14 19:08:32,039 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_drivers_base_class__double_registration [2021-12-14 19:08:32,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_drivers_base_class__double_registration [2021-12-14 19:08:32,039 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_destroy_class [2021-12-14 19:08:32,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_destroy_class [2021-12-14 19:08:32,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-14 19:08:32,040 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2021-12-14 19:08:32,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2021-12-14 19:08:32,040 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2021-12-14 19:08:32,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2021-12-14 19:08:32,040 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-12-14 19:08:32,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-12-14 19:08:32,041 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2021-12-14 19:08:32,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2021-12-14 19:08:32,041 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-12-14 19:08:32,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-12-14 19:08:32,041 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2021-12-14 19:08:32,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2021-12-14 19:08:32,042 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2021-12-14 19:08:32,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2021-12-14 19:08:32,045 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2021-12-14 19:08:32,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2021-12-14 19:08:32,045 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-12-14 19:08:32,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-12-14 19:08:32,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 19:08:32,046 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_usb_gadget__chrdev_registration_with_usb_gadget [2021-12-14 19:08:32,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_usb_gadget__chrdev_registration_with_usb_gadget [2021-12-14 19:08:32,324 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 19:08:32,326 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 19:08:32,469 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-12-14 19:08:32,941 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 19:08:32,951 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 19:08:32,951 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-14 19:08:32,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:08:32 BoogieIcfgContainer [2021-12-14 19:08:32,953 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 19:08:32,955 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 19:08:32,955 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 19:08:32,958 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 19:08:32,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:08:29" (1/3) ... [2021-12-14 19:08:32,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d2408e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:08:32, skipping insertion in model container [2021-12-14 19:08:32,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:08:31" (2/3) ... [2021-12-14 19:08:32,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d2408e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:08:32, skipping insertion in model container [2021-12-14 19:08:32,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:08:32" (3/3) ... [2021-12-14 19:08:32,960 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i [2021-12-14 19:08:32,966 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 19:08:32,966 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2021-12-14 19:08:33,016 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 19:08:33,021 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 19:08:33,022 INFO L340 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2021-12-14 19:08:33,041 INFO L276 IsEmpty]: Start isEmpty. Operand has 374 states, 231 states have (on average 1.3073593073593073) internal successors, (302), 263 states have internal predecessors, (302), 77 states have call successors, (77), 37 states have call predecessors, (77), 36 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2021-12-14 19:08:33,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-14 19:08:33,046 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:08:33,047 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-14 19:08:33,047 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_assert_linux_drivers_base_class__double_registrationErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-12-14 19:08:33,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:08:33,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1456749468, now seen corresponding path program 1 times [2021-12-14 19:08:33,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:08:33,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801607041] [2021-12-14 19:08:33,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:08:33,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:08:33,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:33,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:08:33,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:33,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 19:08:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:33,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:08:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:33,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-14 19:08:33,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:33,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-14 19:08:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:33,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 19:08:33,525 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:08:33,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801607041] [2021-12-14 19:08:33,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801607041] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:08:33,526 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:08:33,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:08:33,527 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834699547] [2021-12-14 19:08:33,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:08:33,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:08:33,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:08:33,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:08:33,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:08:33,555 INFO L87 Difference]: Start difference. First operand has 374 states, 231 states have (on average 1.3073593073593073) internal successors, (302), 263 states have internal predecessors, (302), 77 states have call successors, (77), 37 states have call predecessors, (77), 36 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-14 19:08:34,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:08:34,853 INFO L93 Difference]: Finished difference Result 1054 states and 1373 transitions. [2021-12-14 19:08:34,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:08:34,858 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35 [2021-12-14 19:08:34,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:08:34,871 INFO L225 Difference]: With dead ends: 1054 [2021-12-14 19:08:34,872 INFO L226 Difference]: Without dead ends: 691 [2021-12-14 19:08:34,878 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:08:34,881 INFO L933 BasicCegarLoop]: 752 mSDtfsCounter, 539 mSDsluCounter, 1085 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 1837 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:08:34,881 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [607 Valid, 1837 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1111 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-14 19:08:34,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2021-12-14 19:08:34,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 480. [2021-12-14 19:08:34,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 302 states have (on average 1.1754966887417218) internal successors, (355), 336 states have internal predecessors, (355), 101 states have call successors, (101), 50 states have call predecessors, (101), 49 states have return successors, (101), 97 states have call predecessors, (101), 99 states have call successors, (101) [2021-12-14 19:08:34,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 557 transitions. [2021-12-14 19:08:34,958 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 557 transitions. Word has length 35 [2021-12-14 19:08:34,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:08:34,959 INFO L470 AbstractCegarLoop]: Abstraction has 480 states and 557 transitions. [2021-12-14 19:08:34,959 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-14 19:08:34,960 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 557 transitions. [2021-12-14 19:08:34,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-14 19:08:34,962 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:08:34,962 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:08:34,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 19:08:34,962 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-12-14 19:08:34,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:08:34,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1101797720, now seen corresponding path program 1 times [2021-12-14 19:08:34,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:08:34,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772204563] [2021-12-14 19:08:34,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:08:34,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:08:35,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:35,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:08:35,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:35,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 19:08:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:35,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:08:35,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:35,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-14 19:08:35,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:35,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-14 19:08:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:35,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 19:08:35,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:35,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-14 19:08:35,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:35,153 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-14 19:08:35,154 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:08:35,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772204563] [2021-12-14 19:08:35,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772204563] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:08:35,155 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:08:35,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:08:35,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765223629] [2021-12-14 19:08:35,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:08:35,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:08:35,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:08:35,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:08:35,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:08:35,157 INFO L87 Difference]: Start difference. First operand 480 states and 557 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-14 19:08:35,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:08:35,679 INFO L93 Difference]: Finished difference Result 482 states and 559 transitions. [2021-12-14 19:08:35,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:08:35,679 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 48 [2021-12-14 19:08:35,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:08:35,683 INFO L225 Difference]: With dead ends: 482 [2021-12-14 19:08:35,684 INFO L226 Difference]: Without dead ends: 480 [2021-12-14 19:08:35,684 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:08:35,685 INFO L933 BasicCegarLoop]: 392 mSDtfsCounter, 508 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:08:35,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [568 Valid, 883 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 19:08:35,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2021-12-14 19:08:35,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 478. [2021-12-14 19:08:35,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 301 states have (on average 1.169435215946844) internal successors, (352), 334 states have internal predecessors, (352), 101 states have call successors, (101), 50 states have call predecessors, (101), 49 states have return successors, (101), 97 states have call predecessors, (101), 99 states have call successors, (101) [2021-12-14 19:08:35,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 554 transitions. [2021-12-14 19:08:35,719 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 554 transitions. Word has length 48 [2021-12-14 19:08:35,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:08:35,720 INFO L470 AbstractCegarLoop]: Abstraction has 478 states and 554 transitions. [2021-12-14 19:08:35,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-14 19:08:35,720 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 554 transitions. [2021-12-14 19:08:35,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-12-14 19:08:35,723 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:08:35,724 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:08:35,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 19:08:35,724 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_assert_linux_fs_char_dev__double_registrationErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-12-14 19:08:35,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:08:35,725 INFO L85 PathProgramCache]: Analyzing trace with hash 951373245, now seen corresponding path program 1 times [2021-12-14 19:08:35,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:08:35,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756234059] [2021-12-14 19:08:35,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:08:35,726 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:08:35,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:35,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:08:35,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:35,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 19:08:35,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:35,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:08:35,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:35,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-14 19:08:35,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:35,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-14 19:08:35,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:35,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 19:08:35,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:35,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-14 19:08:35,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:35,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-14 19:08:35,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:35,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-14 19:08:35,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:35,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:08:35,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:35,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-14 19:08:35,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:35,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:08:35,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:35,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:08:35,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:35,971 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-12-14 19:08:35,972 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:08:35,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756234059] [2021-12-14 19:08:35,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756234059] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:08:35,972 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:08:35,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:08:35,973 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561143716] [2021-12-14 19:08:35,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:08:35,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:08:35,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:08:35,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:08:35,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:08:35,974 INFO L87 Difference]: Start difference. First operand 478 states and 554 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), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-12-14 19:08:36,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:08:36,781 INFO L93 Difference]: Finished difference Result 821 states and 930 transitions. [2021-12-14 19:08:36,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:08:36,782 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), 3 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 86 [2021-12-14 19:08:36,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:08:36,787 INFO L225 Difference]: With dead ends: 821 [2021-12-14 19:08:36,787 INFO L226 Difference]: Without dead ends: 819 [2021-12-14 19:08:36,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:08:36,789 INFO L933 BasicCegarLoop]: 468 mSDtfsCounter, 632 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-14 19:08:36,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [694 Valid, 1163 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-14 19:08:36,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2021-12-14 19:08:36,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 672. [2021-12-14 19:08:36,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 432 states have (on average 1.1828703703703705) internal successors, (511), 467 states have internal predecessors, (511), 137 states have call successors, (137), 78 states have call predecessors, (137), 77 states have return successors, (137), 131 states have call predecessors, (137), 135 states have call successors, (137) [2021-12-14 19:08:36,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 785 transitions. [2021-12-14 19:08:36,827 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 785 transitions. Word has length 86 [2021-12-14 19:08:36,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:08:36,827 INFO L470 AbstractCegarLoop]: Abstraction has 672 states and 785 transitions. [2021-12-14 19:08:36,827 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), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-12-14 19:08:36,828 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 785 transitions. [2021-12-14 19:08:36,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-12-14 19:08:36,830 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:08:36,830 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 3, 3, 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] [2021-12-14 19:08:36,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 19:08:36,831 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_assert_linux_usb_gadget__chrdev_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-12-14 19:08:36,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:08:36,831 INFO L85 PathProgramCache]: Analyzing trace with hash -292723993, now seen corresponding path program 1 times [2021-12-14 19:08:36,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:08:36,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695661465] [2021-12-14 19:08:36,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:08:36,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:08:36,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:36,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:08:36,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:36,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 19:08:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:36,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:08:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:36,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-14 19:08:36,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:36,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-14 19:08:36,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:36,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 19:08:36,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:36,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-14 19:08:36,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:37,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-14 19:08:37,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:37,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-14 19:08:37,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:37,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:08:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:37,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-14 19:08:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:37,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:08:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:37,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:08:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:37,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-14 19:08:37,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:37,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:08:37,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:37,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:08:37,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:37,069 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2021-12-14 19:08:37,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:08:37,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695661465] [2021-12-14 19:08:37,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695661465] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:08:37,069 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:08:37,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:08:37,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107639169] [2021-12-14 19:08:37,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:08:37,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:08:37,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:08:37,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:08:37,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:08:37,074 INFO L87 Difference]: Start difference. First operand 672 states and 785 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-14 19:08:37,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:08:37,600 INFO L93 Difference]: Finished difference Result 674 states and 787 transitions. [2021-12-14 19:08:37,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:08:37,600 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (15), 3 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 105 [2021-12-14 19:08:37,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:08:37,605 INFO L225 Difference]: With dead ends: 674 [2021-12-14 19:08:37,605 INFO L226 Difference]: Without dead ends: 672 [2021-12-14 19:08:37,606 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:08:37,608 INFO L933 BasicCegarLoop]: 388 mSDtfsCounter, 487 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 19:08:37,609 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [543 Valid, 879 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 19:08:37,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2021-12-14 19:08:37,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 670. [2021-12-14 19:08:37,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 431 states have (on average 1.1763341067285382) internal successors, (507), 465 states have internal predecessors, (507), 137 states have call successors, (137), 78 states have call predecessors, (137), 77 states have return successors, (137), 131 states have call predecessors, (137), 135 states have call successors, (137) [2021-12-14 19:08:37,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 781 transitions. [2021-12-14 19:08:37,647 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 781 transitions. Word has length 105 [2021-12-14 19:08:37,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:08:37,650 INFO L470 AbstractCegarLoop]: Abstraction has 670 states and 781 transitions. [2021-12-14 19:08:37,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-14 19:08:37,650 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 781 transitions. [2021-12-14 19:08:37,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-12-14 19:08:37,656 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:08:37,657 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 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-12-14 19:08:37,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 19:08:37,658 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-12-14 19:08:37,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:08:37,659 INFO L85 PathProgramCache]: Analyzing trace with hash -876569357, now seen corresponding path program 1 times [2021-12-14 19:08:37,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:08:37,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107955541] [2021-12-14 19:08:37,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:08:37,659 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:08:37,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:37,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:08:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:37,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 19:08:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:37,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:08:37,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:37,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-14 19:08:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:37,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-14 19:08:37,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:37,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 19:08:37,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:37,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-14 19:08:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:37,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-14 19:08:37,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:37,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-14 19:08:37,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:37,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:08:37,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:37,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-12-14 19:08:37,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:37,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 19:08:37,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:37,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 19:08:37,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:37,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:08:37,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:37,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-14 19:08:37,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:37,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-14 19:08:37,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:37,888 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-12-14 19:08:37,889 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:08:37,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107955541] [2021-12-14 19:08:37,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107955541] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:08:37,889 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:08:37,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 19:08:37,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652143359] [2021-12-14 19:08:37,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:08:37,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:08:37,890 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:08:37,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:08:37,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:08:37,891 INFO L87 Difference]: Start difference. First operand 670 states and 781 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-14 19:08:38,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:08:38,467 INFO L93 Difference]: Finished difference Result 672 states and 783 transitions. [2021-12-14 19:08:38,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:08:38,468 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 107 [2021-12-14 19:08:38,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:08:38,472 INFO L225 Difference]: With dead ends: 672 [2021-12-14 19:08:38,473 INFO L226 Difference]: Without dead ends: 670 [2021-12-14 19:08:38,473 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-12-14 19:08:38,474 INFO L933 BasicCegarLoop]: 387 mSDtfsCounter, 838 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 19:08:38,474 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [888 Valid, 792 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 19:08:38,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2021-12-14 19:08:38,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 668. [2021-12-14 19:08:38,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 430 states have (on average 1.172093023255814) internal successors, (504), 463 states have internal predecessors, (504), 137 states have call successors, (137), 78 states have call predecessors, (137), 77 states have return successors, (137), 131 states have call predecessors, (137), 135 states have call successors, (137) [2021-12-14 19:08:38,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 778 transitions. [2021-12-14 19:08:38,511 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 778 transitions. Word has length 107 [2021-12-14 19:08:38,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:08:38,512 INFO L470 AbstractCegarLoop]: Abstraction has 668 states and 778 transitions. [2021-12-14 19:08:38,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-14 19:08:38,512 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 778 transitions. [2021-12-14 19:08:38,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-12-14 19:08:38,516 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:08:38,516 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 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] [2021-12-14 19:08:38,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 19:08:38,517 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-12-14 19:08:38,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:08:38,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1725971280, now seen corresponding path program 1 times [2021-12-14 19:08:38,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:08:38,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242003250] [2021-12-14 19:08:38,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:08:38,518 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:08:38,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:38,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:08:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:38,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 19:08:38,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:38,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:08:38,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:38,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-14 19:08:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:38,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-14 19:08:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:38,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 19:08:38,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:38,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-14 19:08:38,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:38,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-14 19:08:38,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:38,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-14 19:08:38,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:38,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:08:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:38,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-12-14 19:08:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:38,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 19:08:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:38,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 19:08:38,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:38,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:08:38,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:38,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-14 19:08:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:38,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-14 19:08:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:38,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-14 19:08:38,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:38,752 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-12-14 19:08:38,752 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:08:38,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242003250] [2021-12-14 19:08:38,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242003250] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:08:38,753 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:08:38,753 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 19:08:38,753 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703758781] [2021-12-14 19:08:38,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:08:38,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:08:38,754 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:08:38,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:08:38,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:08:38,755 INFO L87 Difference]: Start difference. First operand 668 states and 778 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-12-14 19:08:39,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:08:39,388 INFO L93 Difference]: Finished difference Result 670 states and 780 transitions. [2021-12-14 19:08:39,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:08:39,389 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 113 [2021-12-14 19:08:39,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:08:39,392 INFO L225 Difference]: With dead ends: 670 [2021-12-14 19:08:39,392 INFO L226 Difference]: Without dead ends: 668 [2021-12-14 19:08:39,393 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-12-14 19:08:39,393 INFO L933 BasicCegarLoop]: 385 mSDtfsCounter, 830 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 19:08:39,394 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [879 Valid, 790 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 19:08:39,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2021-12-14 19:08:39,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 666. [2021-12-14 19:08:39,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 429 states have (on average 1.167832167832168) internal successors, (501), 461 states have internal predecessors, (501), 137 states have call successors, (137), 78 states have call predecessors, (137), 77 states have return successors, (137), 131 states have call predecessors, (137), 135 states have call successors, (137) [2021-12-14 19:08:39,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 775 transitions. [2021-12-14 19:08:39,431 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 775 transitions. Word has length 113 [2021-12-14 19:08:39,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:08:39,432 INFO L470 AbstractCegarLoop]: Abstraction has 666 states and 775 transitions. [2021-12-14 19:08:39,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-12-14 19:08:39,432 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 775 transitions. [2021-12-14 19:08:39,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-12-14 19:08:39,434 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:08:39,434 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:08:39,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 19:08:39,434 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_drivers_base_class_destroy_classErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-12-14 19:08:39,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:08:39,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1315263575, now seen corresponding path program 1 times [2021-12-14 19:08:39,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:08:39,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341791711] [2021-12-14 19:08:39,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:08:39,436 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:08:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:39,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:08:39,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:39,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 19:08:39,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:39,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:08:39,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:39,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-14 19:08:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:39,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-14 19:08:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:39,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 19:08:39,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:39,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-14 19:08:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:39,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-14 19:08:39,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:39,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-14 19:08:39,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:39,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:08:39,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:39,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-12-14 19:08:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:39,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 19:08:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:39,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 19:08:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:39,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:08:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:39,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-14 19:08:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:39,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-14 19:08:39,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:39,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-14 19:08:39,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:39,817 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-12-14 19:08:39,817 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:08:39,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341791711] [2021-12-14 19:08:39,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341791711] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:08:39,818 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:08:39,818 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-14 19:08:39,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179508420] [2021-12-14 19:08:39,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:08:39,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-14 19:08:39,819 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:08:39,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-14 19:08:39,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2021-12-14 19:08:39,820 INFO L87 Difference]: Start difference. First operand 666 states and 775 transitions. Second operand has 15 states, 14 states have (on average 4.142857142857143) internal successors, (58), 10 states have internal predecessors, (58), 6 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (17), 6 states have call predecessors, (17), 5 states have call successors, (17) [2021-12-14 19:08:42,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:08:42,073 INFO L93 Difference]: Finished difference Result 1556 states and 1785 transitions. [2021-12-14 19:08:42,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-14 19:08:42,073 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.142857142857143) internal successors, (58), 10 states have internal predecessors, (58), 6 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (17), 6 states have call predecessors, (17), 5 states have call successors, (17) Word has length 114 [2021-12-14 19:08:42,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:08:42,080 INFO L225 Difference]: With dead ends: 1556 [2021-12-14 19:08:42,080 INFO L226 Difference]: Without dead ends: 1317 [2021-12-14 19:08:42,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=771, Unknown=0, NotChecked=0, Total=930 [2021-12-14 19:08:42,082 INFO L933 BasicCegarLoop]: 380 mSDtfsCounter, 1539 mSDsluCounter, 2122 mSDsCounter, 0 mSdLazyCounter, 2845 mSolverCounterSat, 868 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1549 SdHoareTripleChecker+Valid, 2502 SdHoareTripleChecker+Invalid, 3713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 868 IncrementalHoareTripleChecker+Valid, 2845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-12-14 19:08:42,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1549 Valid, 2502 Invalid, 3713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [868 Valid, 2845 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-12-14 19:08:42,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2021-12-14 19:08:42,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 902. [2021-12-14 19:08:42,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 587 states have (on average 1.161839863713799) internal successors, (682), 628 states have internal predecessors, (682), 188 states have call successors, (188), 104 states have call predecessors, (188), 104 states have return successors, (188), 178 states have call predecessors, (188), 186 states have call successors, (188) [2021-12-14 19:08:42,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1058 transitions. [2021-12-14 19:08:42,136 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1058 transitions. Word has length 114 [2021-12-14 19:08:42,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:08:42,137 INFO L470 AbstractCegarLoop]: Abstraction has 902 states and 1058 transitions. [2021-12-14 19:08:42,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.142857142857143) internal successors, (58), 10 states have internal predecessors, (58), 6 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (17), 6 states have call predecessors, (17), 5 states have call successors, (17) [2021-12-14 19:08:42,137 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1058 transitions. [2021-12-14 19:08:42,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-12-14 19:08:42,139 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:08:42,139 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 3, 3, 3, 3, 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] [2021-12-14 19:08:42,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-14 19:08:42,141 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_drivers_base_class_destroy_classErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-12-14 19:08:42,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:08:42,141 INFO L85 PathProgramCache]: Analyzing trace with hash -331086751, now seen corresponding path program 1 times [2021-12-14 19:08:42,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:08:42,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553598306] [2021-12-14 19:08:42,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:08:42,142 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:08:42,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:42,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:08:42,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:42,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 19:08:42,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:42,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:08:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:42,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-14 19:08:42,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:42,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-14 19:08:42,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:42,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 19:08:42,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:42,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-14 19:08:42,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:42,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-14 19:08:42,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:42,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-14 19:08:42,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:42,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:08:42,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:42,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-14 19:08:42,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:42,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:08:42,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:42,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:08:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:42,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-14 19:08:42,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:42,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:08:42,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:42,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:08:42,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:42,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-14 19:08:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:42,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-12-14 19:08:42,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:42,493 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-12-14 19:08:42,493 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:08:42,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553598306] [2021-12-14 19:08:42,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553598306] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:08:42,494 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:08:42,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-14 19:08:42,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461246690] [2021-12-14 19:08:42,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:08:42,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-14 19:08:42,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:08:42,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-14 19:08:42,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2021-12-14 19:08:42,496 INFO L87 Difference]: Start difference. First operand 902 states and 1058 transitions. Second operand has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 10 states have internal predecessors, (55), 6 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2021-12-14 19:08:44,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:08:44,665 INFO L93 Difference]: Finished difference Result 1829 states and 2159 transitions. [2021-12-14 19:08:44,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 19:08:44,666 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 10 states have internal predecessors, (55), 6 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) Word has length 122 [2021-12-14 19:08:44,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:08:44,673 INFO L225 Difference]: With dead ends: 1829 [2021-12-14 19:08:44,673 INFO L226 Difference]: Without dead ends: 1329 [2021-12-14 19:08:44,675 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2021-12-14 19:08:44,676 INFO L933 BasicCegarLoop]: 454 mSDtfsCounter, 846 mSDsluCounter, 2647 mSDsCounter, 0 mSdLazyCounter, 2763 mSolverCounterSat, 791 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 3101 SdHoareTripleChecker+Invalid, 3554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 791 IncrementalHoareTripleChecker+Valid, 2763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-12-14 19:08:44,676 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [864 Valid, 3101 Invalid, 3554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [791 Valid, 2763 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-12-14 19:08:44,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2021-12-14 19:08:44,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 887. [2021-12-14 19:08:44,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 575 states have (on average 1.151304347826087) internal successors, (662), 616 states have internal predecessors, (662), 185 states have call successors, (185), 104 states have call predecessors, (185), 104 states have return successors, (184), 175 states have call predecessors, (184), 183 states have call successors, (184) [2021-12-14 19:08:44,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1031 transitions. [2021-12-14 19:08:44,731 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1031 transitions. Word has length 122 [2021-12-14 19:08:44,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:08:44,731 INFO L470 AbstractCegarLoop]: Abstraction has 887 states and 1031 transitions. [2021-12-14 19:08:44,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 10 states have internal predecessors, (55), 6 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2021-12-14 19:08:44,732 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1031 transitions. [2021-12-14 19:08:44,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-12-14 19:08:44,734 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:08:44,735 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 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] [2021-12-14 19:08:44,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-14 19:08:44,735 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-12-14 19:08:44,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:08:44,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1688734875, now seen corresponding path program 1 times [2021-12-14 19:08:44,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:08:44,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72717720] [2021-12-14 19:08:44,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:08:44,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:08:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:45,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:08:45,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:45,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 19:08:45,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:45,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:08:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:45,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-14 19:08:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:45,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-14 19:08:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:45,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 19:08:45,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:45,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-14 19:08:45,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:45,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-14 19:08:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:45,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-14 19:08:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:45,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:08:45,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:45,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-12-14 19:08:45,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:45,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 19:08:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:45,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 19:08:45,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:45,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:08:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:45,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-14 19:08:45,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:45,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-14 19:08:45,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:45,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-14 19:08:45,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:45,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-14 19:08:45,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:45,494 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2021-12-14 19:08:45,495 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:08:45,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72717720] [2021-12-14 19:08:45,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72717720] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:08:45,495 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:08:45,495 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-12-14 19:08:45,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814333983] [2021-12-14 19:08:45,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:08:45,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-12-14 19:08:45,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:08:45,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-12-14 19:08:45,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2021-12-14 19:08:45,498 INFO L87 Difference]: Start difference. First operand 887 states and 1031 transitions. Second operand has 28 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 22 states have internal predecessors, (65), 9 states have call successors, (18), 5 states have call predecessors, (18), 4 states have return successors, (18), 10 states have call predecessors, (18), 9 states have call successors, (18) [2021-12-14 19:08:48,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:08:48,166 INFO L93 Difference]: Finished difference Result 1361 states and 1599 transitions. [2021-12-14 19:08:48,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-14 19:08:48,167 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 22 states have internal predecessors, (65), 9 states have call successors, (18), 5 states have call predecessors, (18), 4 states have return successors, (18), 10 states have call predecessors, (18), 9 states have call successors, (18) Word has length 117 [2021-12-14 19:08:48,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:08:48,170 INFO L225 Difference]: With dead ends: 1361 [2021-12-14 19:08:48,170 INFO L226 Difference]: Without dead ends: 659 [2021-12-14 19:08:48,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=282, Invalid=2268, Unknown=0, NotChecked=0, Total=2550 [2021-12-14 19:08:48,174 INFO L933 BasicCegarLoop]: 426 mSDtfsCounter, 855 mSDsluCounter, 5399 mSDsCounter, 0 mSdLazyCounter, 5098 mSolverCounterSat, 554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 5825 SdHoareTripleChecker+Invalid, 5652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 554 IncrementalHoareTripleChecker+Valid, 5098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:08:48,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [887 Valid, 5825 Invalid, 5652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [554 Valid, 5098 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2021-12-14 19:08:48,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2021-12-14 19:08:48,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 608. [2021-12-14 19:08:48,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 391 states have (on average 1.156010230179028) internal successors, (452), 421 states have internal predecessors, (452), 124 states have call successors, (124), 71 states have call predecessors, (124), 70 states have return successors, (122), 119 states have call predecessors, (122), 122 states have call successors, (122) [2021-12-14 19:08:48,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 698 transitions. [2021-12-14 19:08:48,213 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 698 transitions. Word has length 117 [2021-12-14 19:08:48,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:08:48,213 INFO L470 AbstractCegarLoop]: Abstraction has 608 states and 698 transitions. [2021-12-14 19:08:48,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 22 states have internal predecessors, (65), 9 states have call successors, (18), 5 states have call predecessors, (18), 4 states have return successors, (18), 10 states have call predecessors, (18), 9 states have call successors, (18) [2021-12-14 19:08:48,214 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 698 transitions. [2021-12-14 19:08:48,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-12-14 19:08:48,215 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:08:48,215 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 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] [2021-12-14 19:08:48,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-14 19:08:48,216 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_drivers_base_class_destroy_classErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-12-14 19:08:48,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:08:48,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1120376943, now seen corresponding path program 1 times [2021-12-14 19:08:48,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:08:48,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544775756] [2021-12-14 19:08:48,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:08:48,217 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:08:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:48,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:08:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:48,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 19:08:48,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:48,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:08:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:48,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-14 19:08:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:48,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 19:08:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:48,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 19:08:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:48,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-14 19:08:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:48,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-14 19:08:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:48,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-14 19:08:48,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:48,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:08:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:48,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-14 19:08:48,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:48,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-12-14 19:08:48,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:48,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:08:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:48,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-14 19:08:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:48,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-14 19:08:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:48,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-12-14 19:08:48,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:48,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:08:48,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:48,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-12-14 19:08:48,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:48,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2021-12-14 19:08:48,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:48,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-14 19:08:48,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:48,857 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-12-14 19:08:48,857 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:08:48,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544775756] [2021-12-14 19:08:48,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544775756] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:08:48,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852765754] [2021-12-14 19:08:48,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:08:48,858 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:08:48,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:08:48,867 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:08:48,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 19:08:49,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:49,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 1897 conjuncts, 69 conjunts are in the unsatisfiable core [2021-12-14 19:08:49,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:08:50,029 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 82 proven. 8 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-12-14 19:08:50,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:08:50,857 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 8 proven. 23 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-12-14 19:08:50,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852765754] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:08:50,857 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:08:50,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 16] total 35 [2021-12-14 19:08:50,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791602690] [2021-12-14 19:08:50,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:08:50,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-12-14 19:08:50,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:08:50,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-14 19:08:50,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1095, Unknown=0, NotChecked=0, Total=1190 [2021-12-14 19:08:50,860 INFO L87 Difference]: Start difference. First operand 608 states and 698 transitions. Second operand has 35 states, 29 states have (on average 3.8275862068965516) internal successors, (111), 23 states have internal predecessors, (111), 10 states have call successors, (44), 5 states have call predecessors, (44), 9 states have return successors, (43), 16 states have call predecessors, (43), 10 states have call successors, (43) [2021-12-14 19:08:54,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:08:54,181 INFO L93 Difference]: Finished difference Result 1158 states and 1325 transitions. [2021-12-14 19:08:54,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-14 19:08:54,182 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 29 states have (on average 3.8275862068965516) internal successors, (111), 23 states have internal predecessors, (111), 10 states have call successors, (44), 5 states have call predecessors, (44), 9 states have return successors, (43), 16 states have call predecessors, (43), 10 states have call successors, (43) Word has length 130 [2021-12-14 19:08:54,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:08:54,185 INFO L225 Difference]: With dead ends: 1158 [2021-12-14 19:08:54,185 INFO L226 Difference]: Without dead ends: 595 [2021-12-14 19:08:54,187 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 273 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=263, Invalid=2493, Unknown=0, NotChecked=0, Total=2756 [2021-12-14 19:08:54,188 INFO L933 BasicCegarLoop]: 364 mSDtfsCounter, 877 mSDsluCounter, 4215 mSDsCounter, 0 mSdLazyCounter, 5641 mSolverCounterSat, 613 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 877 SdHoareTripleChecker+Valid, 4579 SdHoareTripleChecker+Invalid, 6254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 613 IncrementalHoareTripleChecker+Valid, 5641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2021-12-14 19:08:54,189 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [877 Valid, 4579 Invalid, 6254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [613 Valid, 5641 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2021-12-14 19:08:54,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2021-12-14 19:08:54,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 594. [2021-12-14 19:08:54,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 382 states have (on average 1.1518324607329844) internal successors, (440), 409 states have internal predecessors, (440), 120 states have call successors, (120), 70 states have call predecessors, (120), 69 states have return successors, (118), 116 states have call predecessors, (118), 118 states have call successors, (118) [2021-12-14 19:08:54,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 678 transitions. [2021-12-14 19:08:54,235 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 678 transitions. Word has length 130 [2021-12-14 19:08:54,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:08:54,235 INFO L470 AbstractCegarLoop]: Abstraction has 594 states and 678 transitions. [2021-12-14 19:08:54,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 29 states have (on average 3.8275862068965516) internal successors, (111), 23 states have internal predecessors, (111), 10 states have call successors, (44), 5 states have call predecessors, (44), 9 states have return successors, (43), 16 states have call predecessors, (43), 10 states have call successors, (43) [2021-12-14 19:08:54,235 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 678 transitions. [2021-12-14 19:08:54,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-12-14 19:08:54,237 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:08:54,237 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 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] [2021-12-14 19:08:54,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-14 19:08:54,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-14 19:08:54,463 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_drivers_base_class_destroy_classErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-12-14 19:08:54,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:08:54,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1544799765, now seen corresponding path program 1 times [2021-12-14 19:08:54,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:08:54,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113165231] [2021-12-14 19:08:54,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:08:54,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:08:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:54,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:08:54,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:54,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 19:08:54,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:54,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:08:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:54,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-14 19:08:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:54,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 19:08:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:54,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 19:08:54,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:54,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-14 19:08:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:54,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-14 19:08:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:54,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-14 19:08:54,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:54,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-14 19:08:54,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:54,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:08:54,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:54,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:08:54,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:54,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 19:08:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:54,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-14 19:08:54,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:54,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:08:54,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:54,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-14 19:08:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:54,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-14 19:08:54,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:54,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-14 19:08:54,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:54,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:08:54,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:54,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-12-14 19:08:54,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:54,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-14 19:08:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:54,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-12-14 19:08:54,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:54,694 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2021-12-14 19:08:54,694 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:08:54,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113165231] [2021-12-14 19:08:54,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113165231] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:08:54,695 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:08:54,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 19:08:54,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125073847] [2021-12-14 19:08:54,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:08:54,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:08:54,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:08:54,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:08:54,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:08:54,697 INFO L87 Difference]: Start difference. First operand 594 states and 678 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (23), 5 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-12-14 19:08:55,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:08:55,668 INFO L93 Difference]: Finished difference Result 1006 states and 1137 transitions. [2021-12-14 19:08:55,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 19:08:55,669 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (23), 5 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 141 [2021-12-14 19:08:55,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:08:55,674 INFO L225 Difference]: With dead ends: 1006 [2021-12-14 19:08:55,674 INFO L226 Difference]: Without dead ends: 1004 [2021-12-14 19:08:55,675 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2021-12-14 19:08:55,675 INFO L933 BasicCegarLoop]: 602 mSDtfsCounter, 826 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 1243 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-14 19:08:55,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [872 Valid, 1243 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-14 19:08:55,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2021-12-14 19:08:55,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 692. [2021-12-14 19:08:55,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 447 states have (on average 1.138702460850112) internal successors, (509), 475 states have internal predecessors, (509), 138 states have call successors, (138), 84 states have call predecessors, (138), 85 states have return successors, (140), 134 states have call predecessors, (140), 136 states have call successors, (140) [2021-12-14 19:08:55,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 787 transitions. [2021-12-14 19:08:55,731 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 787 transitions. Word has length 141 [2021-12-14 19:08:55,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:08:55,732 INFO L470 AbstractCegarLoop]: Abstraction has 692 states and 787 transitions. [2021-12-14 19:08:55,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (23), 5 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-12-14 19:08:55,732 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 787 transitions. [2021-12-14 19:08:55,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-12-14 19:08:55,733 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:08:55,734 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:08:55,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-14 19:08:55,734 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-12-14 19:08:55,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:08:55,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1102990983, now seen corresponding path program 1 times [2021-12-14 19:08:55,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:08:55,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725133810] [2021-12-14 19:08:55,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:08:55,735 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:08:55,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:56,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:08:56,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:56,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 19:08:56,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:56,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:08:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:56,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-14 19:08:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:56,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 19:08:56,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:56,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 19:08:56,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:56,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-14 19:08:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:56,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-14 19:08:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:56,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-14 19:08:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:56,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-14 19:08:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:56,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:08:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:56,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:08:56,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:56,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 19:08:56,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:56,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-14 19:08:56,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:56,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:08:56,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:56,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-14 19:08:56,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:56,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-14 19:08:56,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:56,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-14 19:08:56,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:56,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:08:56,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:56,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-12-14 19:08:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:56,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-14 19:08:56,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:56,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-14 19:08:56,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:56,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-14 19:08:56,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:56,601 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2021-12-14 19:08:56,601 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:08:56,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725133810] [2021-12-14 19:08:56,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725133810] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:08:56,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511406141] [2021-12-14 19:08:56,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:08:56,602 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:08:56,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:08:56,604 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:08:56,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 19:08:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:08:56,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 1933 conjuncts, 64 conjunts are in the unsatisfiable core [2021-12-14 19:08:56,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:08:57,948 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 48 proven. 18 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-12-14 19:08:57,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:08:58,844 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2021-12-14 19:08:58,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511406141] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:08:58,845 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:08:58,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 16, 15] total 48 [2021-12-14 19:08:58,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273964628] [2021-12-14 19:08:58,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:08:58,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-12-14 19:08:58,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:08:58,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-12-14 19:08:58,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=2143, Unknown=0, NotChecked=0, Total=2256 [2021-12-14 19:08:58,848 INFO L87 Difference]: Start difference. First operand 692 states and 787 transitions. Second operand has 48 states, 43 states have (on average 3.953488372093023) internal successors, (170), 38 states have internal predecessors, (170), 18 states have call successors, (61), 7 states have call predecessors, (61), 11 states have return successors, (63), 20 states have call predecessors, (63), 18 states have call successors, (63) [2021-12-14 19:09:04,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:09:04,755 INFO L93 Difference]: Finished difference Result 980 states and 1109 transitions. [2021-12-14 19:09:04,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-12-14 19:09:04,757 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 43 states have (on average 3.953488372093023) internal successors, (170), 38 states have internal predecessors, (170), 18 states have call successors, (61), 7 states have call predecessors, (61), 11 states have return successors, (63), 20 states have call predecessors, (63), 18 states have call successors, (63) Word has length 144 [2021-12-14 19:09:04,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:09:04,762 INFO L225 Difference]: With dead ends: 980 [2021-12-14 19:09:04,762 INFO L226 Difference]: Without dead ends: 694 [2021-12-14 19:09:04,764 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=581, Invalid=5739, Unknown=0, NotChecked=0, Total=6320 [2021-12-14 19:09:04,765 INFO L933 BasicCegarLoop]: 305 mSDtfsCounter, 1826 mSDsluCounter, 3860 mSDsCounter, 0 mSdLazyCounter, 8777 mSolverCounterSat, 1439 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1828 SdHoareTripleChecker+Valid, 4165 SdHoareTripleChecker+Invalid, 10216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1439 IncrementalHoareTripleChecker+Valid, 8777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:09:04,765 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1828 Valid, 4165 Invalid, 10216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1439 Valid, 8777 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2021-12-14 19:09:04,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2021-12-14 19:09:04,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 694. [2021-12-14 19:09:04,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 447 states have (on average 1.1364653243847875) internal successors, (508), 477 states have internal predecessors, (508), 138 states have call successors, (138), 84 states have call predecessors, (138), 87 states have return successors, (142), 134 states have call predecessors, (142), 136 states have call successors, (142) [2021-12-14 19:09:04,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 788 transitions. [2021-12-14 19:09:04,840 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 788 transitions. Word has length 144 [2021-12-14 19:09:04,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:09:04,843 INFO L470 AbstractCegarLoop]: Abstraction has 694 states and 788 transitions. [2021-12-14 19:09:04,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 43 states have (on average 3.953488372093023) internal successors, (170), 38 states have internal predecessors, (170), 18 states have call successors, (61), 7 states have call predecessors, (61), 11 states have return successors, (63), 20 states have call predecessors, (63), 18 states have call successors, (63) [2021-12-14 19:09:04,844 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 788 transitions. [2021-12-14 19:09:04,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-12-14 19:09:04,845 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:09:04,845 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 4, 4, 3, 3, 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-12-14 19:09:04,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-14 19:09:05,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-14 19:09:05,072 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_usb_gadget_destroy_classErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-12-14 19:09:05,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:09:05,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1550649940, now seen corresponding path program 1 times [2021-12-14 19:09:05,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:09:05,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746784195] [2021-12-14 19:09:05,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:09:05,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:09:05,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:05,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:09:05,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:05,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 19:09:05,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:05,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:09:05,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:05,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-14 19:09:05,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:05,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 19:09:05,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:05,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 19:09:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:05,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-14 19:09:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:05,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-14 19:09:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:05,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-14 19:09:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:05,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-14 19:09:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:05,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:09:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:05,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:09:05,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:05,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 19:09:05,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:05,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-14 19:09:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:05,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:09:05,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:05,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-14 19:09:05,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:05,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:09:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:05,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:09:05,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:05,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-14 19:09:05,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:05,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:09:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:05,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:09:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:05,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-14 19:09:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:05,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-12-14 19:09:05,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:05,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-14 19:09:05,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:05,336 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2021-12-14 19:09:05,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:09:05,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746784195] [2021-12-14 19:09:05,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746784195] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:09:05,336 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:09:05,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 19:09:05,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091788637] [2021-12-14 19:09:05,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:09:05,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:09:05,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:09:05,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:09:05,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:09:05,339 INFO L87 Difference]: Start difference. First operand 694 states and 788 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (23), 4 states have call predecessors, (23), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-12-14 19:09:05,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:09:05,966 INFO L93 Difference]: Finished difference Result 702 states and 800 transitions. [2021-12-14 19:09:05,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 19:09:05,966 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (23), 4 states have call predecessors, (23), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 154 [2021-12-14 19:09:05,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:09:05,969 INFO L225 Difference]: With dead ends: 702 [2021-12-14 19:09:05,970 INFO L226 Difference]: Without dead ends: 700 [2021-12-14 19:09:05,970 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2021-12-14 19:09:05,971 INFO L933 BasicCegarLoop]: 371 mSDtfsCounter, 639 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 1089 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 19:09:05,971 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [696 Valid, 1089 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 19:09:05,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2021-12-14 19:09:06,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 692. [2021-12-14 19:09:06,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 446 states have (on average 1.1278026905829597) internal successors, (503), 475 states have internal predecessors, (503), 138 states have call successors, (138), 84 states have call predecessors, (138), 87 states have return successors, (142), 134 states have call predecessors, (142), 136 states have call successors, (142) [2021-12-14 19:09:06,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 783 transitions. [2021-12-14 19:09:06,054 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 783 transitions. Word has length 154 [2021-12-14 19:09:06,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:09:06,054 INFO L470 AbstractCegarLoop]: Abstraction has 692 states and 783 transitions. [2021-12-14 19:09:06,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (23), 4 states have call predecessors, (23), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-12-14 19:09:06,055 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 783 transitions. [2021-12-14 19:09:06,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2021-12-14 19:09:06,057 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:09:06,057 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 4, 4, 3, 3, 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] [2021-12-14 19:09:06,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-14 19:09:06,058 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-12-14 19:09:06,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:09:06,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1383868732, now seen corresponding path program 1 times [2021-12-14 19:09:06,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:09:06,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349560868] [2021-12-14 19:09:06,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:09:06,059 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:09:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:06,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:09:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:06,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 19:09:06,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:06,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:09:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:06,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-14 19:09:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:06,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 19:09:06,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:06,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 19:09:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:06,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-14 19:09:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:06,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-14 19:09:06,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:06,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-14 19:09:06,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:06,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-14 19:09:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:06,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:09:06,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:06,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:09:06,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:06,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 19:09:06,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:06,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-14 19:09:06,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:06,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:09:06,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:06,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-14 19:09:06,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:06,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:09:06,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:06,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:09:06,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:06,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-14 19:09:06,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:06,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:09:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:06,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:09:06,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:06,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-14 19:09:06,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:06,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-14 19:09:06,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:06,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-14 19:09:06,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:06,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-14 19:09:06,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:06,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:09:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:06,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2021-12-14 19:09:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:06,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2021-12-14 19:09:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:06,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2021-12-14 19:09:06,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:06,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2021-12-14 19:09:06,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:06,323 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2021-12-14 19:09:06,323 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:09:06,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349560868] [2021-12-14 19:09:06,324 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349560868] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:09:06,324 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:09:06,324 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 19:09:06,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433123101] [2021-12-14 19:09:06,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:09:06,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:09:06,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:09:06,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:09:06,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:09:06,327 INFO L87 Difference]: Start difference. First operand 692 states and 783 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2021-12-14 19:09:06,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:09:06,884 INFO L93 Difference]: Finished difference Result 692 states and 783 transitions. [2021-12-14 19:09:06,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:09:06,884 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (29), 5 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 191 [2021-12-14 19:09:06,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:09:06,888 INFO L225 Difference]: With dead ends: 692 [2021-12-14 19:09:06,888 INFO L226 Difference]: Without dead ends: 690 [2021-12-14 19:09:06,888 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-12-14 19:09:06,889 INFO L933 BasicCegarLoop]: 373 mSDtfsCounter, 782 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:09:06,889 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [825 Valid, 759 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 19:09:06,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2021-12-14 19:09:06,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 690. [2021-12-14 19:09:06,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 445 states have (on average 1.1235955056179776) internal successors, (500), 473 states have internal predecessors, (500), 138 states have call successors, (138), 84 states have call predecessors, (138), 87 states have return successors, (142), 134 states have call predecessors, (142), 136 states have call successors, (142) [2021-12-14 19:09:06,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 780 transitions. [2021-12-14 19:09:06,982 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 780 transitions. Word has length 191 [2021-12-14 19:09:06,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:09:06,983 INFO L470 AbstractCegarLoop]: Abstraction has 690 states and 780 transitions. [2021-12-14 19:09:06,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2021-12-14 19:09:06,983 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 780 transitions. [2021-12-14 19:09:06,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2021-12-14 19:09:06,987 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:09:06,987 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 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] [2021-12-14 19:09:06,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-14 19:09:06,987 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-12-14 19:09:06,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:09:06,988 INFO L85 PathProgramCache]: Analyzing trace with hash 861548606, now seen corresponding path program 1 times [2021-12-14 19:09:06,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:09:06,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23834665] [2021-12-14 19:09:06,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:09:06,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:09:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:07,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:09:07,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:07,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 19:09:07,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:07,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:09:07,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:07,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-14 19:09:07,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:07,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 19:09:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:07,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 19:09:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:07,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-14 19:09:07,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:07,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-14 19:09:07,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:07,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-14 19:09:07,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:07,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-14 19:09:07,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:07,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:09:07,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:07,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:09:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:07,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 19:09:07,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:07,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-14 19:09:07,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:07,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:09:07,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:07,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-14 19:09:07,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:07,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:09:07,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:07,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:09:07,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:07,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-14 19:09:07,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:07,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:09:07,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:07,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:09:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:07,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-14 19:09:07,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:07,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-14 19:09:07,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:07,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-14 19:09:07,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:07,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-14 19:09:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:07,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:09:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:07,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2021-12-14 19:09:07,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:07,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2021-12-14 19:09:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:07,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2021-12-14 19:09:07,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:07,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:09:07,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:07,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2021-12-14 19:09:07,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:07,967 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2021-12-14 19:09:07,968 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:09:07,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23834665] [2021-12-14 19:09:07,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23834665] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:09:07,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179925535] [2021-12-14 19:09:07,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:09:07,968 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:09:07,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:09:07,970 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:09:07,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-14 19:09:08,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:08,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 2094 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-14 19:09:08,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:09:08,757 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2021-12-14 19:09:08,757 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:09:08,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179925535] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:09:08,757 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 19:09:08,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [25] total 30 [2021-12-14 19:09:08,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753086958] [2021-12-14 19:09:08,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:09:08,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:09:08,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:09:08,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:09:08,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=807, Unknown=0, NotChecked=0, Total=870 [2021-12-14 19:09:08,759 INFO L87 Difference]: Start difference. First operand 690 states and 780 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 3 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2021-12-14 19:09:09,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:09:09,015 INFO L93 Difference]: Finished difference Result 963 states and 1090 transitions. [2021-12-14 19:09:09,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:09:09,016 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 3 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) Word has length 195 [2021-12-14 19:09:09,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:09:09,019 INFO L225 Difference]: With dead ends: 963 [2021-12-14 19:09:09,019 INFO L226 Difference]: Without dead ends: 695 [2021-12-14 19:09:09,022 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=91, Invalid=1031, Unknown=0, NotChecked=0, Total=1122 [2021-12-14 19:09:09,022 INFO L933 BasicCegarLoop]: 487 mSDtfsCounter, 80 mSDsluCounter, 2187 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 2674 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:09:09,023 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 2674 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:09:09,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2021-12-14 19:09:09,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 670. [2021-12-14 19:09:09,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 434 states have (on average 1.1221198156682028) internal successors, (487), 460 states have internal predecessors, (487), 130 states have call successors, (130), 84 states have call predecessors, (130), 86 states have return successors, (132), 127 states have call predecessors, (132), 128 states have call successors, (132) [2021-12-14 19:09:09,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 749 transitions. [2021-12-14 19:09:09,090 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 749 transitions. Word has length 195 [2021-12-14 19:09:09,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:09:09,091 INFO L470 AbstractCegarLoop]: Abstraction has 670 states and 749 transitions. [2021-12-14 19:09:09,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 3 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2021-12-14 19:09:09,091 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 749 transitions. [2021-12-14 19:09:09,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2021-12-14 19:09:09,093 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:09:09,094 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 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] [2021-12-14 19:09:09,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-14 19:09:09,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:09:09,320 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-12-14 19:09:09,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:09:09,320 INFO L85 PathProgramCache]: Analyzing trace with hash 939826584, now seen corresponding path program 1 times [2021-12-14 19:09:09,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:09:09,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559695187] [2021-12-14 19:09:09,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:09:09,321 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:09:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:09,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:09:09,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:09,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 19:09:09,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:09,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:09:09,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:09,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-14 19:09:09,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:09,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 19:09:09,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:09,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 19:09:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:09,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-14 19:09:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:09,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-14 19:09:09,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:09,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-14 19:09:09,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:09,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-14 19:09:09,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:09,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:09:09,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:09,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:09:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:09,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 19:09:09,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:09,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-14 19:09:09,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:09,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:09:09,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:09,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-14 19:09:09,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:09,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:09:09,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:09,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:09:09,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:09,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-14 19:09:09,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:09,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-14 19:09:09,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:09,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:09:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:09,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:09:09,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:09,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-14 19:09:09,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:09,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-12-14 19:09:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:09,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-12-14 19:09:09,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:09,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-14 19:09:09,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:09,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:09:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:09,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2021-12-14 19:09:09,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:09,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2021-12-14 19:09:09,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:09,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2021-12-14 19:09:09,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:09,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:09:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:09,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2021-12-14 19:09:09,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:09,594 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2021-12-14 19:09:09,595 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:09:09,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559695187] [2021-12-14 19:09:09,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559695187] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:09:09,595 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:09:09,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 19:09:09,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625652040] [2021-12-14 19:09:09,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:09:09,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:09:09,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:09:09,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:09:09,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:09:09,597 INFO L87 Difference]: Start difference. First operand 670 states and 749 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2021-12-14 19:09:10,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:09:10,536 INFO L93 Difference]: Finished difference Result 709 states and 770 transitions. [2021-12-14 19:09:10,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 19:09:10,537 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 201 [2021-12-14 19:09:10,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:09:10,540 INFO L225 Difference]: With dead ends: 709 [2021-12-14 19:09:10,540 INFO L226 Difference]: Without dead ends: 707 [2021-12-14 19:09:10,540 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2021-12-14 19:09:10,541 INFO L933 BasicCegarLoop]: 413 mSDtfsCounter, 1479 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 494 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1522 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 494 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-14 19:09:10,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1522 Valid, 1037 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [494 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-14 19:09:10,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2021-12-14 19:09:10,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 668. [2021-12-14 19:09:10,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 433 states have (on average 1.120092378752887) internal successors, (485), 458 states have internal predecessors, (485), 130 states have call successors, (130), 84 states have call predecessors, (130), 86 states have return successors, (132), 127 states have call predecessors, (132), 128 states have call successors, (132) [2021-12-14 19:09:10,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 747 transitions. [2021-12-14 19:09:10,609 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 747 transitions. Word has length 201 [2021-12-14 19:09:10,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:09:10,609 INFO L470 AbstractCegarLoop]: Abstraction has 668 states and 747 transitions. [2021-12-14 19:09:10,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2021-12-14 19:09:10,610 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 747 transitions. [2021-12-14 19:09:10,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2021-12-14 19:09:10,612 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:09:10,612 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 4, 4, 3, 3, 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] [2021-12-14 19:09:10,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-14 19:09:10,613 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-12-14 19:09:10,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:09:10,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1991896125, now seen corresponding path program 1 times [2021-12-14 19:09:10,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:09:10,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243204340] [2021-12-14 19:09:10,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:09:10,614 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:09:10,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:10,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:09:10,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:10,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 19:09:10,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:10,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:09:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:10,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-14 19:09:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:10,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 19:09:10,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:10,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 19:09:10,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:10,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-14 19:09:10,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:10,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-14 19:09:10,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:10,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-14 19:09:10,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:10,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-14 19:09:10,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:10,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:09:10,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:10,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:09:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:10,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 19:09:10,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:10,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-14 19:09:10,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:10,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:09:10,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:10,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-14 19:09:10,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:10,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:09:10,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:10,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:09:10,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:10,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-14 19:09:10,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:10,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:09:10,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:10,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:09:10,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:10,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-14 19:09:10,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:10,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-12-14 19:09:10,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:10,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-14 19:09:10,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:10,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-12-14 19:09:10,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:10,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-14 19:09:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:10,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-12-14 19:09:10,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:10,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:09:10,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:10,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2021-12-14 19:09:10,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:10,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2021-12-14 19:09:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:10,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2021-12-14 19:09:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:10,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2021-12-14 19:09:10,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:10,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2021-12-14 19:09:10,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:10,886 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2021-12-14 19:09:10,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:09:10,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243204340] [2021-12-14 19:09:10,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243204340] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:09:10,887 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:09:10,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 19:09:10,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595660410] [2021-12-14 19:09:10,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:09:10,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:09:10,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:09:10,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:09:10,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:09:10,889 INFO L87 Difference]: Start difference. First operand 668 states and 747 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (32), 6 states have call predecessors, (32), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2021-12-14 19:09:11,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:09:11,546 INFO L93 Difference]: Finished difference Result 668 states and 747 transitions. [2021-12-14 19:09:11,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 19:09:11,546 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (32), 6 states have call predecessors, (32), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 208 [2021-12-14 19:09:11,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:09:11,555 INFO L225 Difference]: With dead ends: 668 [2021-12-14 19:09:11,556 INFO L226 Difference]: Without dead ends: 666 [2021-12-14 19:09:11,556 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-12-14 19:09:11,557 INFO L933 BasicCegarLoop]: 367 mSDtfsCounter, 946 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 987 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 19:09:11,557 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [987 Valid, 803 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 19:09:11,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2021-12-14 19:09:11,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 666. [2021-12-14 19:09:11,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 432 states have (on average 1.1157407407407407) internal successors, (482), 456 states have internal predecessors, (482), 130 states have call successors, (130), 84 states have call predecessors, (130), 86 states have return successors, (132), 127 states have call predecessors, (132), 128 states have call successors, (132) [2021-12-14 19:09:11,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 744 transitions. [2021-12-14 19:09:11,628 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 744 transitions. Word has length 208 [2021-12-14 19:09:11,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:09:11,628 INFO L470 AbstractCegarLoop]: Abstraction has 666 states and 744 transitions. [2021-12-14 19:09:11,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (32), 6 states have call predecessors, (32), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2021-12-14 19:09:11,629 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 744 transitions. [2021-12-14 19:09:11,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2021-12-14 19:09:11,631 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:09:11,631 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 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] [2021-12-14 19:09:11,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-14 19:09:11,632 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-12-14 19:09:11,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:09:11,632 INFO L85 PathProgramCache]: Analyzing trace with hash -513662302, now seen corresponding path program 1 times [2021-12-14 19:09:11,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:09:11,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473023718] [2021-12-14 19:09:11,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:09:11,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:09:11,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:11,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:09:11,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:11,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 19:09:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:11,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:09:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:11,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-14 19:09:11,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:11,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 19:09:11,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:11,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 19:09:11,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:11,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-14 19:09:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:11,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-14 19:09:11,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:11,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-14 19:09:11,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:11,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-14 19:09:11,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:11,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:09:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:11,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:09:11,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:11,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 19:09:11,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:11,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-14 19:09:11,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:11,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:09:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:11,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-14 19:09:11,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:11,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:09:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:11,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:09:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:11,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-14 19:09:11,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:11,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-14 19:09:11,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:11,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:09:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:11,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:09:11,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:11,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-14 19:09:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:11,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-12-14 19:09:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:11,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-12-14 19:09:11,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:11,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-14 19:09:11,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:11,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:09:11,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:11,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2021-12-14 19:09:11,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:11,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2021-12-14 19:09:11,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:11,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2021-12-14 19:09:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:11,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:09:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:11,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2021-12-14 19:09:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:11,936 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2021-12-14 19:09:11,936 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:09:11,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473023718] [2021-12-14 19:09:11,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473023718] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:09:11,937 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:09:11,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-14 19:09:11,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197432159] [2021-12-14 19:09:11,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:09:11,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 19:09:11,938 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:09:11,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 19:09:11,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:09:11,939 INFO L87 Difference]: Start difference. First operand 666 states and 744 transitions. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (30), 5 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2021-12-14 19:09:12,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:09:12,672 INFO L93 Difference]: Finished difference Result 666 states and 744 transitions. [2021-12-14 19:09:12,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 19:09:12,673 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (30), 5 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 204 [2021-12-14 19:09:12,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:09:12,675 INFO L225 Difference]: With dead ends: 666 [2021-12-14 19:09:12,675 INFO L226 Difference]: Without dead ends: 664 [2021-12-14 19:09:12,676 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2021-12-14 19:09:12,676 INFO L933 BasicCegarLoop]: 341 mSDtfsCounter, 938 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 417 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 1324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 417 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-14 19:09:12,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [969 Valid, 1078 Invalid, 1324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [417 Valid, 907 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-14 19:09:12,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2021-12-14 19:09:12,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 664. [2021-12-14 19:09:12,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 431 states have (on average 1.1136890951276102) internal successors, (480), 454 states have internal predecessors, (480), 130 states have call successors, (130), 84 states have call predecessors, (130), 86 states have return successors, (132), 127 states have call predecessors, (132), 128 states have call successors, (132) [2021-12-14 19:09:12,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 742 transitions. [2021-12-14 19:09:12,745 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 742 transitions. Word has length 204 [2021-12-14 19:09:12,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:09:12,746 INFO L470 AbstractCegarLoop]: Abstraction has 664 states and 742 transitions. [2021-12-14 19:09:12,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (30), 5 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2021-12-14 19:09:12,746 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 742 transitions. [2021-12-14 19:09:12,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2021-12-14 19:09:12,749 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:09:12,749 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:09:12,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-14 19:09:12,750 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-12-14 19:09:12,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:09:12,750 INFO L85 PathProgramCache]: Analyzing trace with hash -600142417, now seen corresponding path program 1 times [2021-12-14 19:09:12,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:09:12,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739238777] [2021-12-14 19:09:12,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:09:12,751 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:09:12,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:13,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:09:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:13,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 19:09:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:13,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:09:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:13,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-14 19:09:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:13,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 19:09:13,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:13,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 19:09:13,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:13,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-14 19:09:13,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:13,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-14 19:09:13,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:13,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-14 19:09:13,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:13,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-14 19:09:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:13,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:09:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:13,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:09:13,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:13,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 19:09:13,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:13,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-14 19:09:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:13,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:09:13,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:13,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-14 19:09:13,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:13,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:09:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:13,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:09:13,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:13,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-14 19:09:13,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:13,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:09:13,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:13,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:09:13,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:13,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-14 19:09:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:13,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-12-14 19:09:13,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:13,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-14 19:09:13,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:13,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-12-14 19:09:13,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:13,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-14 19:09:13,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:13,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-12-14 19:09:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:13,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:09:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:13,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2021-12-14 19:09:13,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:13,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2021-12-14 19:09:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:13,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2021-12-14 19:09:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:13,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2021-12-14 19:09:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:13,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2021-12-14 19:09:13,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:13,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2021-12-14 19:09:13,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:13,488 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2021-12-14 19:09:13,488 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:09:13,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739238777] [2021-12-14 19:09:13,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739238777] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:09:13,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053925362] [2021-12-14 19:09:13,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:09:13,489 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:09:13,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:09:13,490 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:09:13,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 19:09:13,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:13,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 2096 conjuncts, 64 conjunts are in the unsatisfiable core [2021-12-14 19:09:13,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:09:14,611 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 153 proven. 21 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2021-12-14 19:09:14,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:09:15,405 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2021-12-14 19:09:15,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053925362] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:09:15,406 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:09:15,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 15] total 33 [2021-12-14 19:09:15,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62436952] [2021-12-14 19:09:15,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:09:15,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-14 19:09:15,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:09:15,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-14 19:09:15,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=979, Unknown=0, NotChecked=0, Total=1056 [2021-12-14 19:09:15,409 INFO L87 Difference]: Start difference. First operand 664 states and 742 transitions. Second operand has 33 states, 30 states have (on average 6.3) internal successors, (189), 27 states have internal predecessors, (189), 13 states have call successors, (71), 7 states have call predecessors, (71), 8 states have return successors, (68), 14 states have call predecessors, (68), 13 states have call successors, (68)